Submission #1018782

#TimeUsernameProblemLanguageResultExecution timeMemory
1018782vjudge1커다란 상품 (IOI17_prize)C++17
20 / 100
0 ms428 KiB
#include "prize.h" #include<bits/stdc++.h> using namespace std; #define lli long long int int find_best(int n){ vector<int>a(2); int x=0,y=n-1,z; while(x!=y){ z=(x+y)/2; a=ask(z); if(a[0]==1){ y=z-1; } else if(a[1]==1){ x=z+1; } else{ return z; } } return x; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...