Submission #41843

#TimeUsernameProblemLanguageResultExecution timeMemory
41843rahasia커다란 상품 (IOI17_prize)C++14
90 / 100
30 ms2020 KiB
#include "prize.h" #include<bits/stdc++.h> using namespace std; int l,r,c,ma; int find_best(int n) { for(int i = 0; i < n; i++) { std::vector<int> res = ask(i); if(res[0] + res[1] == 0) return i; ma=max(ma,res[0]+res[1]); if(res[0]+res[1]<ma) continue; l=i; r=n-1; while(l<=r) { c=(l+r)/2; vector<int> hv=ask(c); if(hv==res) { i=c; l=c+1; } else r=c-1; } } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...