Submission #1569348
Source Code Expand
#include <functional> #include <algorithm> #include <iostream> #include <memory.h> #include <sstream> #include <fstream> #include <iomanip> #include <assert.h> #include <bitset> #include <string> #include <cstdio> #include <math.h> #include <complex> #include <vector> #include <queue> #include <stack> #include <cmath> #include <ctime> #include <set> #include <bitset> #include <map> using namespace std; #define int64 long long #define mp make_pair #define ull unsigned long long #ifdef _DEBUG const int N = 101; #else const int N = 500000; #endif const int M = 70; const int MOD = 1e9+7; int n, a[N], b[N]; pair <int, int> p[N]; map <int, vector<int> > q; int main() { #ifdef _DEBUG freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); #endif scanf("%d", &n); for (int i = 1; i <= n; i++) scanf("%d", &a[i]); for (int i = 1; i <= n; i++) scanf("%d", &b[i]); for (int i = 1; i <= n; i++) if (a[i] != b[i]) { q[b[i]].push_back(i); } int x = 0; for (int i = 1; i <= n; i++) x ^= a[i]; int need = 0; for (int i = 1; i <= n; i++) if (a[i] != b[i]) { need++; } int ans = 0; int p = 0; int it = 3 * n; while (it-- && need) { if (q.find(x) != q.end()) { ans++; int j = q[x].back(); q[x].pop_back(); if (q[x].empty()) q.erase(x); x = a[j]; a[j] = b[j]; need--; } else { ans++; if (q.empty()) break; int s = (*q.begin()).first; int j = q[s].back(); int tmp = a[j]; a[j] = x; x = tmp; } } for (int i = 1; i <= n; i++) if (a[i] != b[i]) ans = -1; cout << ans; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - XOR Replace |
User | AleksBalobanov |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1676 Byte |
Status | WA |
Exec Time | 134 ms |
Memory | 15360 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:48:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &n); ^ ./Main.cpp:49:49: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] for (int i = 1; i <= n; i++) scanf("%d", &a[i]); ^ ./Main.cpp:50:49: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] for (int i = 1; i <= n; i++) scanf("%d", &b[i]); ^
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | 2 ms | 4352 KB |
0_01.txt | AC | 2 ms | 4352 KB |
0_02.txt | AC | 1 ms | 4352 KB |
0_03.txt | AC | 1 ms | 4352 KB |
1_00.txt | AC | 1 ms | 4352 KB |
1_01.txt | AC | 1 ms | 4352 KB |
1_02.txt | AC | 2 ms | 4352 KB |
1_03.txt | AC | 1 ms | 4352 KB |
1_04.txt | AC | 2 ms | 4352 KB |
1_05.txt | AC | 1 ms | 4352 KB |
1_06.txt | AC | 1 ms | 4352 KB |
1_07.txt | AC | 21 ms | 4480 KB |
1_08.txt | AC | 71 ms | 15360 KB |
1_09.txt | AC | 76 ms | 15360 KB |
1_10.txt | AC | 23 ms | 4736 KB |
1_11.txt | AC | 25 ms | 4864 KB |
1_12.txt | AC | 23 ms | 4736 KB |
1_13.txt | AC | 23 ms | 4736 KB |
1_14.txt | WA | 29 ms | 4992 KB |
1_15.txt | AC | 31 ms | 4992 KB |
1_16.txt | WA | 29 ms | 4992 KB |
1_17.txt | AC | 31 ms | 4992 KB |
1_18.txt | WA | 32 ms | 4992 KB |
1_19.txt | AC | 34 ms | 4992 KB |
1_20.txt | WA | 31 ms | 4992 KB |
1_21.txt | AC | 35 ms | 4992 KB |
1_22.txt | WA | 37 ms | 4992 KB |
1_23.txt | AC | 41 ms | 4992 KB |
1_24.txt | WA | 38 ms | 4992 KB |
1_25.txt | AC | 41 ms | 4992 KB |
1_26.txt | WA | 49 ms | 5120 KB |
1_27.txt | AC | 53 ms | 5120 KB |
1_28.txt | WA | 50 ms | 5120 KB |
1_29.txt | AC | 54 ms | 5120 KB |
1_30.txt | WA | 61 ms | 5248 KB |
1_31.txt | AC | 65 ms | 5248 KB |
1_32.txt | WA | 62 ms | 5248 KB |
1_33.txt | AC | 66 ms | 5248 KB |
1_34.txt | WA | 76 ms | 6016 KB |
1_35.txt | AC | 79 ms | 6016 KB |
1_36.txt | WA | 75 ms | 6016 KB |
1_37.txt | AC | 82 ms | 6016 KB |
1_38.txt | WA | 99 ms | 8064 KB |
1_39.txt | AC | 103 ms | 8064 KB |
1_40.txt | WA | 98 ms | 8064 KB |
1_41.txt | AC | 100 ms | 8064 KB |
1_42.txt | WA | 117 ms | 12032 KB |
1_43.txt | AC | 125 ms | 12160 KB |
1_44.txt | WA | 119 ms | 12160 KB |
1_45.txt | AC | 108 ms | 12032 KB |
1_46.txt | WA | 127 ms | 14336 KB |
1_47.txt | AC | 113 ms | 14336 KB |
1_48.txt | WA | 127 ms | 14464 KB |
1_49.txt | AC | 104 ms | 14336 KB |
1_50.txt | WA | 129 ms | 15104 KB |
1_51.txt | AC | 128 ms | 14720 KB |
1_52.txt | WA | 129 ms | 15104 KB |
1_53.txt | AC | 113 ms | 15104 KB |
1_54.txt | WA | 134 ms | 15232 KB |
1_55.txt | AC | 114 ms | 14976 KB |
1_56.txt | WA | 130 ms | 15360 KB |
1_57.txt | AC | 84 ms | 15232 KB |
1_58.txt | WA | 130 ms | 15360 KB |
1_59.txt | AC | 118 ms | 15360 KB |
1_60.txt | WA | 129 ms | 15360 KB |
1_61.txt | AC | 88 ms | 15360 KB |
1_62.txt | WA | 131 ms | 15360 KB |
1_63.txt | AC | 114 ms | 14848 KB |
1_64.txt | WA | 128 ms | 15232 KB |
1_65.txt | AC | 86 ms | 15232 KB |
1_66.txt | WA | 129 ms | 15232 KB |
1_67.txt | AC | 124 ms | 15232 KB |
1_68.txt | WA | 130 ms | 15360 KB |
1_69.txt | AC | 104 ms | 15360 KB |