# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
27648 | samir_droubi | Carnival (CEOI14_carnival) | C++14 | 29 ms | 2020 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 mxn=155;
int ty[mxn];
int n;
int sz=0;
int query(int l,int r)
{
int nm=0;
for(int i=l;i<=r;++i)
{
if(ty[i]==0)
++nm;
}
printf("%d",nm);
for(int i=l;i<=r;++i)
{
if(ty[i]==0)
printf(" %d",i);
}
printf("\n");
fflush(stdout);
int ans;
scanf("%d",&ans);
return ans;
}
int bs(int num)
{
int l=1;
int r=n;
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... |