oj.uz

Submission #1072450

# Submission time Handle Problem Language Result Execution time Memory
1072450 2024-08-23T19:19:35 Z Joshua_Andersson The Big Prize (IOI17_prize) C++14
20 / 100
 67 ms 1636 KB 
#include "prize.h"

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
const ll linf = ll(1e18);

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> p2;

#define rep(i, high) for (int i = 0; i < high; i++)
#define repp(i, low, high) for (int i = low; i < high; i++)
#define repe(i, container) for (auto& i : container)
#define sz(container) ((int)container.size())
#define all(x) begin(x),end(x)

#if _LOCAL
#define assert(x) if (!(x)) __debugbreak()
#endif

map<int, vi> cache;
vi q(int i)
{
	if (cache.find(i) != cache.end()) return cache[i];
	return cache[i] = ask(i);
}

int find_best(int n)
{
	int lollipop_cnt = 0;
	int i = 0;
	rep(i, 500)
	{
		vi res = q(i);
		ll s = res[0] + res[1];
		if (s==0)
		{
			return i;
		}
		// assume that i is second most common
		// then there are s^2 of type t[i], and s^4 of most common type
		assert(s <= 500);
		if (s*s*s*s>n)
		{
			lollipop_cnt = s;
			break;
		}
		lollipop_cnt = max(lollipop_cnt, (int)s);
		i++;
	}
	
	int jump = 220;
	while (true)
	{
		vi base = q(i);
		if (base[0]+base[1]==0)
		{
			return i;
		}
		
		if (base[0]+base[1]==lollipop_cnt)
		{
			if (i+ jump <n)
			{
				vi b2 = q(i + jump);
				if (b2 == base)
				{
					i += jump;
					continue;
				}
			}
			
			int lo = i;
			int hi = min(n, i+ jump);
			while (lo+1<hi)
			{
				int mid = (lo + hi) / 2;
				vi m = q(mid);
				if (m == base)
				{
					lo = mid;
				}
				else hi = mid;
			}
			i = hi;
		}
		else
		{
			i++;
		}
	}

	return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 344 KB Output is correct
2 Correct 4 ms 344 KB Output is correct
3 Correct 4 ms 600 KB Output is correct
4 Correct 6 ms 344 KB Output is correct
5 Correct 4 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 4 ms 344 KB Output is correct
8 Correct 4 ms 340 KB Output is correct
9 Correct 4 ms 344 KB Output is correct
10 Correct 8 ms 600 KB Output is correct

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 344 KB Output is correct
2 Correct 4 ms 344 KB Output is correct
3 Correct 4 ms 504 KB Output is correct
4 Correct 4 ms 340 KB Output is correct
5 Correct 3 ms 600 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 4 ms 344 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Correct 2 ms 344 KB Output is correct
10 Correct 6 ms 600 KB Output is correct
11 Correct 4 ms 600 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 7 ms 344 KB Output is correct
14 Correct 1 ms 600 KB Output is correct
15 Correct 5 ms 340 KB Output is correct
16 Correct 24 ms 844 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 29 ms 908 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 6 ms 600 KB Output is correct
21 Correct 9 ms 600 KB Output is correct
22 Correct 2 ms 344 KB Output is correct
23 Correct 3 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 13 ms 592 KB Output is correct
26 Correct 12 ms 600 KB Output is correct
27 Correct 3 ms 344 KB Output is correct
28 Correct 31 ms 732 KB Output is correct
29 Correct 15 ms 848 KB Output is correct
30 Correct 29 ms 896 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 5 ms 344 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 8 ms 344 KB Output is correct
35 Correct 4 ms 344 KB Output is correct
36 Correct 6 ms 520 KB Output is correct
37 Correct 2 ms 344 KB Output is correct
38 Correct 2 ms 344 KB Output is correct
39 Correct 15 ms 1064 KB Output is correct
40 Correct 19 ms 892 KB Output is correct
41 Correct 17 ms 848 KB Output is correct
42 Correct 9 ms 600 KB Output is correct
43 Correct 15 ms 724 KB Output is correct
44 Correct 11 ms 856 KB Output is correct
45 Correct 10 ms 600 KB Output is correct
46 Correct 0 ms 344 KB Output is correct
47 Correct 11 ms 600 KB Output is correct
48 Correct 24 ms 752 KB Output is correct
49 Correct 2 ms 344 KB Output is correct
50 Correct 34 ms 848 KB Output is correct
51 Correct 6 ms 856 KB Output is correct
52 Correct 1 ms 344 KB Output is correct
53 Correct 5 ms 536 KB Output is correct
54 Correct 7 ms 600 KB Output is correct
55 Correct 0 ms 344 KB Output is correct
56 Correct 23 ms 836 KB Output is correct
57 Correct 15 ms 848 KB Output is correct
58 Correct 21 ms 904 KB Output is correct
59 Correct 15 ms 592 KB Output is correct
60 Correct 12 ms 600 KB Output is correct
61 Correct 7 ms 600 KB Output is correct
62 Correct 2 ms 448 KB Output is correct
63 Correct 6 ms 344 KB Output is correct
64 Correct 4 ms 344 KB Output is correct
65 Correct 5 ms 344 KB Output is correct
66 Correct 8 ms 344 KB Output is correct
67 Correct 5 ms 344 KB Output is correct
68 Correct 1 ms 344 KB Output is correct
69 Correct 7 ms 344 KB Output is correct
70 Correct 4 ms 344 KB Output is correct
71 Correct 27 ms 848 KB Output is correct
72 Correct 7 ms 344 KB Output is correct
73 Correct 23 ms 1008 KB Output is correct
74 Correct 23 ms 856 KB Output is correct
75 Correct 6 ms 344 KB Output is correct
76 Correct 17 ms 796 KB Output is correct
77 Correct 24 ms 916 KB Output is correct
78 Correct 5 ms 344 KB Output is correct
79 Correct 10 ms 600 KB Output is correct
80 Correct 31 ms 848 KB Output is correct
81 Correct 26 ms 1144 KB Output is correct
82 Correct 20 ms 848 KB Output is correct
83 Correct 4 ms 344 KB Output is correct
84 Correct 17 ms 1104 KB Output is correct
85 Correct 37 ms 904 KB Output is correct
86 Incorrect 67 ms 1636 KB Incorrect
87 Halted 0 ms 0 KB -