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>
#include "interactive.h"
using namespace std;
vector<int> intervalXor(int id, vector<int> v, int valId)
{
// cerr << "v: "; for (auto x : v) cerr << x << " "; cerr << '\n';
if (v.empty()) return v;
v.push_back(id);
vector<int> r1 = get_pairwise_xor(v);
v.pop_back();
vector<int> r2 = get_pairwise_xor(v);
vector<int> resp;
int id2 = 0;
for (int i = 0; i < r1.size(); i++)
{
if (r2[id2] == r1[i]) {id2++; continue;}
resp.push_back(r1[i]);
}
if (resp[0] == 0) resp.erase(resp.begin());
vector<int> realResp(1, resp[0]);
for (int i = 1; i < resp.size(); i++) if (resp[i] != resp[i-1]) realResp.push_back(resp[i]);
resp = realResp;
for (auto &x : resp) x ^= valId;
sort(resp.begin(), resp.end());
// cerr << "resp: "; for (auto x : resp) cerr << x << " "; cerr << '\n';
return resp;
}
vector<int> guess(int n)
{
// cerr << "BONGA" << '\n';
vector<int> ans(n);
ans[0] = ask(1);
vector<int> ids(n-1); iota(ids.begin(), ids.end(), 2);
// vector<int> nums = intervalXor(1, ids, ans[0]);
vector<int> pos(n-1);
set<int> nVals; vector<vector<int>> aux(7);
for (int k = 6; k >= 0; k--)
{
ids.clear();
for (int i = 2; i <= n; i++)
if (i & (1 << k))
ids.push_back(i);
aux[k] = intervalXor(1, ids, ans[0]);
for (auto x : aux[k]) nVals.insert(x);
}
vector<int> nums(nVals.begin(), nVals.end());
for (int k = 6; k >= 0; k--)
{
int idAux = 0;
for (int i = 0; i < nums.size() && idAux < aux[k].size(); i++)
{
if (aux[k][idAux] == nums[i]) pos[i] |= (1 << k), idAux++;
}
}
// cerr << "pos: "; for (auto x : pos) cerr << x << " "; cerr << '\n';
for (int i = 0; i < pos.size(); i++) ans[pos[i]-1] = nums[i];
// cerr << "n: " << n << ", ans: "; for (auto x : ans) cerr << x << " "; cerr << '\n';
return ans;
}
Compilation message (stderr)
Xoractive.cpp: In function 'std::vector<int> intervalXor(int, std::vector<int>, int)':
Xoractive.cpp:15:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
15 | for (int i = 0; i < r1.size(); i++)
| ~~^~~~~~~~~~~
Xoractive.cpp:22:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
22 | for (int i = 1; i < resp.size(); i++) if (resp[i] != resp[i-1]) realResp.push_back(resp[i]);
| ~~^~~~~~~~~~~~~
Xoractive.cpp: In function 'std::vector<int> guess(int)':
Xoractive.cpp:52:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
52 | for (int i = 0; i < nums.size() && idAux < aux[k].size(); i++)
| ~~^~~~~~~~~~~~~
Xoractive.cpp:52:44: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
52 | for (int i = 0; i < nums.size() && idAux < aux[k].size(); i++)
| ~~~~~~^~~~~~~~~~~~~~~
Xoractive.cpp:58:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
58 | for (int i = 0; i < pos.size(); i++) ans[pos[i]-1] = nums[i];
| ~~^~~~~~~~~~~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |