# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
239811 | brainwarego | Carnival (CEOI14_carnival) | C11 | 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 <cstdio>
int group[160] = {0, 1};
int entry[160] = {0, 1}, en = 1, arr[160];
int query(int len, int*ap){
printf("%d ", len);
for(int i=1;i<=len;++i) printf("%d ", ap[i]);
puts("");
int response;
scanf("%d", &response);
return response;
}
int bsearch(int s, int e, int tg){
int m, ans = s;
while(s <= e){
m = (s + e) / 2;
for(int i=1;i<=m;++i) arr[i] = entry[i];
arr[m+1] = tg;
if(query(m+1, arr) < m+1){
ans = m, e = m-1;
}
else s = m+1;
}
return entry[ans];
}
int main(){
int N;
scanf("%d", &N);
for(int i=2;i<=N;++i){
entry[en + 1] = i;
if(query(en+1, entry)==en+1){
group[i] = ++en;
continue;
}
int gnum = bsearch(1, en, i);
group[i] = gnum;
}
printf("0 ");
for(int i=1;i<=N;++i) printf("%d ", group[i]);
return 0;
}