제출 #794497

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
794497		Sohsoh84	The Big Prize (IOI17_prize)	C++17	97.90 / 100	49 ms	5328 KiB

prize

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

using namespace std;

const int MAX = 500; // CHANGE
const int SQ = 256;
const int MAXN = 2e5 + 10;

#define debug(x)		cerr << #x << ": " << x << endl;
#define sep			' '

int n;
vector<int> res[MAXN];
bool B[MAXN];

inline vector<int> assk(int ind) {
	if (B[ind]) return res[ind];
	B[ind] = true;
	return res[ind] = ask(ind);
}

inline int sum(int ind) {
	vector<int> res = assk(ind);
	return res[0] + res[1];
}

inline int find_cheapest() {
	int best_val = 0;
	for (int i = 0; i < min(n, MAX); i++) {
		int val = sum(i);
		if (val > best_val)
			best_val = val;

	}

	return best_val;
}


int find_best(int n_) {
	n = n_;
	int lim = find_cheapest();
	
	for (int i = 0; i < min(n, MAX); i++)
		if (sum(i) == 0)
			return i;

	int lc = 0;
	for (int i = 0; i < min(n, MAX); i++)
		if (sum(i) != lim)
			lc++;

	int ind = min(n, MAX);
	while (ind < n) {
		int tr = min(ind + SQ - 1, n - 1);
		vector<int> res = assk(tr);
		if (res[0] + res[1] == lim && lc == res[0]) {
			ind = ind + SQ;	
			continue;
		}

		int l = ind, r = min(ind + SQ - 1, n - 1);
		while (l < r) {
			int mid = (l + r) >> 1;
			vector<int> res = assk(mid);
			if (res[0] + res[1] < lim || res[0] > lc) r = mid;
			else l = mid + 1;

			if (!sum(mid)) return mid;
		}

		if (sum(l) == 0) return l;
		ind = l + 1;
		lc++;
	}

	return 0;
}

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