# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
119160 | nvmdava | Carnival (CEOI14_carnival) | C++17 | 11 ms | 384 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 <bits/stdc++.h>
using namespace std;
int f[155];
int cnt = 1;
int ans[155];
void find(int id, int l, int r){
if(l == r){
ans[id] = l;
return;
}
int m = (l + r) >> 1;
printf("%d ", m - l + 2);
for(int i = l; i <= m; i++){
printf("%d ", f[i]);
}
printf("%d ", id);
fflush(stdout);
int k;
scanf("%d", &k);
if(k == m - l + 2){
find(id, m + 1, r);
} else find(id, l, m);
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
scanf("%d", &n);
f[1] = 1;
ans[1] = 1;
for(int i = 2; i <= n; i++){
printf("%d ", i);
for(int j = 1; j <= i; j++){
printf("%d ", j);
}
fflush(stdout);
int k;
scanf("%d", &k);
if(k == cnt + 1){
ans[i] = ++cnt;
f[cnt] = i;
} else {
find(i, 1, cnt);
}
}
printf("0 ");
for(int i = 1; i <= n; i++){
printf("%d ", ans[i]);
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |