답안 #1063515

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1063515 2024-08-17T19:44:55 Z fv3 커다란 상품 (IOI17_prize) C++14
100 / 100
38 ms 3928 KB
#include "prize.h"
#include <bits/stdc++.h>

using namespace std;

vector<int> st;
int nt = 1;

int get_range(int l, int r, int k, int x, int y)
{
	if (x > r || y < l) return 0;
	if (x >= l && y <= r) return st[k];
	int c = (x + y) / 2;
	return get_range(l, r, k*2, x, c) + get_range(l, r, k*2|1, c+1, y);
}

void add(int index)
{
	st[nt + index] = 1;
	for (int i = (nt + index) / 2; i >= 1; i /= 2)
		st[i] = st[i*2] + st[i*2|1];
}

vector<int> parent;
int find(int index)
{
	if (!parent[index]) return index;
	return parent[index] = find(parent[index]);
}

int find_best(int n)
{
	parent = vector<int>(n);

	while (nt < n) nt <<= 1;
	st = vector<int>(2 * nt);

	map<int, int> m;
	m[n] = 2 * n;

	int mx_cnt = 1;
	int left_most = 0;
	while (1)
	{
		int r = n - 1;
		for (auto node : m)
		{
			if (node.second == -1 || node.first < left_most) continue; 
			if (node.second - get_range(0, node.first, 1, 0, nt - 1) > 0)
			{
				r = node.first - 1;
				break;
			}
			left_most = node.first + 1;
		}
		int l = left_most;

		// Find better left and right bounds

		while (1)
		{
			int c = (l + r) / 2;
			int index = find(c);

			if (index == n)
			{
				r = c - 1;
				continue;
			}

			auto val = ask(index);
			int cnt = val[0] + val[1]; 
			if (cnt == 0)
				return index;

			if (cnt > mx_cnt)
			{
				mx_cnt = cnt;
				for (auto&node : m)
				{
					if (node.second == -1 || node.first == n) continue;
					add(node.first);
					node.second = -1;
				}
				left_most = 0;
				m[index] = val[0];
				break;
			}

			if (cnt < mx_cnt)
			{
				parent[index] = index + 1;
				add(index);
				break;
			}

			if (val[0] == get_range(0, index, 1, 0, nt-1))
				l = c + 1;
			else
				r = c - 1;

			m[index] = val[0];
		}

	}
	return 0;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 3160 KB Output is correct
2 Correct 2 ms 3160 KB Output is correct
3 Correct 2 ms 3160 KB Output is correct
4 Correct 1 ms 3244 KB Output is correct
5 Correct 2 ms 3160 KB Output is correct
6 Correct 1 ms 3244 KB Output is correct
7 Correct 2 ms 3160 KB Output is correct
8 Correct 1 ms 3160 KB Output is correct
9 Correct 2 ms 3160 KB Output is correct
10 Correct 1 ms 3160 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3160 KB Output is correct
2 Correct 2 ms 3160 KB Output is correct
3 Correct 1 ms 3160 KB Output is correct
4 Correct 1 ms 3160 KB Output is correct
5 Correct 1 ms 3160 KB Output is correct
6 Correct 1 ms 3160 KB Output is correct
7 Correct 1 ms 3240 KB Output is correct
8 Correct 2 ms 3160 KB Output is correct
9 Correct 1 ms 3160 KB Output is correct
10 Correct 1 ms 3160 KB Output is correct
11 Correct 2 ms 3160 KB Output is correct
12 Correct 2 ms 3160 KB Output is correct
13 Correct 4 ms 3160 KB Output is correct
14 Correct 1 ms 600 KB Output is correct
15 Correct 4 ms 3160 KB Output is correct
16 Correct 21 ms 3396 KB Output is correct
17 Correct 2 ms 3160 KB Output is correct
18 Correct 32 ms 3564 KB Output is correct
19 Correct 1 ms 3160 KB Output is correct
20 Correct 5 ms 1880 KB Output is correct
21 Correct 7 ms 3160 KB Output is correct
22 Correct 4 ms 3160 KB Output is correct
23 Correct 1 ms 3160 KB Output is correct
24 Correct 1 ms 3160 KB Output is correct
25 Correct 11 ms 3160 KB Output is correct
26 Correct 13 ms 3572 KB Output is correct
27 Correct 2 ms 3160 KB Output is correct
28 Correct 20 ms 3160 KB Output is correct
29 Correct 16 ms 3408 KB Output is correct
30 Correct 27 ms 3416 KB Output is correct
31 Correct 1 ms 3160 KB Output is correct
32 Correct 2 ms 3160 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 8 ms 3504 KB Output is correct
35 Correct 3 ms 3160 KB Output is correct
36 Correct 4 ms 3160 KB Output is correct
37 Correct 2 ms 3160 KB Output is correct
38 Correct 2 ms 3160 KB Output is correct
39 Correct 9 ms 3160 KB Output is correct
40 Correct 24 ms 3408 KB Output is correct
41 Correct 13 ms 3356 KB Output is correct
42 Correct 15 ms 3556 KB Output is correct
43 Correct 15 ms 3364 KB Output is correct
44 Correct 9 ms 3416 KB Output is correct
45 Correct 6 ms 3160 KB Output is correct
46 Correct 2 ms 3160 KB Output is correct
47 Correct 9 ms 3160 KB Output is correct
48 Correct 18 ms 3160 KB Output is correct
49 Correct 3 ms 3160 KB Output is correct
50 Correct 21 ms 3408 KB Output is correct
51 Correct 8 ms 3160 KB Output is correct
52 Correct 2 ms 3160 KB Output is correct
53 Correct 2 ms 3160 KB Output is correct
54 Correct 13 ms 3344 KB Output is correct
55 Correct 2 ms 3160 KB Output is correct
56 Correct 30 ms 3452 KB Output is correct
57 Correct 24 ms 3392 KB Output is correct
58 Correct 13 ms 3160 KB Output is correct
59 Correct 22 ms 3588 KB Output is correct
60 Correct 13 ms 3160 KB Output is correct
61 Correct 2 ms 3416 KB Output is correct
62 Correct 1 ms 3160 KB Output is correct
63 Correct 3 ms 3160 KB Output is correct
64 Correct 2 ms 3160 KB Output is correct
65 Correct 1 ms 3248 KB Output is correct
66 Correct 3 ms 3160 KB Output is correct
67 Correct 3 ms 3288 KB Output is correct
68 Correct 2 ms 3160 KB Output is correct
69 Correct 4 ms 3160 KB Output is correct
70 Correct 3 ms 3160 KB Output is correct
71 Correct 29 ms 3388 KB Output is correct
72 Correct 4 ms 3296 KB Output is correct
73 Correct 38 ms 3920 KB Output is correct
74 Correct 26 ms 3652 KB Output is correct
75 Correct 2 ms 3160 KB Output is correct
76 Correct 23 ms 3668 KB Output is correct
77 Correct 20 ms 3408 KB Output is correct
78 Correct 3 ms 3160 KB Output is correct
79 Correct 13 ms 3160 KB Output is correct
80 Correct 29 ms 3332 KB Output is correct
81 Correct 26 ms 3416 KB Output is correct
82 Correct 33 ms 3928 KB Output is correct
83 Correct 2 ms 3160 KB Output is correct
84 Correct 16 ms 3408 KB Output is correct
85 Correct 25 ms 3396 KB Output is correct
86 Correct 5 ms 3420 KB Output is correct
87 Correct 1 ms 3160 KB Output is correct
88 Correct 4 ms 3160 KB Output is correct
89 Correct 4 ms 3160 KB Output is correct
90 Correct 1 ms 3160 KB Output is correct
91 Correct 3 ms 3160 KB Output is correct
92 Correct 3 ms 3160 KB Output is correct
93 Correct 3 ms 3160 KB Output is correct
94 Correct 3 ms 3156 KB Output is correct
95 Correct 2 ms 3160 KB Output is correct
96 Correct 2 ms 3160 KB Output is correct
97 Correct 1 ms 3160 KB Output is correct