# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
29242 | samir_droubi | Nizovi (COI14_nizovi) | C++14 | 99 ms | 5928 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;
int n,N;
const int mxn=(1e6)+(1e3)+5;
int id[mxn];
int bs(int i,int j)
{
int in=-1;
int l=j;
int r=n+N;
while(l<=r)
{
int md=(l+r)/2;
printf("cmp %d %d\n",md,i);
fflush(stdout);
int x;
scanf("%d",&x);
if(x<=0)
{
in=md;
l=md+1;
}
else
r=md-1;
}
return in;
}
int main()
{
scanf("%d%d",&n,&N);
int c=n;
int in=1;
while(c)
{
int x = bs( in, in + c );
if(x==-1)
{
--c;
++in;
continue;
}
if( x > in ) printf("reverse %d %d\n", in, x);
fflush(stdout);
if( x - c > in ) printf("reverse %d %d\n", in, x - c );
fflush(stdout);
if( x > x - c + 1 ) printf("reverse %d %d\n", x - c + 1, x);
fflush(stdout);
in = x - c + 1;
}
puts("end");
fflush(stdout);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |