Submission #1060827

#TimeUsernameProblemLanguageResultExecution timeMemory
1060827ArthuroWichThe Big Prize (IOI17_prize)C++17
20 / 100
1 ms344 KiB
#include"prize.h" #include<bits/stdc++.h> using namespace std; int find_best(int n) { vector<int> res; int l = 0, r = n-1; while(l < r) { int m = (l+r)/2; res = ask(m); if (res[0] == res[1] && res[0] == 0) { return m; } else if (res[0] <= res[1]) { l = m+1; } else if (res[0] > res[1]) { r = m-1; } } for (int i = l; i <= min(r, n-1); i++) { res = ask(i); if (res[0] == res[1] && res[0] == 0) { return i; } } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...