#include "transfer.h"
#include <bits/stdc++.h>
using namespace std;
#define OPTM ios_base::sync_with_stdio(0); cin.tie(0);
#define INF int(1e9+7)
#define ln '\n'
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define us unsigned short
#define FOR(i,s,n) for (int i = s; i < n; i++)
#define FORR(i,n,s) for (int i = n; i > s; i--)
#define FORX(u, arr) for (auto u : arr)
#define PB push_back
#define in(v,x) (v.find(x) != v.end())
#define F first
#define S second
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define UM unordered_map
#define US unordered_set
#define PQ priority_queue
#define ALL(v) v.begin(), v.end()
const ll LLINF = 1e18+1;
std::vector<int> get_attachment(std::vector<int> s) {
int n = s.size();
int p = 0, k = 0;
FOR(i,0,n) {
if (s[i] == 1) {
p ^= 1;
k ^= i+1;
}
}
vector<int> res;
int i = 0;
while ((1<<i) <= k) {
if (k&(1<<i)) res.PB(1);
else res.PB(0);
i++;
}
res.PB(p);
return res;
}
std::vector<int> retrieve(std::vector<int> d) {
int n = 0, dn = d.size(), p = 0;
int x = 0, y = 0;
if (dn < 255) n = 63;
else n = 255;
FOR(i,n,dn-1) {
x += d[i]*(1<<(i-n));
p ^= d[i];
}
if (p == d[dn-1]) {
FOR(i,0,n) if (d[i] == 1) y ^= i+1;
x ^= y;
d[x-1] ^= 1;
}
return std::vector<int>(d.begin(),d.begin()+n);
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
3 ms |
644 KB |
WA in grader: wrong source retrieval |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
5 ms |
2492 KB |
WA in grader: wrong source retrieval |
| 2 |
Halted |
0 ms |
0 KB |
- |
