| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1331809 | khanhphucscratch | Data Transfer (IOI19_transfer) | C++20 | 6 ms | 1724 KiB |
#include "transfer.h"
#include<bits/stdc++.h>
using namespace std;
inline bool getbit(int num, int bit)
{
return (num >> bit)&1;
}
vector<int> get_attachment(vector<int> source) {
int n = source.size(), d = __lg(n);
vector<int> add(d+1);
for(int i = 0; i < n; i++){
for(int j = 0; j <= d; j++) if(getbit(i, j) == 1) add[j] ^= source[i];
}
int sum = 0;
for(int i : add) sum ^= i;
add.push_back(sum);
return add;
}
vector<int> retrieve(vector<int> data) {
int n = 1;
while(n <= data.size()) n <<= 1;
n >>= 1; n--; int d = __lg(n);
int sum = 0;
for(int i = n; i < data.size(); i++) sum ^= data[i];
if(sum == 1){
vector<int> ans;
for(int i = 0; i < n; i++) ans.push_back(data[i]);
return ans;
}
data.pop_back();
int place = 0;
for(int j = 0; j <= d; j++){
int sum = data[n+j];
for(int i = 0; i < n; i++) if(getbit(i, j) == 1) sum ^= data[i];
if(sum == 1) place += (1 << j);
}
vector<int> ans;
for(int i = 0; i < n; i++) ans.push_back(data[i]);
if(place < n) ans[place] ^= 1;
return ans;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
