#include <bits/stdc++.h>
#include "interactive.h"
using namespace std;
#define X first
#define Y second
#define mp make_pair
#define pb push_back
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <int, pii> pip;
typedef pair <pii, int> ppi;
typedef pair <ll, ll> pll;
const int INF=0x3f3f3f3f;
const int OFF=128;
const int N=105;
int n, off=1;
int jed;
int sol[N];
set <int> pitaj(vector <int> v) {
set <int> ret;
// printf("pitam za: ");
// for (int x:v) printf("%d ", x);
// printf("\n");
if (v.empty()) return ret;
vector <int> izbaci=get_pairwise_xor(v);
v.pb(1);
vector <int> svi=get_pairwise_xor(v);
// printf("izbaci: ");
// for (int x:izbaci) printf("%d ", x);
// printf("\nsvi: ");
// for (int x:svi) printf("%d ", x);
// printf("\n");
svi.erase(svi.begin());
int i=0;
for (int x:izbaci) {
while (svi[i]<x) ret.insert(svi[i++]);
i++;
}
while (i<(int)svi.size()) ret.insert(svi[i++]);
// for (int x:ret) printf("%d ", x);
// printf("\n");
return ret;
}
void impera(vector <vector <int> > pos, vector <vector <int> > br) {
if (pos.empty()) return;
// printf("---------------------------\n");
vector <int> que;
vector <vector <int> > np, nbr;
int ind=-1;
for (vector <int> v:pos) {
ind++;
// printf("ind: %d, pos: ", ind);
// for (int x:v) printf("%d ", x);
// printf(", br: ");
// for (int x:br[ind]) printf("%d ", x);
// printf("\n");
if ((int)v.size()==1 && br[ind].size()) {
sol[v[0]]=br[ind][0];
continue;
}
vector <int> p_l, p_r;
int siz=v.size();
for (int i=0; i<(int)v.size()/2+siz%2; ++i) que.pb(v[i]), p_l.pb(v[i]);
for (int i=(int)v.size()/2+siz%2; i<(int)v.size(); ++i) p_r.pb(v[i]);
np.pb(p_l);
if (p_r.size()) np.pb(p_r);
}
set <int> S=pitaj(que);
for (vector <int> v:br) {
if (v.size()==1) continue;
vector <int> br_l, br_r;
if (v.empty()) {
for (int x:S) br_l.pb(x);
}
else {
for (int x:v) {
if (S.count(x)) br_l.pb(x), S.erase(x);
else br_r.pb(x);
}
}
nbr.pb(br_l); nbr.pb(br_r);
}
impera(np, nbr);
}
vector<int> guess(int nn) {
n=nn;
jed=ask(1);
vector <vector <int> > pos0, br0;
vector <int> pom;
pos0.pb(pom); br0.pb(pom);
for (int i=2; i<=n; ++i) pos0[0].pb(i);
impera(pos0, br0);
vector <int> res;
res.pb(jed);
for (int i=2; i<=n; ++i) res.pb(sol[i]^jed);
return res;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
512 KB |
Output is correct |
| 2 |
Correct |
1 ms |
364 KB |
Output is correct |
| 3 |
Correct |
1 ms |
364 KB |
Output is correct |
| 4 |
Correct |
1 ms |
364 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
4 ms |
384 KB |
Output is correct |
| 2 |
Correct |
3 ms |
364 KB |
Output is correct |
| 3 |
Correct |
3 ms |
364 KB |
Output is correct |
| 4 |
Correct |
3 ms |
364 KB |
Output is correct |
| 5 |
Correct |
3 ms |
364 KB |
Output is correct |
| 6 |
Correct |
3 ms |
364 KB |
Output is correct |
| 7 |
Correct |
3 ms |
364 KB |
Output is correct |
| 8 |
Correct |
3 ms |
364 KB |
Output is correct |
| 9 |
Correct |
4 ms |
364 KB |
Output is correct |
| 10 |
Correct |
3 ms |
364 KB |
Output is correct |
| 11 |
Correct |
3 ms |
364 KB |
Output is correct |
| 12 |
Correct |
3 ms |
364 KB |
Output is correct |
| 13 |
Correct |
3 ms |
364 KB |
Output is correct |
| 14 |
Correct |
3 ms |
364 KB |
Output is correct |
| 15 |
Correct |
3 ms |
384 KB |
Output is correct |
| 16 |
Correct |
4 ms |
364 KB |
Output is correct |
| 17 |
Correct |
3 ms |
364 KB |
Output is correct |
| 18 |
Correct |
5 ms |
364 KB |
Output is correct |
| 19 |
Correct |
3 ms |
364 KB |
Output is correct |
| 20 |
Correct |
3 ms |
364 KB |
Output is correct |
| 21 |
Correct |
3 ms |
364 KB |
Output is correct |
| 22 |
Correct |
5 ms |
364 KB |
Output is correct |
| 23 |
Correct |
3 ms |
364 KB |
Output is correct |
| 24 |
Correct |
3 ms |
364 KB |
Output is correct |
| 25 |
Correct |
3 ms |
364 KB |
Output is correct |
| 26 |
Correct |
3 ms |
364 KB |
Output is correct |
| 27 |
Correct |
3 ms |
364 KB |
Output is correct |
| 28 |
Correct |
3 ms |
364 KB |
Output is correct |
| 29 |
Correct |
4 ms |
364 KB |
Output is correct |
| 30 |
Correct |
4 ms |
364 KB |
Output is correct |
| 31 |
Correct |
3 ms |
364 KB |
Output is correct |
| 32 |
Correct |
3 ms |
512 KB |
Output is correct |
| 33 |
Correct |
3 ms |
364 KB |
Output is correct |
| 34 |
Correct |
3 ms |
364 KB |
Output is correct |
| 35 |
Correct |
3 ms |
364 KB |
Output is correct |
| 36 |
Correct |
3 ms |
364 KB |
Output is correct |
| 37 |
Correct |
4 ms |
364 KB |
Output is correct |
| 38 |
Correct |
3 ms |
364 KB |
Output is correct |
| 39 |
Correct |
3 ms |
364 KB |
Output is correct |
| 40 |
Correct |
3 ms |
364 KB |
Output is correct |
| 41 |
Correct |
4 ms |
364 KB |
Output is correct |
| 42 |
Correct |
3 ms |
364 KB |
Output is correct |
| 43 |
Correct |
3 ms |
364 KB |
Output is correct |
| 44 |
Correct |
3 ms |
364 KB |
Output is correct |
| 45 |
Correct |
5 ms |
364 KB |
Output is correct |
| 46 |
Correct |
3 ms |
364 KB |
Output is correct |
| 47 |
Correct |
3 ms |
364 KB |
Output is correct |
| 48 |
Correct |
4 ms |
364 KB |
Output is correct |
| 49 |
Correct |
3 ms |
364 KB |
Output is correct |
| 50 |
Correct |
3 ms |
364 KB |
Output is correct |
| 51 |
Correct |
3 ms |
364 KB |
Output is correct |
| 52 |
Correct |
3 ms |
364 KB |
Output is correct |
| 53 |
Correct |
3 ms |
364 KB |
Output is correct |
| 54 |
Correct |
4 ms |
364 KB |
Output is correct |
| 55 |
Correct |
3 ms |
364 KB |
Output is correct |
| 56 |
Correct |
3 ms |
364 KB |
Output is correct |
| 57 |
Correct |
5 ms |
364 KB |
Output is correct |
| 58 |
Correct |
3 ms |
364 KB |
Output is correct |
| 59 |
Correct |
4 ms |
364 KB |
Output is correct |
| 60 |
Correct |
3 ms |
364 KB |
Output is correct |
| 61 |
Correct |
3 ms |
364 KB |
Output is correct |
| 62 |
Correct |
3 ms |
364 KB |
Output is correct |
| 63 |
Correct |
3 ms |
512 KB |
Output is correct |
| 64 |
Correct |
3 ms |
364 KB |
Output is correct |
| 65 |
Correct |
3 ms |
364 KB |
Output is correct |
| 66 |
Correct |
3 ms |
364 KB |
Output is correct |
| 67 |
Correct |
3 ms |
364 KB |
Output is correct |
| 68 |
Correct |
3 ms |
364 KB |
Output is correct |
| 69 |
Correct |
3 ms |
364 KB |
Output is correct |
| 70 |
Correct |
3 ms |
364 KB |
Output is correct |
| 71 |
Correct |
3 ms |
364 KB |
Output is correct |
| 72 |
Correct |
3 ms |
364 KB |
Output is correct |
| 73 |
Correct |
4 ms |
384 KB |
Output is correct |
| 74 |
Correct |
3 ms |
364 KB |
Output is correct |
| 75 |
Correct |
3 ms |
364 KB |
Output is correct |
| 76 |
Correct |
3 ms |
364 KB |
Output is correct |
| 77 |
Correct |
3 ms |
512 KB |
Output is correct |
| 78 |
Correct |
3 ms |
364 KB |
Output is correct |
| 79 |
Correct |
3 ms |
364 KB |
Output is correct |
| 80 |
Correct |
3 ms |
364 KB |
Output is correct |
| 81 |
Correct |
3 ms |
364 KB |
Output is correct |
| 82 |
Correct |
3 ms |
364 KB |
Output is correct |
| 83 |
Correct |
3 ms |
364 KB |
Output is correct |
| 84 |
Correct |
3 ms |
364 KB |
Output is correct |
| 85 |
Correct |
3 ms |
364 KB |
Output is correct |
| 86 |
Correct |
4 ms |
364 KB |
Output is correct |
| 87 |
Correct |
3 ms |
384 KB |
Output is correct |
| 88 |
Correct |
5 ms |
364 KB |
Output is correct |
| 89 |
Correct |
3 ms |
364 KB |
Output is correct |
| 90 |
Correct |
4 ms |
364 KB |
Output is correct |
| 91 |
Correct |
3 ms |
364 KB |
Output is correct |
| 92 |
Correct |
3 ms |
364 KB |
Output is correct |
| 93 |
Correct |
3 ms |
364 KB |
Output is correct |
| 94 |
Correct |
3 ms |
364 KB |
Output is correct |
| 95 |
Correct |
3 ms |
364 KB |
Output is correct |
| 96 |
Correct |
3 ms |
364 KB |
Output is correct |
| 97 |
Correct |
3 ms |
364 KB |
Output is correct |
| 98 |
Correct |
3 ms |
364 KB |
Output is correct |
| 99 |
Correct |
3 ms |
512 KB |
Output is correct |
| 100 |
Correct |
3 ms |
364 KB |
Output is correct |
