제출 #41848

#제출 시각아이디문제언어결과실행 시간메모리
41848rahasia커다란 상품 (IOI17_prize)C++14
20 / 100
19 ms7808 KiB
#include "prize.h"
#include<bits/stdc++.h>
using namespace std;
int l,r,c,ma,b[202020];
vector<int> d[202020];
int find_best(int n) {
	for(int i = 0; i < n; i++) {
		if(b[i]==0)
		{
			b[i]=1;
			d[i] = ask(i);
		}
		std::vector<int> res=d[i];
		if(res[0] + res[1] == 0)
			return i;
		l=i+1;
		r=n-1;
		while(l<=r)
		{
			c=(l+r)/2;
			if(b[c]==0)
			{
				b[c]=1;
				d[c]=ask(c);
			}
			vector<int> hv=d[c];
			if(hv==res)
			{
				i=c;
				l=c+1;
			}
			else
				r=c-1;
		}
	}
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...