Submission #1076140

#TimeUsernameProblemLanguageResultExecution timeMemory
1076140aminThe Big Prize (IOI17_prize)C++14
20 / 100
58 ms344 KiB
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
vector<int>q;
int find_best(int n) {
    int cur=0;

    while(cur!=n)
    {
       // cout<<cur<<endl;
 q=ask(cur);

 int p=q[0];
 int pp=q[1];
 if(p==0&&pp==0)
    return cur;
        int l=0;
        int r=n-cur;
        while(l<r-1)
        {
            int mid=(l+r)/2;
           q=ask(cur+mid);
           if(p==q[0]&&pp==q[1])
           {
               l=mid;
           }else
           r=mid;
        }
        cur=r+cur;
    }

}

Compilation message (stderr)

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