# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
170054 | rzbt | Carnival (CEOI14_carnival) | C++14 | 11 ms | 376 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>
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define MAXN 155
typedef long long ll;
using namespace std;
int niz[MAXN];
int n,k;
vector<int> pozjed;
int bin(int l,int d,int sol,int koji){
//printf(" usobin %d %d %d",k,d,koji);
if(l>d)return sol;
int mid=(l+d)/2;
printf("%d ",d-mid+2);
for(int i=mid;i<=d;i++){
printf("%d ",pozjed[i]);
}
printf("%d ",koji);
fflush(stdout);
int razl;
scanf("%d",&razl);
if(razl==d-mid+1)return bin(mid+1,d,mid+1,koji);
return bin(l,mid-1,sol,koji);
}
int main()
{
scanf("%d", &n);
niz[1]=1;
k=1;
pozjed.pb(1);
for(int i=2;i<=n;i++){
printf("%d ",i);
for(int j=1;j<=i;j++)printf("%d ",j);
fflush(stdout);
int razl;
scanf("%d", &razl);
if(razl>k){
k++;
niz[i]=k;
pozjed.pb(i);
continue;
}
niz[i]=bin(0,k-1,-1,i);
}
printf("0 ");
for(int i=1;i<=n;i++)printf("%d ",niz[i]);
fflush(stdout);
return 0;
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... |