Submission #727685

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
727685	2023-04-21T06:01:23 Z	jwvg0425	The Big Prize (IOI17_prize)	C++17	20 / 100	97 ms	1188 KB

prize

#include <stdio.h>
#include <vector>
#include <queue>
#include <algorithm>
#include <iostream>
#include <string>
#include <bitset>
#include <map>
#include <set>
#include <tuple>
#include <string.h>
#include <math.h>
#include <random>
#include <functional>
#include <assert.h>
#include <math.h>
#include "prize.h"
#define all(x) (x).begin(), (x).end()
#define xx first
#define yy second

using namespace std;

template<typename T, typename Pr = less<T>>
using pq = priority_queue<T, vector<T>, Pr>;
using i64 = long long int;
using ii = pair<int, int>;
using ii64 = pair<i64, i64>; 

vector<ii> finded;
int bigSize;

random_device rd;
mt19937 mt(rd());
int outL, outR;

int cntl(int x)
{
	return upper_bound(all(finded), ii{ x, 1 << 30 }) - finded.begin() + outL;
}

int cntr(int x)
{
	return finded.end() - lower_bound(all(finded), ii{ x, -1 }) + outR;
}

bool test(int l, int r)
{
	if (l > r)
		return false;

	int m = (l + r) / 2;
	int ml = m;
	int mlL = 0, mlR = 0;

	while (ml >= l)
	{
		if (any_of(all(finded), [ml](ii x) { return x.xx == ml; }))
		{
			ml--;
			continue;
		}

		auto res = ask(ml);
		if (res[0] + res[1] != bigSize)
		{
			finded.insert(lower_bound(all(finded), ii{ ml, res[0] + res[1] }), ii{ ml, res[0] + res[1] });
			if (res[0] + res[1] == 0)
				return true;
			ml--;
		}
		else
		{
			mlL = res[0];
			mlR = res[1];
			break;
		}
	}

	if (ml > l && mlL != cntl(ml - 1))
		if (test(l, ml - 1))
			return true;

	if (m + 1 <= r && mlR - (m - ml) != cntr(m + 1))
		if (test(m + 1, r))
			return true;

	return false;
}

int find_best(int n)
{
	vector<int> indexs(n);
	for (int i = 0; i < n; i++)
		indexs[i] = i;

	shuffle(all(indexs), mt);
	vector<ii> ix;
	for (int i = 0; i < min(n, 30); i++)
	{
		auto q = ask(indexs[i]);
		ix.emplace_back(q[0] + q[1], indexs[i]);
	}

	sort(all(ix));

	bigSize = ix.back().xx;
	int bucket = 500;
	vector<int> bs;

	for (int i = 0; i < n; i += bucket)
		bs.push_back(i);

	shuffle(all(bs), mt);

	for (auto& bi : bs)
	{
		finded.clear();
		int l = bi, r = min(n - 1, bi + bucket - 1);

		while (l < r)
		{
			auto q = ask(l);
			if (q[0] + q[1] == 0)
				return l;

			if (q[0] + q[1] == bigSize)
			{
				outL = q[0];
				break;
			}

			l++;
		}

		while (l < r)
		{
			auto q = ask(r);
			if (q[0] + q[1] == 0)
				return r;

			if (q[0] + q[1] == bigSize)
			{
				outR = q[1];
				break;
			}

			r--;
		}

		// 한 개도 없는 구간 pass
		if (outL + outR == bigSize)
			continue;

		if (test(l + 1, r - 1))
		{
			for (auto& [k, v] : finded)
			{
				if (v == 0)
					return k;
			}
		}
	}

	return 0;
}

Subtask #1

20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	7 ms	1104 KB	Output is correct
2	Correct	9 ms	1052 KB	Output is correct
3	Correct	7 ms	1108 KB	Output is correct
4	Correct	7 ms	1072 KB	Output is correct
5	Correct	11 ms	1104 KB	Output is correct
6	Correct	6 ms	1088 KB	Output is correct
7	Correct	12 ms	1104 KB	Output is correct
8	Correct	7 ms	1072 KB	Output is correct
9	Correct	6 ms	1120 KB	Output is correct
10	Correct	11 ms	1108 KB	Output is correct

Subtask #2

