Submission #427545

#TimeUsernameProblemLanguageResultExecution timeMemory
427545MOUF_MAHMALATThe Big Prize (IOI17_prize)C++14
0 / 100
153 ms5216 KiB
#include "prize.h"
#include<bits/stdc++.h>
using namespace std;
typedef int ll;
ll id,l,r,m,mx;
vector<ll>v[200009];
int find_best(int n)
{
    mx=n/2;
    while(id<n)
    {
        if(v[id].empty())
        v[id]=ask(id);
        if(v[id][0]+v[id][1]==0)
            return id;
        if(v[id][0]+v[id][1]<=mx)
        {
            id++;
            continue;
        }
        l=id,r=n;
        while(r-l>1)
        {
            m=(l+r)/2;
            if(v[m].empty())
            v[m]=ask(m);
            if(v[m][0]+v[m][1]==0)
                return m;
            if(v[m]==v[id])
                l=m;
            else
                r=m;
        }
        id=l+1;
    }
}

Compilation message (stderr)

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