#include<bits/stdc++.h>
#include "interactive.h"
using namespace std;
vector<int> guess(int n)
{
if(n <= 14){
vector <int> ans;
for(int i = 1; i <= n; i ++)
ans.push_back(ask(i));
return ans;
}
int a = ask(1);
map <int, int> s;
for(int i = 0; i < 7; i ++){
vector <int> x;
for(int j = 1; j < n; j ++)
if(j >> i & 1)
x.push_back(j+1);
vector <int> c = get_pairwise_xor(x);
x.push_back(1);
vector <int> c1 = get_pairwise_xor(x);
map <int, int> g;
for(int j : c)
g[j] --;
for(int j : c1)
g[j] ++;
for(auto it : g)
if(it.second > 0)
s[it.first^a] += (1<<i);
}
vector <int> ans(n);
ans[0] = a;
for(auto it : s)
ans[it.second] = it.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 |
0 ms |
200 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 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 |
5 ms |
376 KB |
Output is correct |
6 |
Correct |
4 ms |
328 KB |
Output is correct |
7 |
Correct |
2 ms |
328 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 |
3 ms |
356 KB |
Output is correct |
12 |
Correct |
5 ms |
328 KB |
Output is correct |
13 |
Correct |
5 ms |
380 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 |
328 KB |
Output is correct |
17 |
Correct |
4 ms |
328 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 |
- |