Submission #1775230
Source Code Expand
#include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace std; using namespace __gnu_pbds; #define fi first #define se second #define mp make_pair #define pb push_back #define fbo find_by_order #define ook order_of_key typedef long long ll; typedef pair<ll,ll> ii; typedef vector<ll> vi; typedef long double ld; typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> pbds; typedef set<ll>::iterator sit; typedef map<ll,ll>::iterator mit; ll a[100011]; ll b[100011]; struct DSU { int S; struct node { int p; ll sum; }; vector<node> dsu; DSU(int n) { S = n; for(int i = 0; i < n; i++) { node tmp; tmp.p = i; tmp.sum = 0; dsu.pb(tmp); } } void reset(int n) { dsu.clear(); S = n; for(int i = 0; i < n; i++) { node tmp; tmp.p = i; tmp.sum = 0; dsu.pb(tmp); } } int rt(int u) { if(dsu[u].p == u) return u; dsu[u].p = rt(dsu[u].p); return dsu[u].p; } void merge(int u, int v) { u = rt(u); v = rt(v); if(u == v) return ; if(rand()&1) swap(u, v); dsu[v].p = u; dsu[u].sum += dsu[v].sum; } bool sameset(int u, int v) { if(rt(u) == rt(v)) return true; return false; } ll getstat(int u) { return dsu[rt(u)].sum; } }; bool used[100001]; bool req[100001]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; cin>>n; vector<ll> v1,v2; for(int i=0;i<n;i++) { cin>>a[i]; a[n]^=a[i]; v1.pb(a[i]); } v1.pb(a[n]); for(int i=0;i<n;i++) { cin>>b[i]; b[n]^=b[i]; v2.pb(b[i]); } v2.pb(b[n]); sort(v1.begin(),v1.end()); sort(v2.begin(),v2.end()); for(int i=0;i<=n;i++) { if(v1[i]!=v2[i]) { cout<<-1<<'\n'; return 0; } } //swap a[n] with a[i] how many times to reach b? v1.erase(unique(v1.begin(),v1.end()),v1.end()); int ans=0; for(int i = 0; i <= n; i++) { a[i]=lower_bound(v1.begin(),v1.end(),a[i])-v1.begin(); b[i]=lower_bound(v1.begin(),v1.end(),b[i])-v1.begin(); if(i<n&&a[i]!=b[i]) ans++; if(a[i]!=b[i]) { req[a[i]]=req[b[i]]=1; } } DSU dsu(int(v1.size())); for(int i=0;i<=n;i++) { dsu.merge(a[i],b[i]); } for(int i=0;i<v1.size();i++) { if(dsu.rt(i)==i) { used[i]=1; } } int holy1 = dsu.rt(a[n]); int holy2 = dsu.rt(b[n]); for(int i=0;i<v1.size();i++) { if(i!=holy1&&i!=holy2&&req[i]&&used[i]) ans++; } cout<<ans<<'\n'; }
Submission Info
Submission Time | |
---|---|
Task | D - XOR Replace |
User | vjudge2 |
Language | C++14 (GCC 5.4.1) |
Score | 1000 |
Code Size | 2399 Byte |
Status | AC |
Exec Time | 67 ms |
Memory | 6256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 1000 / 1000 | ||||
Status |
|
|
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 | 1 ms | 256 KB |
0_01.txt | AC | 1 ms | 256 KB |
0_02.txt | AC | 1 ms | 256 KB |
0_03.txt | AC | 1 ms | 256 KB |
1_00.txt | AC | 1 ms | 256 KB |
1_01.txt | AC | 1 ms | 256 KB |
1_02.txt | AC | 1 ms | 256 KB |
1_03.txt | AC | 1 ms | 256 KB |
1_04.txt | AC | 1 ms | 256 KB |
1_05.txt | AC | 1 ms | 256 KB |
1_06.txt | AC | 1 ms | 256 KB |
1_07.txt | AC | 45 ms | 5620 KB |
1_08.txt | AC | 48 ms | 6256 KB |
1_09.txt | AC | 41 ms | 5620 KB |
1_10.txt | AC | 25 ms | 3828 KB |
1_11.txt | AC | 23 ms | 3828 KB |
1_12.txt | AC | 25 ms | 3828 KB |
1_13.txt | AC | 25 ms | 3828 KB |
1_14.txt | AC | 31 ms | 3828 KB |
1_15.txt | AC | 27 ms | 3828 KB |
1_16.txt | AC | 31 ms | 3828 KB |
1_17.txt | AC | 26 ms | 3828 KB |
1_18.txt | AC | 35 ms | 3828 KB |
1_19.txt | AC | 28 ms | 3828 KB |
1_20.txt | AC | 34 ms | 3828 KB |
1_21.txt | AC | 29 ms | 3828 KB |
1_22.txt | AC | 38 ms | 3828 KB |
1_23.txt | AC | 30 ms | 3828 KB |
1_24.txt | AC | 38 ms | 3828 KB |
1_25.txt | AC | 30 ms | 3828 KB |
1_26.txt | AC | 41 ms | 3828 KB |
1_27.txt | AC | 31 ms | 3828 KB |
1_28.txt | AC | 42 ms | 3828 KB |
1_29.txt | AC | 32 ms | 3828 KB |
1_30.txt | AC | 45 ms | 3828 KB |
1_31.txt | AC | 32 ms | 3828 KB |
1_32.txt | AC | 46 ms | 3828 KB |
1_33.txt | AC | 33 ms | 3828 KB |
1_34.txt | AC | 51 ms | 3828 KB |
1_35.txt | AC | 35 ms | 3828 KB |
1_36.txt | AC | 51 ms | 3828 KB |
1_37.txt | AC | 34 ms | 3828 KB |
1_38.txt | AC | 59 ms | 4468 KB |
1_39.txt | AC | 35 ms | 3828 KB |
1_40.txt | AC | 59 ms | 4340 KB |
1_41.txt | AC | 35 ms | 3828 KB |
1_42.txt | AC | 65 ms | 5620 KB |
1_43.txt | AC | 36 ms | 3828 KB |
1_44.txt | AC | 66 ms | 5620 KB |
1_45.txt | AC | 35 ms | 3828 KB |
1_46.txt | AC | 67 ms | 5620 KB |
1_47.txt | AC | 35 ms | 3828 KB |
1_48.txt | AC | 67 ms | 5620 KB |
1_49.txt | AC | 35 ms | 3828 KB |
1_50.txt | AC | 66 ms | 5620 KB |
1_51.txt | AC | 36 ms | 3828 KB |
1_52.txt | AC | 67 ms | 5620 KB |
1_53.txt | AC | 36 ms | 3828 KB |
1_54.txt | AC | 66 ms | 5620 KB |
1_55.txt | AC | 34 ms | 3828 KB |
1_56.txt | AC | 67 ms | 5620 KB |
1_57.txt | AC | 35 ms | 3828 KB |
1_58.txt | AC | 66 ms | 5620 KB |
1_59.txt | AC | 35 ms | 3828 KB |
1_60.txt | AC | 66 ms | 5620 KB |
1_61.txt | AC | 35 ms | 3828 KB |
1_62.txt | AC | 67 ms | 5620 KB |
1_63.txt | AC | 34 ms | 3828 KB |
1_64.txt | AC | 66 ms | 5620 KB |
1_65.txt | AC | 35 ms | 3828 KB |
1_66.txt | AC | 67 ms | 5620 KB |
1_67.txt | AC | 35 ms | 3828 KB |
1_68.txt | AC | 66 ms | 5620 KB |
1_69.txt | AC | 35 ms | 3828 KB |