제출 #807237

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

prize

#include "prize.h"
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,fma")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

/* DEFINES */
#define S second
#define F first
#define ll long long
#define ull unsigned long long
#define ld long double
#define npos ULLONG_MAX
#define INF LLONG_MAX
#define vv(a) vector<a>
#define pp(a, b) pair<a, b>
#define pq(a) priority_queue<a>
#define qq(a) queue<a>
#define ss(a) set<a>
#define mm(a, b) map<a, b>
#define ump(a, b) unordered_map<a, b>
#define ANDROID                   \
	ios_base::sync_with_stdio(0); \
	cin.tie(0);                   \
	cout.tie(0);
#define elif else if
#define endl "\n"
#define allc(a) begin(a), end(a)
#define all(a) a, a + sizeof(a) / sizeof(a[0])
#define pb push_back
#define logi(a) __lg(a)
#define sqrt(a) sqrtl(a)
#define mpr make_pair
#define ins insert
using namespace std;
using namespace __gnu_pbds;
using namespace __cxx11;
typedef char chr;
typedef basic_string<chr> str;
template <typename T, typename key = less<T>>
using ordered_set = tree<T, null_type, key, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mm(ll, vv(int)) mp;
vv(int) query(ll x)
{
	if (mp.count(x))
		return mp[x];
	return mp[x] = ask(x);
}
int find_best(int n)
{
	if (n <= 5000)
	{
		for (int i = 0; i < n; i++)
		{
			std::vector<int> res = query(i);
			if (res[0] + res[1] == 0)
				return i;
		}
	}
	pp(ll, ll) mx = mpr(-INF, -INF);
	ll spartak5678 = 20, ind, l, r, mid;
	vv(int) tmp, tmp1;
	while (spartak5678--)
	{
		ll i = rng() % n;
		tmp = query(i);
		// cout << i << " ";
		mx = max(mx, mpr(0ll + tmp[0] + tmp[1], i));
	}
	ind = mx.S;
	// cout << ind << " ";
	while (ind > 0)
	{
		while (ind >= 0)
		{
			tmp = query(ind);
			if (tmp[0] + tmp[1] == mx.F)
				break;
			if (tmp[0] + tmp[1] == 0)
				return ind;
			ind--;
		}
		if (ind <= 0)
			break;
		l = 0, r = ind - 1;
		tmp1 = query(ind);
		while (l <= r)
		{
			mid = (l + r) >> 1;
			tmp = query(mid);
			if (tmp[0] + tmp[1] == 0)	return mid;
			if (tmp[0] < tmp1[0])
				l = mid + 1;
			else
				r = mid - 1;
		}
		ind = --l;
	}
	ind = mx.S;
	while (ind < n)
	{
		while (ind < n)
		{
			tmp = query(ind);
			if (tmp[0] + tmp[1] == mx.F)
				break;
			if (tmp[0] + tmp[1] == 0)
				return ind;
			ind++;
		}
		l = ind + 1, r = n - 1;
		tmp1 = query(ind);
		while (l <= r)
		{
			mid = (l + r) >> 1;
			tmp = query(mid);
			if (tmp[0] + tmp[1] == 0)	return mid;
			if (tmp[1] < tmp1[1])
				r = mid - 1;
			else
				l = mid + 1;
		}
		ind = ++r;
	}
	return 0;
}

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