Submission #1775013


Source Code Expand

#include <iostream>
#include <stdio.h>
#include <math.h>
#include <string.h>
#include <time.h>
#include <stdlib.h>
#include <string>
#include <bitset>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <algorithm>
#include <sstream>
#include <stack>
#include <iomanip>
using namespace std;
#define pb push_back
#define mp make_pair
typedef pair<int,int> pii;
typedef long long ll;
typedef double ld;
typedef vector<int> vi;
#define fi first
#define se second
#define fe first
#define FO(x) {freopen(#x".in","r",stdin);freopen(#x".out","w",stdout);}
#define Edg int M=0,fst[SZ],vb[SZ],nxt[SZ];void ad_de(int a,int b){++M;nxt[M]=fst[a];fst[a]=M;vb[M]=b;}void adde(int a,int b){ad_de(a,b);ad_de(b,a);}
#define Edgc int M=0,fst[SZ],vb[SZ],nxt[SZ],vc[SZ];void ad_de(int a,int b,int c){++M;nxt[M]=fst[a];fst[a]=M;vb[M]=b;vc[M]=c;}void adde(int a,int b,int c){ad_de(a,b,c);ad_de(b,a,c);}
#define es(x,e) (int e=fst[x];e;e=nxt[e])
#define esb(x,e,b) (int e=fst[x],b=vb[e];e;e=nxt[e],b=vb[e])
#define SZ 666666
int n,a[SZ],b[SZ],an=0,ff[SZ],ed=0;
map<int,int> id;
int gf(int x) {return ff[x]?ff[x]=gf(ff[x]):x;}
inline int al(int x)
{int&p=id[x]; if(!p) p=++an; return p;}
inline void uni(int a,int b)
{
	int ga=gf(a),gb=gf(b);
	if(ga^gb) ff[ga]=gb;
}
int main()
{
	scanf("%d",&n); int e=-1;
	for(int i=1;i<=n;++i)
		scanf("%d",a+i),a[0]^=a[i];
	for(int i=1;i<=n;++i)
		scanf("%d",b+i),b[0]^=b[i];
	for(int i=1;i<=n;++i)
		if(a[i]!=b[i]) uni(al(a[i]),al(b[i])),++e;
	al(a[0]); al(b[0]);
	for(int i=1;i<=an;++i) if(!ff[i]) ++e;
	sort(a,a+n+1); sort(b,b+n+1);
	for(int i=1;i<=n;++i)
		if(a[i]!=b[i]) {puts("-1"); return 0;}
	printf("%d\n",e);
}

Submission Info

Submission Time
Task D - XOR Replace
User fjzzq2002
Language C++14 (GCC 5.4.1)
Score 1000
Code Size 1715 Byte
Status AC
Exec Time 95 ms
Memory 11008 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:45:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n); int e=-1;
                ^
./Main.cpp:47:29: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",a+i),a[0]^=a[i];
                             ^
./Main.cpp:49:29: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",b+i),b[0]^=b[i];
                             ^

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 23 ms 4352 KB
1_08.txt AC 59 ms 11008 KB
1_09.txt AC 54 ms 9472 KB
1_10.txt AC 25 ms 4352 KB
1_11.txt AC 25 ms 4352 KB
1_12.txt AC 25 ms 4352 KB
1_13.txt AC 26 ms 4352 KB
1_14.txt AC 31 ms 4352 KB
1_15.txt AC 31 ms 4352 KB
1_16.txt AC 32 ms 4352 KB
1_17.txt AC 31 ms 4352 KB
1_18.txt AC 35 ms 4352 KB
1_19.txt AC 35 ms 4352 KB
1_20.txt AC 35 ms 4352 KB
1_21.txt AC 35 ms 4352 KB
1_22.txt AC 39 ms 4352 KB
1_23.txt AC 39 ms 4352 KB
1_24.txt AC 39 ms 4352 KB
1_25.txt AC 39 ms 4352 KB
1_26.txt AC 42 ms 4352 KB
1_27.txt AC 43 ms 4352 KB
1_28.txt AC 43 ms 4352 KB
1_29.txt AC 43 ms 4352 KB
1_30.txt AC 48 ms 4480 KB
1_31.txt AC 48 ms 4480 KB
1_32.txt AC 49 ms 4480 KB
1_33.txt AC 49 ms 4480 KB
1_34.txt AC 58 ms 4736 KB
1_35.txt AC 59 ms 4736 KB
1_36.txt AC 57 ms 4736 KB
1_37.txt AC 59 ms 4736 KB
1_38.txt AC 76 ms 5888 KB
1_39.txt AC 76 ms 5888 KB
1_40.txt AC 76 ms 5888 KB
1_41.txt AC 76 ms 5888 KB
1_42.txt AC 88 ms 7808 KB
1_43.txt AC 89 ms 7936 KB
1_44.txt AC 89 ms 7936 KB
1_45.txt AC 89 ms 7936 KB
1_46.txt AC 93 ms 8960 KB
1_47.txt AC 91 ms 8960 KB
1_48.txt AC 95 ms 8960 KB
1_49.txt AC 92 ms 8960 KB
1_50.txt AC 93 ms 9216 KB
1_51.txt AC 89 ms 9088 KB
1_52.txt AC 93 ms 9344 KB
1_53.txt AC 92 ms 9216 KB
1_54.txt AC 92 ms 9344 KB
1_55.txt AC 90 ms 9216 KB
1_56.txt AC 93 ms 9344 KB
1_57.txt AC 93 ms 9344 KB
1_58.txt AC 92 ms 9344 KB
1_59.txt AC 93 ms 9344 KB
1_60.txt AC 93 ms 9344 KB
1_61.txt AC 92 ms 9344 KB
1_62.txt AC 93 ms 9472 KB
1_63.txt AC 88 ms 9216 KB
1_64.txt AC 91 ms 9344 KB
1_65.txt AC 91 ms 9344 KB
1_66.txt AC 92 ms 9344 KB
1_67.txt AC 91 ms 9344 KB
1_68.txt AC 92 ms 9344 KB
1_69.txt AC 92 ms 9344 KB