# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
253406 | ChrisT | Carnival (CEOI14_carnival) | C++17 | 10 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;
vector<vector<int>> ret;
int getpos (int i, int l, int r) {
if (l == r) return l;
int mid = (l + r) / 2;
printf ("%d ",mid-l+2);
for (int j = l; j <= mid; j++) printf ("%d ",ret[j].back());
printf ("%d\n",i);
fflush(stdout);
int go; scanf ("%d",&go);
if (go == mid - l + 1) return getpos(i,l,mid);
else return getpos(i,mid+1,r);
}
int main () {
int n;
scanf ("%d",&n);
ret = {{1}};
for (int i = 2; i <= n; i++) {
printf ("%d ",i);
for (int j = 1; j <= i; j++) printf("%d%c",j," \n"[j==i]);
fflush(stdout);
int new_cnt; scanf ("%d",&new_cnt);
if (new_cnt > (int)ret.size()) ret.push_back({i});
else ret[getpos(i,0,(int)ret.size()-1)].push_back(i);
}
vector<int> ans(n+1);
for (int i = 0; i < (int)ret.size(); i++) {
for (int j : ret[i]) ans[j] = i+1;
}
printf ("0 ");
for (int i = 1; i <= n; i++) printf ("%d%c",ans[i]," \n"[i==n]);
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... |