Submission #343814

#TimeUsernameProblemLanguageResultExecution timeMemory
343814Kerim커다란 상품 (IOI17_prize)C++17
20 / 100
120 ms512 KiB
#include "prize.h" #include "bits/stdc++.h" using namespace std; const int C=500; const int CC=25; int find_best(int n){ int mx=0; for(int i=0;i<min(C,n);i++){ vector<int>res=ask(i); if(res[0]+res[1]==0) return i; mx=max(mx,res[0]+res[1]); } for(int i=C;i<n;i++){ vector<int>res=ask(i); if(res[0]+res[1]==0) return i; if(res[0]+res[1]<mx) continue; if(i+C<n and ask(i+C)==res) i+=C; else if(i+CC<n and ask(i+CC)==res) i+=CC; else{ for(int j=0;i<n and j<CC;j++){ i++; vector<int>res=ask(i); if(res[0]+res[1]==0) return i; } } } return -1; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...