제출 #427055

#제출 시각아이디문제언어결과실행 시간메모리
427055Rouge_Hugo커다란 상품 (IOI17_prize)C++14
0 / 100
139 ms288 KiB
#include<bits/stdc++.h> #include "prize.h" #define ll long long #define fi first #define se second using namespace std; int find_best(int n) { int l=0,r=n+2; /*vector<int>w=ask(0); if(n<=2){ if(w[0]+w[1]==0) { return 0; } else return 1; }*/ while(l<r) { int m=(l+r)/2; m=min(m,n-1); vector<int>v=ask(m); if(v[0]==0) l=m+1; else r=m; }return l-1; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...