# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
770924 | rxlfd314 | Data Transfer (IOI19_transfer) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "transfer.h"
#include <bits/stdc++.h>
using namespace std;
void yeet(int n, vector<int> &v, vector<int> &source) {
for (int j = 0; (1 << j) <= n; j++) {
v.push_back(0);
for (int i = 1; i <= n; i++) {
if (i & 1 << j) {
v[j] ^= source[i-1];
}
}
}
}
vector<int> get_attachment(vector<int> source) {
int N = source.size();
vector<int> ret;
yeet(N, ret, source);
ret.push_back(0);
for (int i = 0; i < N; i++) {
ret.back() ^= source[i];
}
return ret;
}
vector<int> retrieve(vector<int> data) {
int N = data.size() < 255 ? 63 : 255;
vector<int> test;
yeet(N, test, data);
if (test == vector<int>(data.begin()+N, data.begin()+M-1)) {
return vector<int>(data.begin(), data.begin()+N);
}
bool p = 0;
for (int i = 0; i < N; i++) {
p ^= data[i];
}
if (p ^ data[M-1]) {
for (int i = 0; i < N; i++) {
test.clear();
data[i] ^= 1;
yeet(N, test, data);
if (test == vector<int>(data.begin()+N, data.begin()+M-1)) {
return vector<int>(data.begin(), data.begin()+N);
}
data[i] ^= 1;
}
}
return vector<int>(data.begin(), data.begin()+N);
}