Submission #54235

# Submission time Handle Problem Language Result Execution time Memory
54235 2018-07-02T21:31:05 Z radoslav11 The Big Prize (IOI17_prize) C++14
97.6 / 100
116 ms 31676 KB
#include <bits/stdc++.h>
#include "prize.h"
//#include "Lgrader.cpp"

using namespace std;
template<class T, class T2> inline int chkmax(T &x, const T2 &y) { return x < y ? x = y, 1 : 0; }
template<class T, class T2> inline int chkmin(T &x, const T2 &y) { return x > y ? x = y, 1 : 0; }
const int MAXN = (1 << 20);

vector<int> memo[MAXN];
int Q = 0;
bool stop;
bool dummy[MAXN];

vector<int> query(int i) 
{
	if(!memo[i].empty()) return memo[i];
	if(stop || dummy[i]) return vector<int>(2, 1e9);
	
	memo[i] = ask(i), Q++;
	if(Q == 10000) assert(false);
	return memo[i];
}

int n;

void rec(int l, int r)
{
	if(r < l) return;

	if(query(l - 1)[0] + query(l - 1)[1] == 0) stop = 1;	
	if(query(r + 1)[0] + query(r + 1)[1] == 0) stop = 1;

	if(query(l - 1)[0] == 0)
		for(int p = l - 2; p >= 0; p--)
		{
			if(dummy[p]) break;
			dummy[p] = 1;
		}

	if(query(r + 1)[1] == 0)
		for(int p = r + 2; p < n; p++)
		{
			if(dummy[p]) break;
			dummy[p] = 1;
		}

	if(query(r + 1)[0] == 0)
		for(int p = r; p >= 0; p--)
		{
			if(dummy[p]) break;
			dummy[p] = 1;
		}
	
	if(query(l - 1)[1] == 0)
		for(int p = l; p < n; p++)
		{
			if(dummy[p]) break;
			dummy[p] = 1;
		}
	
	if(query(l - 1) == query(r + 1))
	{
		for(int i = l; i <= r; i++)
			memo[i] = query(l - 1);
		return;
	}

	int mid = (l + r) >> 1; 
	if(query(mid)[0] + query(mid)[1] == 0) stop = 1;
	if(query(l - 1) == query(mid))
		for(int i = l; i < mid; i++)
			memo[i] = query(mid);
	else
		rec(l, mid - 1);

	if(query(mid) == query(r + 1))
		for(int i = mid + 1; i <= r; i++)
			memo[i] = query(mid);
	else
		rec(mid + 1, r);
}

