Submission #1163650

#TimeUsernameProblemLanguageResultExecution timeMemory
1163650cnn008The Big Prize (IOI17_prize)C++20
20 / 100
0 ms456 KiB
#include "prize.h" #include "bits/stdc++.h" using namespace std; int cnt; pair <int,int> mp[200005]; pair <int,int> get(int i){ if(mp[i].first || mp[i].second) return mp[i]; cnt++; assert(cnt<=10000); auto vi=ask(i); pair <int,int> ans={vi[0],vi[1]}; return mp[i]=ans; } int find_best(int n) { int L=0,R=n-1; for(int i=1; i<=500; i++){ int l=L,r=R; while(l<=r){ int mid=(l+r)>>1; auto [u,v]=get(mid); if(!u and !v) return mid; if(!u){ L=mid+1; break; }else r=mid-1; } } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...