#ifndef hwe
#include "transfer.h"
#endif
#include <bits/stdc++.h>
using namespace std;
#define popcount(n) (__builtin_popcountll((n)))
#define clz(n) (__builtin_clzll((n)))
#define ctz(n) (__builtin_ctzll((n)))
#define lg(n) (63 - __builtin_clzll((n)))
#define BIT(n, i) (((n) >> (i)) & 1ll)
#define MASK(i) (1ll << (i))
#define FLIP(n, i) ((n) ^ (1ll << (i)))
#define ON(n, i) ((n) | MASK(i))
#define OFF(n, i) ((n) & ~MASK(i))
template <class T>
void remove_duplicate(vector<T> &ve) {
sort (ve.begin(), ve.end());
ve.resize(unique(ve.begin(), ve.end()) - ve.begin());
}
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
template <class T> T random(T l, T r) {
return uniform_int_distribution<T>(l, r)(rng);
}
template <class T> T random(T r) {
return rng() % r;
}
vector<int> get_attachment(vector<int> _source) {
vector<int> source = _source;
assert(source.size() == 63);
int Xor = 0, lim = 6;
for (auto &x : source) Xor ^= x;
source.emplace_back(Xor);
// for (int i = 0; i < 64 - 1; ++i) source.emplace_back(source[i]);
for (int bit = 0; bit < lim; ++bit) {
int cur_xor = 0;
for (int i = 0; i < 64; ++i) if (BIT(i, bit)) cur_xor ^= source[i];
source.emplace_back(cur_xor);
}
return source;
}
vector<int> retrieve(vector<int> _data) {
vector<int> data = _data;
int Xor = 0, lim = 6;
for (int i = 0; i < 64; ++i) Xor ^= data[i];
if (Xor != 0) {
// return vector<int>(data.begin() + 64, data.end());
int wrong_spot = 0;
for (int bit = 0; bit < lim; ++bit) {
int cur_xor = 0;
for (int i = 0; i < 64; ++i) if (BIT(i, bit)) cur_xor ^= data[i];
if (cur_xor != data[bit + 64]) wrong_spot = ON(wrong_spot, bit);
}
data[wrong_spot] = !data[wrong_spot];
}
vector<int> ans;
for (int i = 0; i < 63; ++i) ans.emplace_back(data[i]);
return ans;
}
#ifdef hwe
signed main() {
for (int _ = 0; _ < 1; ++_) {
// int n; cin >> n;
int LOG = random(3, 7), n = MASK(LOG) - 1;
vector<int> source(n);
for (auto &x : source) x = random(2);
vector<int> data = get_attachment(source);
int corruption = random(data.size());
data[corruption] = !data[corruption];
vector<int> retrival = retrieve(data);
// for (auto &x : data) cerr << x << ' ';
// cerr << '\n';
if (retrival == source) cerr << "Accepted\n";
else {
cerr << "Wrong answer\n";
return 0;
}
}
cerr << '\n'; return 0;
}
#endif
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
4 ms |
1060 KB |
WA in grader: wrong source retrieval |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
1 ms |
1116 KB |
Execution killed with signal 6 |
| 2 |
Halted |
0 ms |
0 KB |
- |
