Submission #3749657

---

Source Code Expand

#include<bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define SZ(x) ((int)x.size())
#define L(i,u) for (register int i=head[u]; i; i=nxt[i])
#define rep(i,a,b) for (register int i=(a); i<=(b); i++)
#define per(i,a,b) for (register int i=(a); i>=(b); i--)
using namespace std;
typedef long long ll;
typedef unsigned int ui;
typedef pair<int,int> Pii;
typedef vector<int> Vi;
inline void read(int &x) {
	x=0; char c=getchar(); int f=1;
	while (!isdigit(c)) {if (c=='-') f=-1; c=getchar();}
	while (isdigit(c)) {x=x*10+c-'0'; c=getchar();} x*=f;
}
inline ui R() {
	static ui seed=416;
	return seed^=seed>>5,seed^=seed<<17,seed^=seed>>13;
}
const int N = 233333;
int n,a[N],b[N];map<int,int>Map;int cnt,fa[N];bool vis[N];
void ins(int x){if(!Map.count(x))Map[x]=++cnt;}
int find(int x){return fa[x]==x?x:fa[x]=find(fa[x]);}
bool gg(){
	Vi c,d;rep(i,0,n)c.pb(a[i]),d.pb(b[i]);
	sort(c.begin(),c.end());sort(d.begin(),d.end());
	return c!=d;
}
int main() {
	read(n);rep(i,1,n)read(a[i]),a[0]^=a[i];
	rep(i,1,n)read(b[i]),b[0]^=b[i];
	if(gg()){puts("-1");return 0;}
	bool same=1;rep(i,1,n)same&=a[i]==b[i];if(same){puts("0");return 0;}
	rep(i,0,n)ins(a[i]),ins(b[i]);
	rep(i,1,n*2+5)fa[i]=i;
	int res=-2;
	rep(i,0,n)if(a[i]!=b[i]||i==0){
		int x=find(Map[a[i]]),y=find(Map[b[i]]);
		res++;fa[x]=y;vis[y]=1;
	}
	rep(i,1,cnt)if(find(i)==i&&vis[i])res++;
	cout<<res;
	return 0;
}

Submission Info

Judge Result