#include "transfer.h"
#include <bits/stdc++.h>
using namespace std;
std::vector<int> get_attachment(std::vector<int> source) {
int n = source.size();
int xr = 0;
for (int i = 0; i < n; i++) {
xr ^= source[i] * (i + 1);
}
int k = n == 63 ? 6 : 8;
vector<int> attachment(k + 1);
for (int i = 0; i < k; i++) {
attachment[i] = xr >> i & 1;
}
attachment[k] = __builtin_popcount(xr) & 1;
return attachment;
}
std::vector<int> retrieve(std::vector<int> data) {
int n = data.size();
int k = n == 63 + 7 ? 6 : 8;
n -= k + 1;
int parity = 0;
for (int i = n; i < n + k + 1; i++) {
parity = (parity + data[i]) & 1;
}
if (!(parity & 1)) {
int xr = 0;
for (int i = n; i < n + k; i++) {
xr += data[i] << (i - n);
}
for (int i = 0; i < n; i++) {
xr ^= data[i] * (i + 1);
}
if (xr > 0) {
data[xr - 1] ^= 1;
}
}
return vector<int>(data.begin(), data.end() - k - 1);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
780 KB |
Output is correct |
2 |
Correct |
1 ms |
796 KB |
Output is correct |
3 |
Correct |
1 ms |
784 KB |
Output is correct |
4 |
Correct |
1 ms |
792 KB |
Output is correct |
5 |
Correct |
1 ms |
792 KB |
Output is correct |
6 |
Correct |
1 ms |
796 KB |
Output is correct |
7 |
Correct |
1 ms |
780 KB |
Output is correct |
8 |
Correct |
1 ms |
796 KB |
Output is correct |
9 |
Correct |
1 ms |
792 KB |
Output is correct |
10 |
Correct |
1 ms |
792 KB |
Output is correct |
11 |
Correct |
1 ms |
776 KB |
Output is correct |
12 |
Correct |
1 ms |
792 KB |
Output is correct |
13 |
Correct |
1 ms |
780 KB |
Output is correct |
14 |
Correct |
1 ms |
792 KB |
Output is correct |
15 |
Correct |
2 ms |
1292 KB |
Output is correct |
16 |
Correct |
1 ms |
780 KB |
Output is correct |
17 |
Correct |
1 ms |
788 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
30 ms |
2508 KB |
Output is correct |
2 |
Correct |
28 ms |
2512 KB |
Output is correct |
3 |
Correct |
29 ms |
2500 KB |
Output is correct |
4 |
Correct |
27 ms |
2504 KB |
Output is correct |
5 |
Correct |
27 ms |
2508 KB |
Output is correct |
6 |
Correct |
28 ms |
2704 KB |
Output is correct |
7 |
Correct |
27 ms |
2508 KB |
Output is correct |
8 |
Correct |
27 ms |
2500 KB |
Output is correct |
9 |
Correct |
28 ms |
2504 KB |
Output is correct |
10 |
Correct |
28 ms |
2512 KB |
Output is correct |
11 |
Correct |
28 ms |
2508 KB |
Output is correct |
12 |
Correct |
28 ms |
2508 KB |
Output is correct |
13 |
Correct |
28 ms |
2504 KB |
Output is correct |
14 |
Correct |
29 ms |
2500 KB |
Output is correct |
15 |
Correct |
27 ms |
2508 KB |
Output is correct |
16 |
Correct |
30 ms |
2508 KB |
Output is correct |
17 |
Correct |
28 ms |
2500 KB |
Output is correct |
18 |
Correct |
27 ms |
2512 KB |
Output is correct |
19 |
Correct |
27 ms |
2508 KB |
Output is correct |