Submission #820514

#TimeUsernameProblemLanguageResultExecution timeMemory
820514vjudge1커다란 상품 (IOI17_prize)C++14
20 / 100
1 ms336 KiB
#include<bits/stdc++.h> #include "prize.h" using namespace std ; //vector<int> ask(int ind) //{ // vector<int> v(2) ; // cout << "? " << ind << '\n' ; // cin >> v[0] >> v[1] ; // return v ; //} int find_best(int n) { int l = -1, r = n ; while(l + 1 < r) { int mid = (l + r) / 2 ; vector<int> v = ask(mid) ; if(!v[0] && !v[1]) return mid ; else { if(v[0]) r = mid ; else l = mid ; } } return l ; } //signed main() //{ // int n ; // cin >> n ; // cout<<find_best(n) ; // return 0 ; //}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...