Submission #140336

#TimeUsernameProblemLanguageResultExecution timeMemory
140336ggoh커다란 상품 (IOI17_prize)C++14
20 / 100
91 ms424 KiB
#include "prize.h"
#include<bits/stdc++.h>


int find_best(int n) {
	int l=0,r=n,h,ans;
	while(1)
    {
        h=(l+r)/2;
        std::vector<int> res=ask(h);
        if(res[0]+res[1]==0){ans=h;break;}
        if(res[0]==1){r=h;}
        else l=h;
    }
	return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...