제출 #1012225

#제출 시각아이디문제언어결과실행 시간메모리
1012225hyakup커다란 상품 (IOI17_prize)C++17
20 / 100
1 ms504 KiB
#include "prize.h" #include <bits/stdc++.h> using namespace std; #define bug(x) cout << #x << " " << x << endl; int bs( int n ){ int l = 0, r = n - 1; while( l < r ){ int mid = ( l + r )/2; vector<int> a = ask(mid); if( a[0] == a[1] && a[0] == 0 ) return mid; if( a[0] == 1 ) r = mid - 1; else l = mid + 1; } return r; } int find_best(int n) { return bs(n); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...