0 / 80.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	8 ms	1176 KB	Output is correct
2	Correct	7 ms	1104 KB	Output is correct
3	Correct	6 ms	1116 KB	Output is correct
4	Correct	10 ms	1104 KB	Output is correct
5	Correct	12 ms	1068 KB	Output is correct
6	Correct	11 ms	1072 KB	Output is correct
7	Correct	11 ms	1072 KB	Output is correct
8	Correct	6 ms	1072 KB	Output is correct
9	Correct	10 ms	1064 KB	Output is correct
10	Correct	13 ms	1104 KB	Output is correct
11	Correct	10 ms	1076 KB	Output is correct
12	Correct	9 ms	1072 KB	Output is correct
13	Correct	7 ms	1104 KB	Output is correct
14	Correct	1 ms	336 KB	Output is correct
15	Correct	15 ms	1092 KB	Output is correct
16	Partially correct	48 ms	1072 KB	Partially correct - number of queries: 5377
17	Correct	14 ms	1076 KB	Output is correct
18	Correct	11 ms	1120 KB	Output is correct
19	Correct	45 ms	1104 KB	Output is correct
20	Correct	36 ms	688 KB	Output is correct
21	Partially correct	25 ms	1108 KB	Partially correct - number of queries: 5053
22	Correct	24 ms	1076 KB	Output is correct
23	Correct	9 ms	1052 KB	Output is correct
24	Correct	10 ms	1072 KB	Output is correct
25	Correct	22 ms	1100 KB	Output is correct
26	Correct	15 ms	1088 KB	Output is correct
27	Correct	8 ms	1104 KB	Output is correct
28	Correct	6 ms	1064 KB	Output is correct
29	Correct	39 ms	1072 KB	Output is correct
30	Correct	29 ms	1068 KB	Output is correct
31	Correct	54 ms	1076 KB	Output is correct
32	Correct	6 ms	1104 KB	Output is correct
33	Correct	1 ms	208 KB	Output is correct
34	Correct	19 ms	1072 KB	Output is correct
35	Correct	7 ms	1108 KB	Output is correct
36	Correct	36 ms	968 KB	Output is correct
37	Correct	16 ms	1072 KB	Output is correct
38	Correct	10 ms	1072 KB	Output is correct
39	Correct	13 ms	968 KB	Output is correct
40	Correct	31 ms	1104 KB	Output is correct
41	Partially correct	48 ms	976 KB	Partially correct - number of queries: 5378
42	Correct	20 ms	1064 KB	Output is correct
43	Correct	32 ms	1104 KB	Output is correct
44	Correct	36 ms	1104 KB	Output is correct
45	Correct	16 ms	1136 KB	Output is correct
46	Correct	46 ms	1068 KB	Output is correct
47	Correct	16 ms	1136 KB	Output is correct
48	Correct	6 ms	1100 KB	Output is correct
49	Correct	15 ms	1072 KB	Output is correct
50	Correct	18 ms	1100 KB	Output is correct
51	Partially correct	28 ms	1104 KB	Partially correct - number of queries: 5607
52	Correct	11 ms	1060 KB	Output is correct
53	Correct	12 ms	1080 KB	Output is correct
54	Correct	29 ms	1072 KB	Output is correct
55	Correct	17 ms	1104 KB	Output is correct
56	Partially correct	54 ms	1188 KB	Partially correct - number of queries: 5538
57	Correct	28 ms	1056 KB	Output is correct
58	Correct	9 ms	968 KB	Output is correct
59	Correct	29 ms	1076 KB	Output is correct
60	Correct	28 ms	1072 KB	Output is correct
61	Correct	9 ms	968 KB	Output is correct
62	Correct	7 ms	1068 KB	Output is correct
63	Correct	9 ms	1104 KB	Output is correct
64	Correct	7 ms	1112 KB	Output is correct
65	Correct	8 ms	976 KB	Output is correct
66	Correct	6 ms	1092 KB	Output is correct
67	Correct	16 ms	1104 KB	Output is correct
68	Correct	14 ms	1104 KB	Output is correct
69	Correct	7 ms	1072 KB	Output is correct
70	Correct	9 ms	1104 KB	Output is correct
71	Partially correct	45 ms	1100 KB	Partially correct - number of queries: 5045
72	Correct	10 ms	1104 KB	Output is correct
73	Correct	56 ms	1104 KB	Output is correct
74	Partially correct	53 ms	1104 KB	Partially correct - number of queries: 5016
75	Correct	13 ms	1096 KB	Output is correct
76	Correct	34 ms	1104 KB	Output is correct
77	Correct	48 ms	1104 KB	Output is correct
78	Correct	12 ms	1068 KB	Output is correct
79	Correct	25 ms	1072 KB	Output is correct
80	Correct	31 ms	1104 KB	Output is correct
81	Correct	28 ms	1104 KB	Output is correct
82	Correct	36 ms	1104 KB	Output is correct
83	Correct	10 ms	1104 KB	Output is correct
84	Correct	43 ms	1104 KB	Output is correct
85	Correct	47 ms	1104 KB	Output is correct
86	Incorrect	97 ms	1104 KB	Incorrect
87	Halted	0 ms	0 KB	-