Submission #718101

#TimeUsernameProblemLanguageResultExecution timeMemory
718101Jarif_RahmanThe Big Prize (IOI17_prize)C++17
20 / 100
78 ms296 KiB
#include "prize.h" #include <bits/stdc++.h> #define pb push_back #define f first #define sc second using namespace std; typedef long long int ll; typedef string str; vector<vector<int>> asked; vector<int> Ask(int i){ if(asked[i].empty()) asked[i] = ask(i); return asked[i]; } int find_best(int n){ int p = 0; while(1){ auto cur = ask(p); if(cur[0]+cur[1] == 0) return p; int a = p+1, b = n-1; while(a < b){ int md = (a+b)/2; auto v = ask(md); if(v[0]+v[1] != cur[0]+cur[1]) b = md; else if(v[0] != cur[0]) b = md-1; else a = md+1; } p = a; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...