#include<bits/stdc++.h>
#include "interactive.h"
using namespace std;
vector<int> guess(int n){
if(n <= 14){
vector<int> h;
for(int i =1; i<= n; ++i){
h.emplace_back(ask(i));
}return h;
}
map<int , int> T;
int a = ask(1);
for(int i = 0; i< 7; ++i){
vector<int> x;
for(int k = 1; k < n; ++k){
if(k>>i&1)x.emplace_back(k + 1);
}
vector<int> X = get_pairwise_xor(x);
x.push_back(1);
vector<int> Y = get_pairwise_xor(x);
map<int , int> A;
for(int x : X) A[x]--;
for(int x : Y) A[x]++;
for(auto x : A) if(x.second>0) T[x.first^a] += (1 << i);
}
vector<int> ans;
ans.resize(n);
ans[0]=a;
for(auto x : T)ans[x.second]=x.first;
return ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
200 KB |
Output is correct |
2 |
Correct |
0 ms |
200 KB |
Output is correct |
3 |
Correct |
0 ms |
200 KB |
Output is correct |
4 |
Correct |
1 ms |
200 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
328 KB |
Output is correct |
2 |
Correct |
4 ms |
328 KB |
Output is correct |
3 |
Correct |
2 ms |
328 KB |
Output is correct |
4 |
Correct |
4 ms |
328 KB |
Output is correct |
5 |
Correct |
4 ms |
328 KB |
Output is correct |
6 |
Correct |
4 ms |
328 KB |
Output is correct |
7 |
Correct |
3 ms |
332 KB |
Output is correct |
8 |
Correct |
4 ms |
328 KB |
Output is correct |
9 |
Correct |
4 ms |
328 KB |
Output is correct |
10 |
Correct |
4 ms |
328 KB |
Output is correct |
11 |
Correct |
2 ms |
328 KB |
Output is correct |
12 |
Correct |
4 ms |
328 KB |
Output is correct |
13 |
Correct |
4 ms |
328 KB |
Output is correct |
14 |
Correct |
4 ms |
328 KB |
Output is correct |
15 |
Correct |
3 ms |
328 KB |
Output is correct |
16 |
Correct |
4 ms |
384 KB |
Output is correct |
17 |
Correct |
4 ms |
380 KB |
Output is correct |
18 |
Correct |
4 ms |
328 KB |
Output is correct |
19 |
Runtime error |
3 ms |
456 KB |
Execution killed with signal 11 |
20 |
Halted |
0 ms |
0 KB |
- |