Submission #249849

#	Time	Username	Problem	Language	Result	Execution time	Memory
249849		srvlt	커다란 상품 (IOI17_prize)	C++14	90 / 100	95 ms	5628 KiB

prize

#include "prize.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define ld long double
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define SZ(x) (int)(x).size()
template <typename T> using ord_set = tree <T, null_type, less <T>, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

vector <int> a[200003];
int N, mx = -1, val = -1, cur = -1, have = 0;
int flag = -1;

int find_next() {
	int l = cur, r = N;
	while (l < r - 1) {
		int mid = l + r >> 1;
		if (a[mid].empty()) a[mid] = ask(mid);
		if (a[mid][0] + a[mid][1] == val && a[mid][0] == have) l = mid;
		else r = mid;
		if (a[mid][0] == 0 && a[mid][1] == 0) flag = mid;
	}
	assert(r != N);
	return r;
}

int find_best(int n) {
	N = n;
	for (int i = 0; i < min(n, 500); i++) {
		a[i] = ask(i);
		if (a[i][0] == 0 && a[i][1] == 0) return i;
		if (mx == -1 || val < a[i][0] + a[i][1]) {
			mx = i, val = a[i][0] + a[i][1];
		}
	}
	int last = -1;
	for (int i = 500; i < n; i += 500) {
		if (a[i].empty()) a[i] = ask(i);
		if (a[i][0] + a[i][1] == val) {
			if (last != -1) {
				if ((a[i][0] - a[last][0]) * log2(n - last) > (i - last)) {
					for (int j = last + 1; j < i; j++) {
						if (a[i].empty()) a[i] = ask(i);
					}
				}
			}
			last = i;
		}
	}
	while (true) {
		cur = find_next();
		if (flag != -1) return flag;
		have++;
		if (a[cur][0] == 0 && a[cur][1] == 0) return cur;
	}
}

Compilation message (stderr)

prize.cpp: In function 'int find_next()':
prize.cpp:22:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   int mid = l + r >> 1;
             ~~^~~

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