# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
333331 | emaborevkovic | Xoractive (IZhO19_xoractive) | C++17 | 0 ms | 0 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>
using namespace std;
typedef long long ll;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
const int N = 105;
vector <int> v[N];
vector <int> c[N];
vector <pair <int, int> > s;
int ima[N];
map <int, int> m;
vector <int> guess(int n) {
memset(ima, 0, sizeof ima);
vector <int> res(n, 0);
for (int i=0;i<n;i++) {
v[i].clear();
c[i].clear();
}
for (int i=1;i<n;i++) {
int sada = i;
for (int j=7;j>=0;j--) {
if (sada >= 1<<j) {
sada -= 1<<j;
v[j].pb(i+1);
ima[i]++;
}
}
s.pb(mp(ima[i], i));
}
int prvi = ask(1);
for (int i=0;i<8;i++) {
if (v[i].size() == 0) continue;
vector <int> a, b;
a = get_pairwise_xor(v[i]);
v[i].pb(1);
b = get_pairwise_xor(v[i]);
int pos = 0;
for (int j=0;j<a.size();j++) {
while (a[j] != b[pos]) {
c[i].pb(b[pos]);
pos += 2;
}
pos += 2;
}
for (int j=0;j<c[i].size();j++) {
c[i][j] ^= prvi;
}
}
sort(s.begin(), s.end());
reverse(s.begin(), s.end());
for (auto x : s) {
int sada = x.ss;
int curr = 0;
for (int i=7;i>=0;i--) {
if (sada >= 1<<i) {
sada -= 1<<i;
for (int j=1;j<c[i].size();j++) {
if (c[i][j] == -1) continue;
m[c[i][j]]++;
if (m[c[i][j]] == ima[x.ss]) curr = c[i][j];
}
}
}
sada = x.ss;
for (int i=7;i>=0;i--) {
if (sada >= 1<<i) {
sada -= 1<<i;
for (int j=1;j<c[i].size();j++) {
m[c[i][j]] = 0;
if (c[i][j] == curr) c[i][j] = -1;
}
}
}
res[x.ss] = curr;
}
res[0] = prvi;
return res;
}
/*
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
return 0;
}
*/