답안 #148213

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
148213 2019-08-31T17:39:43 Z faremy 커다란 상품 (IOI17_prize) C++14
100 / 100
49 ms 6008 KB
#include "prize.h"


const int MAXN = 2e5 + 1;

std::vector<int> ans[MAXN];

bool off[MAXN];
int countOff[MAXN];


void add(int i)
{
	while (i <= MAXN)
	{
		countOff[i]++;
		i += i & (-i);
	}
}

int sum(int i)
{
	int res = 0;
	while (i > 0)
	{
		res += countOff[i];
		i -= i & (-i);
	}

	return res;
}

int searchgood(std::vector<int> space, int non)
{
	if (space.empty())
		return -1;
	int middle = space[space.size() / 2];

	std::vector<int> a = ask(middle);
	if (a[0] + a[1] == 0)
		return middle;

	if (a[0] + a[1] != non)
	{
		off[middle] = true;
		add(middle + 1);
		return -1;
	}

	if (a[0] - sum(middle) != 0)
		return searchgood(std::vector<int>(space.begin(), space.begin() + space.size() / 2), non);
	return searchgood(std::vector<int>(space.begin() + space.size() / 2 + 1, space.end()), non);
}

int find_best(int n)
{
	if (n < 474)
	{
		for (int i = 0; i < n; i++)
			if (ask(i)[0] + ask(i)[1] == 0)
				return i;
		return -1;
	}

	int step = n / 474;
	int nonLollipop = 0;

	for (int iBlock = 0; iBlock < n; iBlock += step)
	{
		ans[iBlock] = ask(std::min(iBlock + step, n) - 1);
		nonLollipop = std::max(nonLollipop, ans[iBlock][0] + ans[iBlock][1]);
	}

	int done = 0;
	for (int iBlock = 0; iBlock < n; iBlock += step)
	{
		int end = std::min(iBlock + step, n) - 1;
		int idk = 0;
		
		while (end != iBlock && ans[iBlock][0] + ans[iBlock][1] != nonLollipop)
		{
			if (ans[iBlock][0] + ans[iBlock][1] == 0)
				return end;

			off[end] = true;
			add(end + 1);
			idk++;

			end--;
			ans[iBlock] = ask(end);
		}
		
		if (end == iBlock)
		{
			if (ans[iBlock][0] + ans[iBlock][1] == 0)
				return iBlock;
			if (ans[iBlock][0] + ans[iBlock][1] != nonLollipop)
				idk++;
			done += idk;
			continue;
		}

		while (ans[iBlock][0] > done)
		{
			std::vector<int> sspace;
			for (int iBox = iBlock; iBox < end; iBox++)
				if (!off[iBox])
					sspace.emplace_back(iBox);

			int pos = searchgood(sspace, nonLollipop);
			if (pos != -1)
				return pos;
			done++;
		}

		done += idk;
	}

	return -1;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 5028 KB Output is correct
2 Correct 9 ms 5140 KB Output is correct
3 Correct 11 ms 5032 KB Output is correct
4 Correct 9 ms 5032 KB Output is correct
5 Correct 9 ms 5028 KB Output is correct
6 Correct 10 ms 5012 KB Output is correct
7 Correct 10 ms 5036 KB Output is correct
8 Correct 9 ms 5032 KB Output is correct
9 Correct 10 ms 5016 KB Output is correct
10 Correct 10 ms 5112 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 5032 KB Output is correct
2 Correct 11 ms 5052 KB Output is correct
3 Correct 9 ms 5036 KB Output is correct
4 Correct 11 ms 5020 KB Output is correct
5 Correct 9 ms 5048 KB Output is correct
6 Correct 11 ms 5012 KB Output is correct
7 Correct 9 ms 5148 KB Output is correct
8 Correct 10 ms 4984 KB Output is correct
9 Correct 9 ms 5028 KB Output is correct
10 Correct 9 ms 5028 KB Output is correct
11 Correct 10 ms 5192 KB Output is correct
12 Correct 11 ms 5024 KB Output is correct
13 Correct 11 ms 5368 KB Output is correct
14 Correct 9 ms 5028 KB Output is correct
15 Correct 12 ms 5076 KB Output is correct
16 Correct 28 ms 5796 KB Output is correct
17 Correct 9 ms 5028 KB Output is correct
18 Correct 31 ms 6000 KB Output is correct
19 Correct 12 ms 5032 KB Output is correct
20 Correct 21 ms 5152 KB Output is correct
21 Correct 27 ms 5292 KB Output is correct
22 Correct 14 ms 5156 KB Output is correct
23 Correct 10 ms 5024 KB Output is correct
24 Correct 12 ms 5032 KB Output is correct
25 Correct 21 ms 5508 KB Output is correct
26 Correct 21 ms 5488 KB Output is correct
27 Correct 11 ms 5024 KB Output is correct
28 Correct 31 ms 5868 KB Output is correct
29 Correct 27 ms 5860 KB Output is correct
30 Correct 49 ms 5944 KB Output is correct
31 Correct 9 ms 5028 KB Output is correct
32 Correct 10 ms 5236 KB Output is correct
33 Correct 6 ms 4904 KB Output is correct
34 Correct 16 ms 5328 KB Output is correct
35 Correct 9 ms 5112 KB Output is correct
36 Correct 17 ms 5240 KB Output is correct
37 Correct 9 ms 5100 KB Output is correct
38 Correct 12 ms 5012 KB Output is correct
39 Correct 26 ms 5396 KB Output is correct
40 Correct 39 ms 5944 KB Output is correct
41 Correct 29 ms 5584 KB Output is correct
42 Correct 22 ms 5580 KB Output is correct
43 Correct 20 ms 5592 KB Output is correct
44 Correct 26 ms 5400 KB Output is correct
45 Correct 16 ms 5312 KB Output is correct
46 Correct 9 ms 5028 KB Output is correct
47 Correct 19 ms 5444 KB Output is correct
48 Correct 27 ms 5664 KB Output is correct
49 Correct 13 ms 5120 KB Output is correct
50 Correct 30 ms 6008 KB Output is correct
51 Correct 27 ms 5396 KB Output is correct
52 Correct 9 ms 5024 KB Output is correct
53 Correct 13 ms 5112 KB Output is correct
54 Correct 18 ms 5444 KB Output is correct
55 Correct 9 ms 5032 KB Output is correct
56 Correct 31 ms 6008 KB Output is correct
57 Correct 41 ms 5716 KB Output is correct
58 Correct 32 ms 5660 KB Output is correct
59 Correct 35 ms 5544 KB Output is correct
60 Correct 23 ms 5496 KB Output is correct
61 Correct 12 ms 5152 KB Output is correct
62 Correct 9 ms 5036 KB Output is correct
63 Correct 9 ms 5116 KB Output is correct
64 Correct 9 ms 5036 KB Output is correct
65 Correct 10 ms 5024 KB Output is correct
66 Correct 11 ms 5148 KB Output is correct
67 Correct 9 ms 5032 KB Output is correct
68 Correct 11 ms 5072 KB Output is correct
69 Correct 11 ms 5028 KB Output is correct
70 Correct 14 ms 5028 KB Output is correct
71 Correct 36 ms 5964 KB Output is correct
72 Correct 11 ms 5172 KB Output is correct
73 Correct 34 ms 5964 KB Output is correct
74 Correct 34 ms 5968 KB Output is correct
75 Correct 12 ms 5032 KB Output is correct
76 Correct 38 ms 5996 KB Output is correct
77 Correct 35 ms 5916 KB Output is correct
78 Correct 11 ms 5148 KB Output is correct
79 Correct 30 ms 5884 KB Output is correct
80 Correct 33 ms 5968 KB Output is correct
81 Correct 39 ms 5932 KB Output is correct
82 Correct 31 ms 5924 KB Output is correct
83 Correct 10 ms 5016 KB Output is correct
84 Correct 36 ms 5884 KB Output is correct
85 Correct 32 ms 5920 KB Output is correct
86 Correct 12 ms 5660 KB Output is correct
87 Correct 9 ms 5044 KB Output is correct
88 Correct 18 ms 5672 KB Output is correct
89 Correct 17 ms 5676 KB Output is correct
90 Correct 9 ms 5024 KB Output is correct
91 Correct 14 ms 5528 KB Output is correct
92 Correct 18 ms 5624 KB Output is correct
93 Correct 19 ms 5924 KB Output is correct
94 Correct 14 ms 5944 KB Output is correct
95 Correct 13 ms 5960 KB Output is correct
96 Correct 19 ms 5968 KB Output is correct
97 Correct 17 ms 5920 KB Output is correct