Submission #431064

#TimeUsernameProblemLanguageResultExecution timeMemory
431064Belgutei커다란 상품 (IOI17_prize)C++17
20 / 100
2 ms348 KiB
#include "prize.h" #include<bits/stdc++.h> using namespace std; #define ll long long #define ff first #define ss second #define pb push_back #define mk make_pair int find_best(int n) { int l=0; int r=n-1; while(l<r){ int mid=(l+r+1)/2; vector<int> res = ask(mid); if(res[0]==0 && res[1]==0) return mid; if(res[0]==1){ r=mid-1; } else l=mid+1; } return l; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...