제출 #1075703

#제출 시각아이디문제언어결과실행 시간메모리
1075703NeroZein커다란 상품 (IOI17_prize)C++17
20 / 100
1 ms600 KiB
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;

//~ const int B = 500;

int find_best(int n) {
	for (int i = 0; i < n; ++i) {
		vector<int> res = ask(i); 
		if (res[0] + res[1] == 0) {
			return i; 
		}
		//~ if (res[0] + res[1] >= B) {
			//~ cerr << "res0, res1; " << res[0] << ' ' << res[1] << endl; 
			int l = i, r = n - 1;
			while (l < r) {
				int mid = (l + r + 1) >> 1;
				vector<int> res2 = ask(mid);
				if (res2[1] < res[1]) {//I skipped a more valuable person
					r = mid - 1;
				} else {
					l = mid; 
				}
			}
			i = l;
		//~ }
	}
	assert(false);	
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...