Submission #427124

#TimeUsernameProblemLanguageResultExecution timeMemory
427124MOUF_MAHMALATThe Big Prize (IOI17_prize)C++14
0 / 100
140 ms288 KiB
#include "prize.h"
#include<bits/stdc++.h>
using namespace std;
typedef int ll;
vector<ll>v,w,x;
ll l,r,m;
int find_best(int n)
{
    v=ask(0);
    l=0,r=n-1;
    while(l<=r)
    {
        m=(l+r)/2;
        w=ask(m);
        if(w[0]+w[1]==0)
            return m;
        if(v==w)
        {
            l=m+1;
            continue;
        }
        for(ll i=l; i<=min(n-1,l+100); i++)
        {
            x=ask(i);
            if(x[0]+x[1]==0)
                return i;
        }
        l+=100;
        v=w;
    }
}

Compilation message (stderr)

prize.cpp: In function 'int find_best(int)':
prize.cpp:31:1: warning: control reaches end of non-void function [-Wreturn-type]
   31 | }
      | ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...