Submission #1053946

#TimeUsernameProblemLanguageResultExecution timeMemory
1053946aaaaaarrozThe Big Prize (IOI17_prize)C++17
90 / 100
56 ms432 KiB
    #include "prize.h"
    #include <bits/stdc++.h>
    using namespace std;
     
    int find_best(int n){
        int worst_case = 0;
        for(int i=0;i<480;i++) {
            auto curr = ask(i);
            int c = curr[0]+curr[1];
            if(c==0)return i;
            worst_case = max(worst_case,c);
        }
        for(int i=480;i<n;i++) {
            auto base = ask(i);
            if(base[0]+base[1]==worst_case)
                for(int jump=131072;jump;jump/=2) {
                    if(i+jump>=n)continue;
                    auto temp = ask(i+jump);
                    if(temp==base)i+=jump;
                }
            int curr = base[0]+base[1];
            if(curr==0)return i;
        }
    }

Compilation message (stderr)

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