Submission #1163645

#TimeUsernameProblemLanguageResultExecution timeMemory
1163645cnn008The Big Prize (IOI17_prize)C++20
20 / 100
1038 ms412 KiB
#include "prize.h" #include "bits/stdc++.h" using namespace std; map<int,pair <int,int> > mp; pair <int,int> get(int i){ if(mp.count(i)) return mp[i]; 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; while(1){ 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...