# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
434607 | egekabas | Data Transfer (IOI19_transfer) | C++14 | 9 ms | 2460 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 <bits/stdc++.h>
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
std::vector<int> get_attachment(std::vector<int> source) {
int n = source.size(), k;
if(n == 63)
k = 7;
else
k = 9;
vector<int> ret(k);
for(int i = 0; i < n; ++i){
for(int j = 0; j < (k-1); ++j)
if((1<<j)&(i+1))
ret[j] ^= source[i];
ret[k-1] ^= source[i];
}
int val = 0;
for(auto u : ret)
val ^= u;
ret.pb(val);
return ret;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |