Submission #1772878


Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define re(i,a,b) for(int i=(a);i<(b);i++)
#define repd(i,a,b) for(int i=(a);i>=(b);i--)
#define run(a) for(int k=head[a];k;k=e[k].ne)
#define v e[k].t
#define clr(a) memset(a,0,sizeof(a));
#define il inline
#define sz(a) ((int)a.size())
#define all(a) a.begin(),a.end()
#define mp make_pair
#define pb push_back 
#define w1 first
#define w2 second
#define adm(a,b,c) {a=a+b;if(a>=c)a-=c;else if(a<0)a+=c;}
typedef double db;
typedef long long ll;typedef long double ld;typedef unsigned long long ull;
typedef pair<ll,ll> pa;
const int N=1e6+5,M=5e3+5,INF=1e9,mod=998244353;
const ll linf=1e18;const double eps=1e-8,pi=acos(-1);
il int gmin(int &a,int b){if(a>b)a=b;}il ll gmin(ll &a,ll b){if(a>b)a=b;}il int gmax(int &a,int b){if(a<b)a=b;}il ll gmax(ll &a,ll b){if(a<b)a=b;}
il void read(ll&x){ll f=1,t=0;char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9'){t=t*10+ch-'0';ch=getchar();}x=t*f;}il ll read(ll&x,ll&y){read(x);read(y);}
il void read(int&x){int f=1,t=0;char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9'){t=t*10+ch-'0';ch=getchar();}x=t*f;}il int read(int&x,int&y){read(x);read(y);}
il void read(int&a,int&b,int&c){read(a);read(b);read(c);}il void read(ll&a,ll&b,ll&c){read(a);read(b);read(c);}
il int read(){int x;read(x);return x;}
il ll qpow(ll a,ll b,ll p){ll ret=1;for(;b;b>>=1,a=a*a%p)if(b&1)ret=ret*a%p;return ret;}il ll qpow(ll a,ll b){ll ret=1;for(;b;b>>=1,a=a*a%mod)if(b&1)ret=ret*a%mod;return ret;}
il ll qmul(ll a,ll b,ll p){ll ret=0;for(;b;b>>=1,a=(a<<1)%p)if(b&1)adm(ret,a,p);return ret;}il ll qmul(ll a,ll b){ll ret=0;for(;b;b>>=1,a=(a<<1)%mod)if(b&1)adm(ret,a,mod);return ret;}
il void judge(){
	freopen("data.in","r",stdin);
	freopen("data.out","w",stdout);}
map<int,int>id;
int a[N],b[N],fa[N],n,dex;
int getf(int x){return fa[x]==x?x:fa[x]=getf(fa[x]);}
int main(){
	read(n);rep(i,1,n)read(a[i]);rep(i,1,n)read(b[i]);
	int xo=0;
	rep(i,1,n)xo^=a[i];a[n+1]=xo;
	xo=0;
	rep(i,1,n)xo^=b[i];b[n+1]=xo;
	n++;vector<int>a1,b1;
	rep(i,1,n)a1.pb(a[i]),b1.pb(b[i]);
	sort(a1.begin(),a1.end());sort(b1.begin(),b1.end());
	re(i,0,a1.size())if(a1[i]!=b1[i])return puts("-1"),0;
	int ans=0;
	rep(i,1,n)if(a[i]!=b[i]||i==n){
		if(i!=n)ans++;
		if(!id[a[i]])id[a[i]]=++dex;
		if(!id[b[i]])id[b[i]]=++dex;
	}
	if(!ans)return puts("0\n"),0;
	rep(i,1,dex)fa[i]=i;
	rep(i,1,n)if(a[i]!=b[i])fa[getf(id[a[i]])]=getf(id[b[i]]);
	rep(i,1,dex)if(fa[i]==i)ans++;
	ans--;
	cout<<ans<<endl;
}

Submission Info

Submission Time
Task D - XOR Replace
User xjt
Language C++14 (GCC 5.4.1)
Score 1000
Code Size 2626 Byte
Status AC
Exec Time 147 ms
Memory 15860 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 1000 / 1000
Status
AC × 4
AC × 74
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt, 1_26.txt, 1_27.txt, 1_28.txt, 1_29.txt, 1_30.txt, 1_31.txt, 1_32.txt, 1_33.txt, 1_34.txt, 1_35.txt, 1_36.txt, 1_37.txt, 1_38.txt, 1_39.txt, 1_40.txt, 1_41.txt, 1_42.txt, 1_43.txt, 1_44.txt, 1_45.txt, 1_46.txt, 1_47.txt, 1_48.txt, 1_49.txt, 1_50.txt, 1_51.txt, 1_52.txt, 1_53.txt, 1_54.txt, 1_55.txt, 1_56.txt, 1_57.txt, 1_58.txt, 1_59.txt, 1_60.txt, 1_61.txt, 1_62.txt, 1_63.txt, 1_64.txt, 1_65.txt, 1_66.txt, 1_67.txt, 1_68.txt, 1_69.txt
Case Name Status Exec Time Memory
0_00.txt AC 2 ms 4352 KB
0_01.txt AC 2 ms 4352 KB
0_02.txt AC 2 ms 4352 KB
0_03.txt AC 2 ms 4352 KB
1_00.txt AC 2 ms 4352 KB
1_01.txt AC 2 ms 4352 KB
1_02.txt AC 2 ms 4352 KB
1_03.txt AC 2 ms 4352 KB
1_04.txt AC 2 ms 4352 KB
1_05.txt AC 2 ms 4352 KB
1_06.txt AC 2 ms 4352 KB
1_07.txt AC 27 ms 9468 KB
1_08.txt AC 86 ms 15860 KB
1_09.txt AC 82 ms 14324 KB
1_10.txt AC 19 ms 9468 KB
1_11.txt AC 17 ms 9468 KB
1_12.txt AC 19 ms 9468 KB
1_13.txt AC 19 ms 9468 KB
1_14.txt AC 28 ms 9468 KB
1_15.txt AC 22 ms 9468 KB
1_16.txt AC 29 ms 9468 KB
1_17.txt AC 23 ms 9468 KB
1_18.txt AC 35 ms 9468 KB
1_19.txt AC 24 ms 9468 KB
1_20.txt AC 34 ms 9468 KB
1_21.txt AC 25 ms 9468 KB
1_22.txt AC 41 ms 9468 KB
1_23.txt AC 26 ms 9468 KB
1_24.txt AC 40 ms 9468 KB
1_25.txt AC 26 ms 9468 KB
1_26.txt AC 46 ms 9468 KB
1_27.txt AC 27 ms 9468 KB
1_28.txt AC 47 ms 9468 KB
1_29.txt AC 28 ms 9468 KB
1_30.txt AC 57 ms 9468 KB
1_31.txt AC 28 ms 9468 KB
1_32.txt AC 57 ms 9468 KB
1_33.txt AC 29 ms 9468 KB
1_34.txt AC 74 ms 9588 KB
1_35.txt AC 30 ms 9468 KB
1_36.txt AC 73 ms 9588 KB
1_37.txt AC 30 ms 9468 KB
1_38.txt AC 104 ms 10868 KB
1_39.txt AC 31 ms 9468 KB
1_40.txt AC 103 ms 10740 KB
1_41.txt AC 32 ms 9468 KB
1_42.txt AC 128 ms 12660 KB
1_43.txt AC 32 ms 9468 KB
1_44.txt AC 131 ms 12788 KB
1_45.txt AC 32 ms 9468 KB
1_46.txt AC 142 ms 13812 KB
1_47.txt AC 31 ms 9468 KB
1_48.txt AC 140 ms 13812 KB
1_49.txt AC 32 ms 9468 KB
1_50.txt AC 140 ms 14068 KB
1_51.txt AC 31 ms 9468 KB
1_52.txt AC 141 ms 14196 KB
1_53.txt AC 32 ms 9468 KB
1_54.txt AC 147 ms 14196 KB
1_55.txt AC 31 ms 9468 KB
1_56.txt AC 142 ms 14324 KB
1_57.txt AC 32 ms 9468 KB
1_58.txt AC 145 ms 14324 KB
1_59.txt AC 32 ms 9468 KB
1_60.txt AC 143 ms 14324 KB
1_61.txt AC 32 ms 9468 KB
1_62.txt AC 146 ms 14324 KB
1_63.txt AC 30 ms 9468 KB
1_64.txt AC 139 ms 14196 KB
1_65.txt AC 31 ms 9468 KB
1_66.txt AC 141 ms 14196 KB
1_67.txt AC 31 ms 9468 KB
1_68.txt AC 144 ms 14324 KB
1_69.txt AC 32 ms 9468 KB