제출 #117278

#제출 시각아이디문제언어결과실행 시간메모리
117278WongHokFong_cpp커다란 상품 (IOI17_prize)C++14
0 / 100
54 ms384 KiB
#include <iostream> #include <cstdio> #include <cstdio> #include <iomanip> #include <cstring> #include <algorithm> #include "prize.h" #include <vector> using namespace std; vector<int> a; int find_best(int n) { int l=0,r=n-1; int mid=(r+l)/2; while(0==0) { a=ask(mid); if(a[0]+a[1]==0) return mid; if(a[0]==1) r=mid-1; else l=mid+1; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...