Submission #626514

#TimeUsernameProblemLanguageResultExecution timeMemory
626514MounirThe Big Prize (IOI17_prize)C++14
20 / 100
1 ms336 KiB
#include "prize.h" #include <bits/stdc++.h> using namespace std; map<int, vector<int>> ans; vector<int> ask_res(int i){ if (ans.count(i)) return ans[i]; ans[i] = ask(i); //if (i != 7) cout << "query " << i << " " << rep[0] << " " << rep[1] << endl; return ans[i]; } int find_best(int n) { int deb = 0, fin = n - 1; while (deb < fin){ int mid = (deb + fin)/2; vector<int> resMid = ask_res(mid); if (resMid[0] + resMid[1] == 0) return mid; if (resMid[0] != 0) fin = mid - 1; else deb = mid + 1; } return deb; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...