Submission #936641

#	Time	Username	Problem	Language	Result	Execution time	Memory
936641		Ghetto	The Big Prize (IOI17_prize)	C++17	20 / 100	39 ms	960 KiB

prize

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

int n;

int v_sum;
int find_v_sum() {
	unordered_map<int, int> sum_freq;
	for (int i = 0; i < min(n, 900); i++) {
		vector<int> res = ask(i);
		sum_freq[res[0] + res[1]]++;
	}

	for (pii sf : sum_freq)
		if (sf.second >= min(n / 2, 450)) return sf.first;
	assert(true == false); 
}

bool is_v(int res_sum) {
	return res_sum == v_sum;
}

vector<int> append(vector<int> v1, vector<int> v2) {
	v1.insert(v1.end(), v2.begin(), v2.end());
	return v1;
}

int one;
vector<int> find_non_vs(int lo, int hi, int l, int r) {
	// cout << "CALL " << lo << " " << hi << " " << l << " " << r << endl;
	if (lo > hi) return {}; 

	vector<int> ans, res;
	int l_mid = (lo + hi) / 2, r_mid = (lo + hi) / 2;
	while (r_mid <= hi) {
		res = ask(r_mid);
		if (is_v(res[0] + res[1])) break;
		
		ans.push_back(r_mid);
		r_mid++;
	}
	if (r_mid == hi + 1) return append(ans, find_non_vs(lo, l_mid - 1, l, r + r_mid - l_mid));

	int l_size = res[0] - l - (r_mid - l_mid);
	int r_size = res[1] - r;
	// cout << "DETAILS " << l_mid << " " << r_mid << " " << l_size << " " << r_size << endl;
	assert(min(l_size, r_size) >= 0);	

	if (l_size == 0 && r_size == 0) return ans;
	else if (l_size == 0) return append(ans, find_non_vs(r_mid + 1, hi, l + r_mid - l_mid, r));
	else if (r_size == 0) return append(ans, find_non_vs(lo, l_mid - 1, l, r + r_mid - l_mid));
	else {
		vector<int> l_ans = find_non_vs(lo, l_mid - 1, l, r + r_size + r_mid - l_mid);
		vector<int> r_ans = find_non_vs(r_mid + 1, hi, l + l_size + r_mid - l_mid, r);
		return append(ans, append(l_ans, r_ans));
	}
}

int find_best(int tmp_n) {
	n = tmp_n;

	v_sum = find_v_sum();

	vector<int> non_vs = find_non_vs(0, n - 1, 0, 0);
	for (int non_v : non_vs) {
		vector<int> res = ask(non_v);
		if (res[0] + res[1] == 0) return non_v;
	}
	assert(true == false);
}

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