int find_best(int n) 
{	
	::n = n;
	rec(1, n - 2);
	for(int i = 0; i < n; i++)
		if(query(i)[0] + query(i)[1] == 0)
			return i;

	return -1;
}
# Verdict Execution time Memory Grader output
1 Correct 41 ms 31352 KB Output is correct
2 Correct 50 ms 31440 KB Output is correct
3 Correct 66 ms 31440 KB Output is correct
4 Correct 55 ms 31540 KB Output is correct
5 Correct 50 ms 31616 KB Output is correct
6 Correct 44 ms 31640 KB Output is correct
7 Correct 48 ms 31648 KB Output is correct
8 Correct 49 ms 31648 KB Output is correct
9 Correct 46 ms 31648 KB Output is correct
10 Correct 55 ms 31648 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 40 ms 31676 KB Output is correct
2 Correct 47 ms 31676 KB Output is correct
3 Correct 47 ms 31676 KB Output is correct
4 Correct 54 ms 31676 KB Output is correct
5 Correct 46 ms 31676 KB Output is correct
6 Correct 36 ms 31676 KB Output is correct
7 Correct 48 ms 31676 KB Output is correct
8 Correct 46 ms 31676 KB Output is correct
9 Correct 47 ms 31676 KB Output is correct
10 Correct 56 ms 31676 KB Output is correct
11 Correct 46 ms 31676 KB Output is correct
12 Correct 38 ms 31676 KB Output is correct
13 Correct 56 ms 31676 KB Output is correct
14 Correct 26 ms 31676 KB Output is correct
15 Correct 44 ms 31676 KB Output is correct
16 Correct 89 ms 31676 KB Output is correct
17 Correct 35 ms 31676 KB Output is correct
18 Partially correct 106 ms 31676 KB Partially correct - number of queries: 5058
19 Correct 37 ms 31676 KB Output is correct
20 Correct 43 ms 31676 KB Output is correct
21 Correct 62 ms 31676 KB Output is correct
22 Correct 40 ms 31676 KB Output is correct
23 Correct 38 ms 31676 KB Output is correct
24 Correct 36 ms 31676 KB Output is correct
25 Correct 70 ms 31676 KB Output is correct
26 Correct 68 ms 31676 KB Output is correct
27 Correct 45 ms 31676 KB Output is correct
28 Correct 93 ms 31676 KB Output is correct
29 Correct 87 ms 31676 KB Output is correct
30 Correct 95 ms 31676 KB Output is correct
31 Correct 36 ms 31676 KB Output is correct
32 Correct 53 ms 31676 KB Output is correct
33 Correct 22 ms 31676 KB Output is correct
34 Correct 54 ms 31676 KB Output is correct
35 Correct 49 ms 31676 KB Output is correct
36 Correct 49 ms 31676 KB Output is correct
37 Correct 42 ms 31676 KB Output is correct
38 Correct 38 ms 31676 KB Output is correct
39 Correct 72 ms 31676 KB Output is correct
40 Correct 98 ms 31676 KB Output is correct
41 Correct 72 ms 31676 KB Output is correct
42 Correct 67 ms 31676 KB Output is correct
43 Correct 63 ms 31676 KB Output is correct
44 Correct 76 ms 31676 KB Output is correct
45 Correct 53 ms 31676 KB Output is correct
46 Correct 36 ms 31676 KB Output is correct
47 Correct 73 ms 31676 KB Output is correct
48 Correct 81 ms 31676 KB Output is correct
49 Correct 64 ms 31676 KB Output is correct
50 Partially correct 101 ms 31676 KB Partially correct - number of queries: 5009
51 Correct 59 ms 31676 KB Output is correct
52 Correct 38 ms 31676 KB Output is correct
53 Correct 57 ms 31676 KB Output is correct
54 Correct 66 ms 31676 KB Output is correct
55 Correct 36 ms 31676 KB Output is correct
56 Partially correct 100 ms 31676 KB Partially correct - number of queries: 5054
57 Correct 92 ms 31676 KB Output is correct
58 Correct 81 ms 31676 KB Output is correct
59 Correct 85 ms 31676 KB Output is correct
60 Correct 82 ms 31676 KB Output is correct
61 Correct 54 ms 31676 KB Output is correct
62 Correct 39 ms 31676 KB Output is correct
63 Correct 94 ms 31676 KB Output is correct
64 Correct 55 ms 31676 KB Output is correct
65 Correct 55 ms 31676 KB Output is correct
66 Correct 55 ms 31676 KB Output is correct
67 Correct 65 ms 31676 KB Output is correct
68 Correct 42 ms 31676 KB Output is correct
69 Correct 67 ms 31676 KB Output is correct
70 Correct 55 ms 31676 KB Output is correct
71 Correct 94 ms 31676 KB Output is correct
72 Correct 57 ms 31676 KB Output is correct
73 Correct 97 ms 31676 KB Output is correct
74 Correct 98 ms 31676 KB Output is correct
75 Correct 58 ms 31676 KB Output is correct
76 Correct 116 ms 31676 KB Output is correct
77 Partially correct 101 ms 31676 KB Partially correct - number of queries: 5177
78 Correct 59 ms 31676 KB Output is correct
79 Correct 80 ms 31676 KB Output is correct
80 Partially correct 106 ms 31676 KB Partially correct - number of queries: 5240
81 Partially correct 100 ms 31676 KB Partially correct - number of queries: 5216
82 Partially correct 103 ms 31676 KB Partially correct - number of queries: 5125
83 Correct 60 ms 31676 KB Output is correct
84 Correct 89 ms 31676 KB Output is correct
85 Partially correct 99 ms 31676 KB Partially correct - number of queries: 5180
86 Correct 59 ms 31676 KB Output is correct
87 Correct 57 ms 31676 KB Output is correct
88 Correct 60 ms 31676 KB Output is correct
89 Correct 67 ms 31676 KB Output is correct
90 Correct 55 ms 31676 KB Output is correct
91 Correct 62 ms 31676 KB Output is correct
92 Correct 55 ms 31676 KB Output is correct
93 Correct 57 ms 31676 KB Output is correct
94 Correct 58 ms 31676 KB Output is correct
95 Correct 61 ms 31676 KB Output is correct
96 Correct 57 ms 31676 KB Output is correct
97 Correct 54 ms 31676 KB Output is correct