제출 #975447

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
975447		pirhosig	커다란 상품 (IOI17_prize)	C++17	20 / 100	10 ms	596 KiB

prize

#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> ii;



int find_best(int n) {
	if (n < 5000) {
		for (int i = 0; i < n; ++i) {
			auto a = ask(i);
			if (a[0] + a[1] == 0) return i;
		}
	}

	int large = 0;
	vector<int> val(450);
	for (int i = 0; i < 450; ++i) {
		auto a = ask(i);
		val[i] = a[0] + a[1];
		if (val[i] == 0) return i;
		large = max(large, val[i]);
	}

	int found = 0;
	for (int a : val) if (a != large) found++;

	int low = 450;
	for (int i = found + 1; i <= large; ++i) {
		int upp = n - 1;
		while (low < upp) {
			int mid = (low + upp) / 2;
			auto a = ask(mid);
			int tot = a[0] + a[1];
			if (tot == 0) return mid;
			if (tot < large) {
				int skip = 0;
				while (tot < large) {
					mid--;
					skip++;
					a = ask(mid);
					tot = a[0] + a[1];
					if (tot == 0) return mid;
				}
				if (a[0] + skip >= i) low = upp = mid + i - a[0];
			}

			if (a[0] < i) low = mid + 1;
			else upp = mid - 1;
		}
		auto a = ask(low);
		if (a[0] + a[1] == 0) return low;
		low++;
	}

	return -1;
}

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