제출 #131055

#제출 시각아이디문제언어결과실행 시간메모리
131055amiratou커다란 상품 (IOI17_prize)C++14
20 / 100
3 ms376 KiB
#include "prize.h" #include <bits/stdc++.h> using namespace std; int find_best(int n) { int idx=(n-1)/2; for (int q = 18; q >=0 ; q--) { int l,r; vector<int> res=ask(idx); if(res[0]+res[1]==0)return idx; if(res[1]>=res[0])l=idx+1,r=n-1; else r=idx-1,l=0; idx=(l+r)/2; while(l<r){ int med=(l+r)/2; res=ask(med); if(res[0]+res[1]==0)return med; if(res[1]>=res[0])l=med+1,idx=l; else r=med-1,idx=r; } } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...