| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1316545 | aaaaaaaa | Data Transfer (IOI19_transfer) | C++20 | 79 ms | 1712 KiB |
#include "transfer.h"
#include <bits/stdc++.h>
using namespace std;
int K = 9;
std::vector<int> get_attachment(std::vector<int> source) {
if((int) source.size() == 63) K = 7;
vector<int> ans(K, 0);
int x = 0, cnt2 = 0;
for(int i = 0; i < (int) source.size(); ++i){
x ^= source[i] * (i + 1);
if(source[i]) cnt2 += 1;
}
int cnt = 0;
for(int i = K - 2; i >= 0; --i){
if(x & (1 << i)){
ans[i] = 1;
cnt += 1;
}
}
ans[K - 1] = (cnt % 2);
return ans;
}
std::vector<int> retrieve(std::vector<int> data) {
int n = data.size(), cnt = 0, x = 0;
for(int j = n - 2, ptr = K - 2; ptr >= 0; --j, --ptr){
if(data[j]) {
cnt += 1;
x |= (1 << ptr);
}
}
vector<int> ans;
for(int j = 0; j < n - K; ++j){
ans.push_back(data[j]);
}
if((cnt & 1) == data.back()){
int nx = 0, setbit = 0;
for(int j = 0; j < n - K; ++j){
if(data[j]) nx ^= data[j] * (j + 1), setbit += 1;
}
if(nx == x) return ans;
for(int j = 0; j < n - K; ++j){
if((nx ^ (j + 1)) == x){
ans[j] ^= 1;
break;
}
}
}
return ans;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
