# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
308004 | 2020-09-29T17:59:32 Z | kimjg1119 | Data Transfer (IOI19_transfer) | C++17 | 318 ms | 2788 KB |
#include "transfer.h" #include <bits/stdc++.h> using namespace std; vector<int> get_attachment_sub1(vector<int> sc) { int a[10] = {}; for (int i = 0; i < sc.size(); i++) { for (int j = 0; j < 6; j++) if(sc[i]) a[j] ^= (i + 1) & (1 << j); } vector<int> r; for (int i = 0; i < 6; i++) if (a[i]) r.push_back(1); else r.push_back(0); vector<int> at; for (int i = 0; i < 1; i++) { for (int j = 0; j < 6; j++) at.push_back(r[j]); } int s = 0; for (int i = 0; i < 6; i++) s += r[i]; at.push_back(s % 2); return at; } vector<int> get_attachment_sub2(vector<int> sc) { int a[10] = {}; for (int i = 0; i < sc.size(); i++) { for (int j = 0; j < 8; j++) if (sc[i]) a[j] ^= (i + 1) & (1 << j); } vector<int> r; for (int i = 0; i < 8; i++) if (a[i]) r.push_back(1); else r.push_back(0); vector<int> at; for (int i = 0; i < 2; i++) { for (int j = 0; j < 8; j++) at.push_back(r[j]); } return at; } std::vector<int> get_attachment(std::vector<int> source) { if (source.size() == 63) return get_attachment_sub1(source); else return get_attachment_sub2(source); } vector<int> retrieve_sub1(vector<int> d) { vector<int> t1; for (int i = 0; i < 7; i++) t1.push_back(d[i+63]); for (int i = 0; i < 7; i++) d.pop_back(); int p = t1.back(); t1.pop_back(); bool flag = true; int ts = 0; for (int i = 0; i < 6; i++) ts += t1[i]; if (ts % 2 != p) flag = false; if (flag) { int a[10] = {}; for (int i = 0; i < d.size(); i++) { for (int j = 0; j < 6; j++) if (d[i]) a[j] ^= (i+1) & (1 << j); } int r = 0; for (int i = 0; i < 6; i++) a[i] ^= t1[i] * (1<<i); for (int i = 0; i < 6; i++) if (a[i]) r |= (1 << i); if (r > 0) d[r - 1] = 1 - d[r - 1]; return d; } else return d; } vector<int> retrieve_sub2(vector<int> d) { vector<int> t, t1, t2; for (int i = 255; i < d.size(); i++) t.push_back(d[i]); for (int i = 0; i < 16; i++) d.pop_back(); for (int i = 0; i < 8; i++) t1.push_back(t[i]); for (int i = 0; i < 8; i++) t2.push_back(t[i + 8]); bool flag = true; for (int i = 0; i < 8; i++) if (t1[i] != t2[i]) flag = false; if (flag) { int a[10] = {}; for (int i = 0; i < d.size(); i++) { for (int j = 0; j < 8; j++) if (d[i]) a[j] ^= (i + 1) & (1 << j); } int r = 0; for (int i = 0; i < 8; i++) a[i] ^= t1[i] * (1 << i); for (int i = 0; i < 8; i++) if (a[i]) r |= (1 << i); if (r > 0) d[r - 1] = 1 - d[r - 1]; return d; } else return d; } std::vector<int> retrieve(std::vector<int> data) { if (data.size() < 255) return retrieve_sub1(data); else return retrieve_sub2(data); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 9 ms | 1144 KB | Output is correct |
2 | Correct | 6 ms | 1152 KB | Output is correct |
3 | Correct | 7 ms | 908 KB | Output is correct |
4 | Correct | 8 ms | 1148 KB | Output is correct |
5 | Correct | 7 ms | 1036 KB | Output is correct |
6 | Correct | 7 ms | 1152 KB | Output is correct |
7 | Correct | 8 ms | 1036 KB | Output is correct |
8 | Correct | 6 ms | 908 KB | Output is correct |
9 | Correct | 6 ms | 828 KB | Output is correct |
10 | Correct | 8 ms | 908 KB | Output is correct |
11 | Correct | 6 ms | 1276 KB | Output is correct |
12 | Correct | 6 ms | 1152 KB | Output is correct |
13 | Correct | 7 ms | 908 KB | Output is correct |
14 | Correct | 6 ms | 1144 KB | Output is correct |
15 | Correct | 7 ms | 1148 KB | Output is correct |
16 | Correct | 6 ms | 908 KB | Output is correct |
17 | Correct | 6 ms | 908 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Partially correct | 266 ms | 2500 KB | Partially correct |
2 | Partially correct | 260 ms | 2500 KB | Partially correct |
3 | Partially correct | 259 ms | 2656 KB | Partially correct |
4 | Partially correct | 270 ms | 2660 KB | Partially correct |
5 | Partially correct | 297 ms | 2672 KB | Partially correct |
6 | Partially correct | 318 ms | 2628 KB | Partially correct |
7 | Partially correct | 287 ms | 2660 KB | Partially correct |
8 | Partially correct | 251 ms | 2668 KB | Partially correct |
9 | Partially correct | 231 ms | 2668 KB | Partially correct |
10 | Partially correct | 230 ms | 2500 KB | Partially correct |
11 | Partially correct | 229 ms | 2788 KB | Partially correct |
12 | Partially correct | 246 ms | 2788 KB | Partially correct |
13 | Partially correct | 249 ms | 2672 KB | Partially correct |
14 | Partially correct | 269 ms | 2664 KB | Partially correct |
15 | Partially correct | 258 ms | 2500 KB | Partially correct |
16 | Partially correct | 252 ms | 2672 KB | Partially correct |
17 | Partially correct | 249 ms | 2500 KB | Partially correct |
18 | Partially correct | 245 ms | 2672 KB | Partially correct |
19 | Partially correct | 250 ms | 2628 KB | Partially correct |