oj.uz

Submission #148205

# Submission time Handle Problem Language Result Execution time Memory
148205 2019-08-31T17:22:46 Z faremy The Big Prize (IOI17_prize) C++14
20 / 100
 59 ms 6120 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);
		int idk = 0;
		
		while (end != iBlock && ans[iBlock][0] + ans[iBlock][1] != nonLollipop)
		{
			if (ans[iBlock][0] + ans[iBlock][1] == 0)
				return end - 1;

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

			end--;
			ans[iBlock] = ask(end - 1);
		}
		
		if (end == iBlock)
		{
			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;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 4984 KB Output is correct
2 Correct 13 ms 4984 KB Output is correct
3 Correct 11 ms 4984 KB Output is correct
4 Correct 9 ms 5108 KB Output is correct
5 Correct 11 ms 5032 KB Output is correct
6 Correct 9 ms 5108 KB Output is correct
7 Correct 9 ms 5028 KB Output is correct
8 Correct 11 ms 5008 KB Output is correct
9 Correct 12 ms 4984 KB Output is correct
10 Correct 12 ms 5032 KB Output is correct

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 5112 KB Output is correct
2 Correct 12 ms 4984 KB Output is correct
3 Correct 10 ms 5032 KB Output is correct
4 Correct 11 ms 5112 KB Output is correct
5 Correct 9 ms 5128 KB Output is correct
6 Correct 11 ms 4984 KB Output is correct
7 Correct 12 ms 4984 KB Output is correct
8 Correct 12 ms 4984 KB Output is correct
9 Correct 9 ms 5128 KB Output is correct
10 Correct 10 ms 5112 KB Output is correct
11 Correct 13 ms 5112 KB Output is correct
12 Correct 12 ms 4984 KB Output is correct
13 Correct 13 ms 5496 KB Output is correct
14 Correct 13 ms 5112 KB Output is correct
15 Correct 16 ms 5112 KB Output is correct
16 Correct 40 ms 5848 KB Output is correct
17 Correct 10 ms 5028 KB Output is correct
18 Correct 47 ms 6092 KB Output is correct
19 Correct 10 ms 4984 KB Output is correct
20 Correct 19 ms 5164 KB Output is correct
21 Correct 25 ms 5288 KB Output is correct
22 Correct 17 ms 5112 KB Output is correct
23 Correct 11 ms 4984 KB Output is correct
24 Correct 9 ms 5028 KB Output is correct
25 Correct 20 ms 5504 KB Output is correct
26 Correct 35 ms 5496 KB Output is correct
27 Correct 11 ms 4984 KB Output is correct
28 Correct 53 ms 5948 KB Output is correct
29 Correct 36 ms 5984 KB Output is correct
30 Correct 59 ms 6008 KB Output is correct
31 Correct 11 ms 4984 KB Output is correct
32 Correct 10 ms 5344 KB Output is correct
33 Correct 6 ms 4984 KB Output is correct
34 Correct 22 ms 5368 KB Output is correct
35 Correct 13 ms 5112 KB Output is correct
36 Correct 13 ms 5332 KB Output is correct
37 Correct 12 ms 5112 KB Output is correct
38 Correct 12 ms 5112 KB Output is correct
39 Correct 19 ms 5492 KB Output is correct
40 Correct 37 ms 6100 KB Output is correct
41 Correct 28 ms 5552 KB Output is correct
42 Correct 33 ms 5540 KB Output is correct
43 Correct 35 ms 5496 KB Output is correct
44 Correct 18 ms 5404 KB Output is correct
45 Correct 27 ms 5292 KB Output is correct
46 Correct 13 ms 4984 KB Output is correct
47 Correct 19 ms 5456 KB Output is correct
48 Correct 38 ms 5624 KB Output is correct
49 Correct 15 ms 5112 KB Output is correct
50 Correct 53 ms 6008 KB Output is correct
51 Correct 27 ms 5368 KB Output is correct
52 Correct 9 ms 5128 KB Output is correct
53 Correct 11 ms 5112 KB Output is correct
54 Correct 24 ms 5416 KB Output is correct
55 Correct 13 ms 4984 KB Output is correct
56 Correct 32 ms 6120 KB Output is correct
57 Correct 31 ms 5680 KB Output is correct
58 Correct 38 ms 5736 KB Output is correct
59 Correct 32 ms 5496 KB Output is correct
60 Correct 33 ms 5568 KB Output is correct
61 Correct 13 ms 5112 KB Output is correct
62 Correct 9 ms 5028 KB Output is correct
63 Correct 24 ms 5284 KB Output is correct
64 Correct 10 ms 5112 KB Output is correct
65 Correct 10 ms 5128 KB Output is correct
66 Correct 16 ms 5112 KB Output is correct
67 Correct 12 ms 4984 KB Output is correct
68 Incorrect 16 ms 5112 KB Integer -1 violates the range [0, 199999]
69 Halted 0 ms 0 KB -