제출 #152162

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
152162		mieszko11b	커다란 상품 (IOI17_prize)	C++14	97.64 / 100	77 ms	5392 KiB

prize

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

using namespace std;

#define X first
#define Y second

using ii = pair<int, int>;

int n;
vector<int> V[200007];

ii ans(int i) {
	if(V[i].size() == 0)
		V[i] = ask(i);
	return {V[i][0], V[i][1]};
}

int worst_sum;

int find_in_segment(int a, int b, int ok) {
	if(!ok)
		return -1;
	
	int mid1 = (a + b) / 2;
	int mid2 = (a + b) / 2;
	
	while(ans(mid1).X + ans(mid1).Y != worst_sum && mid1 >= a) {
		if(ans(mid1).X + ans(mid1).Y == 0)
			return mid1;
		mid1--;
	}
	
	if(mid1 > a) {
		int x = find_in_segment(a, mid1 - 1, ans(mid1).X - ans(a - 1).X);
		if(x != -1)
			return x;
	}
	
	while(ans(mid2).X + ans(mid2).Y != worst_sum && mid2 <= b) {
		if(ans(mid2).X + ans(mid2).Y == 0)
			return mid2;
		mid2++;
	}
	
	if(mid2 < b) {
		int x = find_in_segment(mid2 + 1, b, ans(b + 1).X - ans(mid2).X);
		if(x != -1)
			return x;
	}
	
	return -1;
}

int find_best(int n) {
	::n = n;
	
	int pocz = 0, kon = n - 1;
	set<int> diff;
	while(pocz <= min(474, n) && diff.size() < 5) {
		worst_sum = max(worst_sum, ans(pocz).X + ans(pocz).Y);
		diff.insert(ans(pocz).X + ans(pocz).Y);
		if(ans(pocz).X + ans(pocz).Y == 0)
			return pocz;
		pocz++;
	}
	
	while(ans(pocz).X + ans(pocz).Y != worst_sum) {
		if(ans(pocz).X + ans(pocz).Y == 0)
			return pocz;
		pocz++;		
	}
	
	while(ans(kon).X + ans(kon).Y != worst_sum) {
		if(ans(kon).X + ans(kon).Y == 0)
			return kon;
		kon--;
	}
	
	pocz++;
	kon--;
	return find_in_segment(pocz, kon, ans(kon + 1).X - ans(pocz - 1).X);
}

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