Submission #790724

#	Time	Username	Problem	Language	Result	Execution time	Memory
790724		Sohsoh84	The Big Prize (IOI17_prize)	C++17	90.02 / 100	50 ms	336 KiB

prize

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

using namespace std;

const int MAX = 500; // CHANGE
const int SQ = 256;

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

int n;

inline int sum(int ind) {
	vector<int> res = ask(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();
	
	int lc = 0;
	int ind = 0;
	while (ind < n) {
		int tr = min(ind + SQ - 1, n - 1);
		vector<int> res = ask(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 = ask(mid);	
			if (res[0] + res[1] < lim || res[0] > lc) r = mid;
			else l = mid + 1;
		}

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

	return 0;
}

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