# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
99256 | duy_tran | Carnival (CEOI14_carnival) | C++14 | 31 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;
const int maxn=(int)200;
int n,chk[maxn],c;
vector<int> a;
int main()
{
scanf("%d", &n);
for(int i=1;i<=n;++i)
{
int cnt=0;
a.clear();
for(int j=1;j<=n;++j)
if(!chk[j])a.push_back(j),++cnt;
int l=0;int r=a.size()-1;
int mid;
printf("%d ",cnt);
fflush(stdout);
for(int j:a)
{
if(j==a.back())printf("%d\n",j);
else printf("%d ",j);
fflush(stdout);
}
scanf("%d", &c);
if(c==1)
{
for(int j:a)chk[j]=c;
break;
}
else
{
int l=0;int r=a.size()-1;
int mid;
while(l<=r)
{
mid=(l+r)/2;
int nc;
printf("%d ",mid);
fflush(stdout);
for(int j=0;j<mid;++j)
{
if(j==mid-1)printf("%d\n",a[j]);
else printf("%d ",a[j]);
fflush(stdout);
}
scanf("%d", &nc);
if(nc<c-1)l=mid+1;
else r=mid-1;
}
chk[a[l]]=c;
}
}
int en=0;
printf("%d ",en);
fflush(stdout);
for(int i=1;i<=n;++i)
{
printf("%d ",chk[i]);
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... |