# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
160098 | luciocf | Carnival (CEOI14_carnival) | C++14 | 18 ms | 504 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;
const int maxn = 155;
int ans[maxn];
int ind[maxn];
int main(void)
{
int n;
scanf("%d", &n);
int c = 1;
ans[1] = 1, ind[1] = 1;
for (int i = 2; i <= n; i++)
{
int ini = 1, fim = c, cor = c+1;
while (ini <= fim)
{
int mid = (ini+fim)>>1;
printf("%d", mid+1);
for (int j = 1; j <= mid; j++)
printf(" %d", ind[j]);
printf(" %d\n", i);
fflush(stdout);
int res;
scanf("%d", &res);
if (res == mid) cor = mid, fim = mid-1;
else ini = mid+1;
}
c = max(c, cor);
ans[i] = cor, ind[cor] = i;
}
printf("0");
for (int i = 1; i <= n; i++)
printf(" %d", ans[i]);
printf("\n");
fflush(stdout);
}
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... |