Submission #427626

#TimeUsernameProblemLanguageResultExecution timeMemory
427626MOUF_MAHMALATThe Big Prize (IOI17_prize)C++14
20 / 100
146 ms5428 KiB
#include "prize.h"
#include<bits/stdc++.h>
using namespace std;
typedef int ll;
ll id,l,r,m,x;
vector<ll>v[200009];
int find_best(int n)
{
    for(ll i=0;i<min(n,470);i++)
    {
        v[i]=ask(i);
        if(v[i][0]+v[i][1]==0)
            return i;
        if(v[i][0]+v[i][1]>=v[id][0]+v[id][1])
            id=i;
    }
    x=id;
    while(id<n)
    {
        if(v[id].empty())
        v[id]=ask(id);
        if(v[id][0]+v[id][1]==0)
            return id;
        if(v[x][0]+v[x][1]!=v[id][0]+v[id][1])
        {
            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:44:1: warning: control reaches end of non-void function [-Wreturn-type]
   44 | }
      | ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...