oj.uz

Submission #727706

# Submission time Handle Problem Language Result Execution time Memory
727706 2023-04-21T06:33:14 Z jwvg0425 The Big Prize (IOI17_prize) C++17
90 / 100
 83 ms 1232 KB 
#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;
	vector<ii> ix;
	for (int i = 0; i < min(n, 1000); i++)
	{
		auto q = ask(indexs[i]);
		if (q[0] + q[1] == 0)
			return i;

		ix.emplace_back(q[0] + q[1], indexs[i]);
	}

	sort(all(ix));

	bigSize = ix.back().xx;
	int bucket = 100;
	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 24 ms 1104 KB Output is correct
2 Correct 39 ms 1068 KB Output is correct
3 Correct 42 ms 1104 KB Output is correct
4 Correct 18 ms 1124 KB Output is correct
5 Correct 12 ms 1116 KB Output is correct
6 Correct 1 ms 1104 KB Output is correct
7 Correct 34 ms 1104 KB Output is correct
8 Correct 5 ms 1132 KB Output is correct
9 Correct 22 ms 1104 KB Output is correct
10 Correct 36 ms 1104 KB Output is correct

Subtask #2
70.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 1116 KB Output is correct
2 Correct 12 ms 1072 KB Output is correct
3 Correct 35 ms 1092 KB Output is correct
4 Correct 18 ms 1108 KB Output is correct
5 Correct 17 ms 1104 KB Output is correct
6 Correct 1 ms 1068 KB Output is correct
7 Correct 22 ms 1104 KB Output is correct
8 Correct 17 ms 1124 KB Output is correct
9 Correct 24 ms 1072 KB Output is correct
10 Correct 31 ms 1120 KB Output is correct
11 Correct 16 ms 1052 KB Output is correct
12 Correct 20 ms 1100 KB Output is correct
13 Correct 45 ms 1096 KB Output is correct
14 Correct 18 ms 336 KB Output is correct
15 Correct 18 ms 1120 KB Output is correct
16 Correct 33 ms 1112 KB Output is correct
17 Correct 4 ms 1068 KB Output is correct
18 Partially correct 56 ms 1096 KB Partially correct - number of queries: 6998
19 Correct 5 ms 1096 KB Output is correct
20 Correct 35 ms 712 KB Output is correct
21 Partially correct 29 ms 1120 KB Partially correct - number of queries: 7014
22 Partially correct 49 ms 1104 KB Partially correct - number of queries: 5322
23 Correct 11 ms 1100 KB Output is correct
24 Correct 11 ms 1116 KB Output is correct
25 Partially correct 41 ms 1104 KB Partially correct - number of queries: 5350
26 Correct 25 ms 1072 KB Output is correct
27 Correct 18 ms 1104 KB Output is correct
28 Partially correct 50 ms 1100 KB Partially correct - number of queries: 6179
29 Correct 30 ms 1072 KB Output is correct
30 Correct 29 ms 1104 KB Output is correct
31 Correct 3 ms 1072 KB Output is correct
32 Correct 25 ms 1096 KB Output is correct
33 Correct 1 ms 208 KB Output is correct
34 Correct 38 ms 1112 KB Output is correct
35 Correct 19 ms 1104 KB Output is correct
36 Correct 35 ms 1108 KB Output is correct
37 Correct 14 ms 1100 KB Output is correct
38 Correct 43 ms 1088 KB Output is correct
39 Correct 27 ms 1072 KB Output is correct
40 Correct 36 ms 1100 KB Output is correct
41 Correct 23 ms 1232 KB Output is correct
42 Correct 19 ms 1116 KB Output is correct
43 Correct 19 ms 1124 KB Output is correct
44 Correct 20 ms 1100 KB Output is correct
45 Partially correct 60 ms 1104 KB Partially correct - number of queries: 5844
46 Correct 5 ms 1104 KB Output is correct
47 Partially correct 53 ms 1104 KB Partially correct - number of queries: 5537
48 Correct 42 ms 1068 KB Output is correct
49 Correct 50 ms 1096 KB Output is correct
50 Partially correct 75 ms 1104 KB Partially correct - number of queries: 7564
51 Correct 17 ms 1156 KB Output is correct
52 Correct 23 ms 1104 KB Output is correct
53 Correct 30 ms 1104 KB Output is correct
54 Correct 17 ms 1052 KB Output is correct
55 Correct 3 ms 1068 KB Output is correct
56 Partially correct 30 ms 1124 KB Partially correct - number of queries: 5993
57 Correct 12 ms 1072 KB Output is correct
58 Correct 23 ms 1072 KB Output is correct
59 Correct 15 ms 1104 KB Output is correct
60 Partially correct 40 ms 1096 KB Partially correct - number of queries: 5408
61 Correct 13 ms 1104 KB Output is correct
62 Correct 46 ms 1068 KB Output is correct
63 Correct 36 ms 1104 KB Output is correct
64 Correct 38 ms 1052 KB Output is correct
65 Correct 25 ms 1068 KB Output is correct
66 Correct 30 ms 1104 KB Output is correct
67 Correct 34 ms 1068 KB Output is correct
68 Correct 4 ms 968 KB Output is correct
69 Correct 14 ms 1156 KB Output is correct
70 Partially correct 34 ms 1060 KB Partially correct - number of queries: 5115
71 Partially correct 77 ms 1104 KB Partially correct - number of queries: 8284
72 Partially correct 22 ms 1124 KB Partially correct - number of queries: 5232
73 Partially correct 83 ms 1104 KB Partially correct - number of queries: 8183
74 Partially correct 57 ms 1120 KB Partially correct - number of queries: 7648
75 Correct 50 ms 1104 KB Output is correct
76 Partially correct 76 ms 1120 KB Partially correct - number of queries: 7742
77 Partially correct 60 ms 1112 KB Partially correct - number of queries: 7813
78 Partially correct 48 ms 1104 KB Partially correct - number of queries: 5004
79 Partially correct 59 ms 1112 KB Partially correct - number of queries: 6337
80 Partially correct 56 ms 1124 KB Partially correct - number of queries: 7923
81 Partially correct 74 ms 1104 KB Partially correct - number of queries: 7524
82 Partially correct 78 ms 1112 KB Partially correct - number of queries: 7831
83 Correct 38 ms 1104 KB Output is correct
84 Partially correct 58 ms 1104 KB Partially correct - number of queries: 7020
85 Partially correct 75 ms 1108 KB Partially correct - number of queries: 7712
86 Correct 46 ms 1108 KB Output is correct
87 Correct 43 ms 1104 KB Output is correct
88 Correct 43 ms 1104 KB Output is correct
89 Partially correct 41 ms 1104 KB Partially correct - number of queries: 5414
90 Correct 38 ms 1104 KB Output is correct
91 Correct 34 ms 1116 KB Output is correct
92 Correct 38 ms 1120 KB Output is correct
93 Partially correct 52 ms 1104 KB Partially correct - number of queries: 5209
94 Partially correct 31 ms 1104 KB Partially correct - number of queries: 5232
95 Partially correct 49 ms 1116 KB Partially correct - number of queries: 5457
96 Partially correct 50 ms 1112 KB Partially correct - number of queries: 5051
97 Correct 31 ms 1120 KB Output is correct