제출 #298463

#제출 시각아이디문제언어결과실행 시간메모리
298463medk커다란 상품 (IOI17_prize)C++14
20 / 100
78 ms384 KiB
#include <bits/stdc++.h> #include "prize.h" #define ll long long #define pb push_back #define x first #define y second #define sz(u) (int)(u.size()) #define all(u) u.begin(),u.end() using namespace std; vector<int> tmp; int find_best(int N){ int ptr=0; int curall=1, curR=1; while(1){ tmp=ask(ptr); curall=tmp[0]+tmp[1]; if(curall==0) break; curR=tmp[0]; int l=0,r=N; while(l<r){ int md=(l+r)/2; tmp=ask(md); if(tmp[0]+tmp[1]!=curall || tmp[0]!=curR) r=md; else l=md+1; } ptr=l; } return ptr; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...