Submission #821214

#	Time	Username	Problem	Language	Result	Execution time	Memory
821214		vjudge1	커다란 상품 (IOI17_prize)	C++17	90 / 100	74 ms	336 KiB

prize

#include "prize.h"
#include<bits/stdc++.h>

using namespace std;

const int B = 480;

int find_best(int n) {
	int mx = 0;
	for(int i = 0; i < min(B, n); i++) {
		auto x = ask(i);
		if(!(x[0] + x[1])) return i;
		if(x[0] + x[1] > mx) 
			mx = x[0] + x[1];
	}
	for(int i = 0; i < n; i++) {
		auto x = ask(i);
		if(!(x[0] + x[1])) return i;
		if(x[0] + x[1] == mx) {
			int lb = i, rb = n;
			while(rb - lb > 1) {
				int mid = (lb + rb) / 2;
				auto y = ask(mid);
				if(y[0] + y[1] < mx) {
					rb = mid;
					continue;
				}
				if(y[0] == x[0]) lb = mid;
				else rb = mid; 
			}
			i = lb;
		}
	}
	return 0;
}

• Subtask 1: 20 / 20
• Subtask 2: 70 / 80