Submission #1075811

#TimeUsernameProblemLanguageResultExecution timeMemory
1075811mdn2002The Big Prize (IOI17_prize)C++14
90 / 100
46 ms596 KiB
#include "prize.h" #include<bits/stdc++.h> using namespace std; int find_best(int n) { int mx = 0, lim = 500; for (int i = 0; i < min(n, lim); i ++) { vector<int> a = ask(i); mx = max(mx, a[0] + a[1]); if (a[0] + a[1] == 0) return i; } for (int i = 0; i < n; i ++) { vector<int> a = ask(i); int logg = 400; if (a[0] + a[1] == mx) { for (int j = logg; j >= 1; j = (j + 1) / 2) { if (i + j >= n) continue; vector<int> b = ask(i + j); if (a[1] == b[1]) i += j; if (j == 1) break; } } else if (a[0] + a[1] == 0) return i; } }

Compilation message (stderr)

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