# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
97010 | Kastanda | Carnival (CEOI14_carnival) | C++11 | 40 ms | 512 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.
// Awesome feelings
#include<bits/stdc++.h>
using namespace std;
const int N = 155;
int n, ts, C[N];
inline int Query(int l, int r)
{
printf("%d", r - l + 1);
for (int i = l; i <= r; i++)
printf(" %d", i);
printf("\n"); fflush(stdout);
int k; scanf("%d", &k);
return (k);
}
int main()
{
scanf("%d", &n);
for (int i = 1; i <= n; i++)
{
if (!C[i])
C[i] = ++ ts;
int le = i, ri = n + 1, md;
while (ri - le > 1)
{
md = (le + ri) >> 1;
if (Query(i + 1, md) < Query(i, md))
le = md;
else
ri = md;
}
C[ri] = C[i];
}
printf("0");
for (int i = 1; i <= n; i++)
printf(" %d", C[i]);
printf("\n"); fflush(stdout);
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... |