Submission #54250

# Submission time Handle Problem Language Result Execution time Memory
54250 2018-07-02T22:07:53 Z radoslav11 The Big Prize (IOI17_prize) C++14
97.64 / 100
104 ms 25568 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;
mt19937 mt(42);

bool useless(int l, int r)
{
	if(query(l)[1] - query(r)[1] == 0) return true;
	//if(query(r)[0] - query(l)[0] == 0) return true;
	return false;
}

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

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

	if(useless(l - 1, r + 1))
	{
		for(int i = l; i <= r; i++)
			memo[i] = query(l - 1);
		return;
	}

	if(useless(l - 1, mid))
		for(int i = l; i < mid; i++)
			dummy[i] = 1;
	else
		rec(l, mid - 1);

	if(useless(mid, r + 1))
		for(int i = mid + 1; i <= r; i++)
			dummy[i] = 1;
	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 26 ms 25208 KB Output is correct
2 Correct 32 ms 25276 KB Output is correct
3 Correct 29 ms 25340 KB Output is correct
4 Correct 38 ms 25340 KB Output is correct
5 Correct 29 ms 25340 KB Output is correct
6 Correct 23 ms 25340 KB Output is correct
7 Correct 30 ms 25340 KB Output is correct
8 Correct 29 ms 25340 KB Output is correct
9 Correct 31 ms 25376 KB Output is correct
10 Correct 38 ms 25376 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 30 ms 25376 KB Output is correct
2 Correct 32 ms 25376 KB Output is correct
3 Correct 31 ms 25376 KB Output is correct
4 Correct 37 ms 25376 KB Output is correct
5 Correct 31 ms 25376 KB Output is correct
6 Correct 25 ms 25376 KB Output is correct
7 Correct 35 ms 25376 KB Output is correct
8 Correct 30 ms 25376 KB Output is correct
9 Correct 33 ms 25376 KB Output is correct
10 Correct 38 ms 25376 KB Output is correct
11 Correct 30 ms 25440 KB Output is correct
12 Correct 22 ms 25440 KB Output is correct
13 Correct 42 ms 25440 KB Output is correct
14 Correct 47 ms 25440 KB Output is correct
15 Correct 30 ms 25440 KB Output is correct
16 Correct 62 ms 25496 KB Output is correct
17 Correct 26 ms 25496 KB Output is correct
18 Partially correct 83 ms 25496 KB Partially correct - number of queries: 5065
19 Correct 24 ms 25496 KB Output is correct
20 Correct 33 ms 25496 KB Output is correct
21 Correct 44 ms 25496 KB Output is correct
22 Correct 26 ms 25496 KB Output is correct
23 Correct 24 ms 25496 KB Output is correct
24 Correct 23 ms 25496 KB Output is correct
25 Correct 53 ms 25496 KB Output is correct
26 Correct 43 ms 25496 KB Output is correct
27 Correct 28 ms 25496 KB Output is correct
28 Correct 80 ms 25496 KB Output is correct
29 Correct 85 ms 25496 KB Output is correct
30 Partially correct 104 ms 25532 KB Partially correct - number of queries: 5021
31 Correct 26 ms 25532 KB Output is correct
32 Correct 42 ms 25532 KB Output is correct
33 Correct 25 ms 25532 KB Output is correct
34 Correct 41 ms 25532 KB Output is correct
35 Correct 40 ms 25532 KB Output is correct
36 Correct 36 ms 25532 KB Output is correct
37 Correct 27 ms 25532 KB Output is correct
38 Correct 32 ms 25532 KB Output is correct
39 Correct 52 ms 25532 KB Output is correct
40 Correct 98 ms 25532 KB Output is correct
41 Correct 55 ms 25532 KB Output is correct
42 Correct 65 ms 25532 KB Output is correct
43 Correct 57 ms 25532 KB Output is correct
44 Correct 46 ms 25532 KB Output is correct
45 Correct 35 ms 25532 KB Output is correct
46 Correct 23 ms 25532 KB Output is correct
47 Correct 41 ms 25532 KB Output is correct
48 Correct 66 ms 25532 KB Output is correct
49 Correct 26 ms 25532 KB Output is correct
50 Partially correct 80 ms 25532 KB Partially correct - number of queries: 5069
51 Correct 44 ms 25532 KB Output is correct
52 Correct 23 ms 25532 KB Output is correct
53 Correct 38 ms 25532 KB Output is correct
54 Correct 46 ms 25532 KB Output is correct
55 Correct 25 ms 25532 KB Output is correct
56 Partially correct 80 ms 25532 KB Partially correct - number of queries: 5068
57 Correct 80 ms 25532 KB Output is correct
58 Correct 59 ms 25532 KB Output is correct
59 Correct 56 ms 25532 KB Output is correct
60 Correct 48 ms 25532 KB Output is correct
61 Correct 38 ms 25532 KB Output is correct
62 Correct 24 ms 25532 KB Output is correct
63 Correct 39 ms 25532 KB Output is correct
64 Correct 32 ms 25532 KB Output is correct
65 Correct 40 ms 25532 KB Output is correct
66 Correct 41 ms 25532 KB Output is correct
67 Correct 42 ms 25532 KB Output is correct
68 Correct 23 ms 25532 KB Output is correct
69 Correct 41 ms 25532 KB Output is correct
70 Correct 41 ms 25532 KB Output is correct
71 Correct 82 ms 25532 KB Output is correct
72 Correct 41 ms 25532 KB Output is correct
73 Correct 98 ms 25568 KB Output is correct
74 Correct 93 ms 25568 KB Output is correct
75 Correct 42 ms 25568 KB Output is correct
76 Correct 84 ms 25568 KB Output is correct
77 Partially correct 98 ms 25568 KB Partially correct - number of queries: 5216
78 Correct 47 ms 25568 KB Output is correct
79 Correct 64 ms 25568 KB Output is correct
80 Partially correct 83 ms 25568 KB Partially correct - number of queries: 5236
81 Partially correct 99 ms 25568 KB Partially correct - number of queries: 5218
82 Partially correct 88 ms 25568 KB Partially correct - number of queries: 5216
83 Correct 38 ms 25568 KB Output is correct
84 Correct 75 ms 25568 KB Output is correct
85 Partially correct 81 ms 25568 KB Partially correct - number of queries: 5233
86 Correct 45 ms 25568 KB Output is correct
87 Correct 41 ms 25568 KB Output is correct
88 Correct 43 ms 25568 KB Output is correct
89 Correct 43 ms 25568 KB Output is correct
90 Correct 39 ms 25568 KB Output is correct
91 Correct 43 ms 25568 KB Output is correct
92 Correct 39 ms 25568 KB Output is correct
93 Correct 39 ms 25568 KB Output is correct
94 Correct 41 ms 25568 KB Output is correct
95 Correct 41 ms 25568 KB Output is correct
96 Correct 41 ms 25568 KB Output is correct
97 Correct 37 ms 25568 KB Output is correct