Submission #61555

# Submission time Handle Problem Language Result Execution time Memory
61555 2018-07-26T07:32:44 Z zadrga The Big Prize (IOI17_prize) C++14
90 / 100
126 ms 5820 KB
#include "prize.h"
#include <bits/stdc++.h>

using namespace std;

#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF (1 << 30)
#define MOD (1000 * 1000 * 1000 + 7)
#define maxn 201111
#define SQRT 450
#define BUCKET 100

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;

int max_val;
int ans;
bool used[maxn];
vector<int> v[maxn];

vector<int> ASK(int x){
	if(!used[x]){
		v[x] = ask(x);
		used[x] = 1;
	}
	return v[x];
}

void solve(int L, int D){
	if(ans != -1 || L > D)
		return;

	int l = -1, d = -1;
	vector<int> left, right;
	for(int i = L; i <= D; i++){
		left = ASK(i);

		if(left[0] + left[1] == 0){
			ans = i;
			return;
		}

		if(left[0] + left[1] == max_val){
			l = i;
			break;
		}
	}

	if(l == -1)
		return;

	for(int i = D; i > l; i--){
		right = ASK(i);

		if(right[0] + right[1] == 0){
			ans = i;
			return;
		}

		if(right[0] + right[1] == max_val){
			d = i;
			break;
		}
	}
	if(d == -1)
		return;

	int num = left[1] - right[1];
	if(num == 0)
		return;

	int mid = (l + d) / 2;
	solve(l, mid);
	solve(mid + 1, d);
}

int find_best(int n){
	max_val = -1;
	for(int i = 0; i < min(SQRT + 50, n); i++){
		vector<int> ret = ASK(i);
		max_val = max(max_val, ret[0] + ret[1]);
	}

	ans = -1;
	for(int i = 0; i < maxn / BUCKET + 1; i++){
		int l = i * BUCKET;
		solve(l, min(n - 1, l + BUCKET - 1));
	}
	return ans;
}
# Verdict Execution time Memory Grader output
1 Correct 16 ms 4984 KB Output is correct
2 Correct 46 ms 5220 KB Output is correct
3 Correct 27 ms 5328 KB Output is correct
4 Correct 49 ms 5596 KB Output is correct
5 Correct 24 ms 5596 KB Output is correct
6 Correct 11 ms 5596 KB Output is correct
7 Correct 29 ms 5596 KB Output is correct
8 Correct 32 ms 5596 KB Output is correct
9 Correct 27 ms 5596 KB Output is correct
10 Correct 59 ms 5596 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 24 ms 5596 KB Output is correct
2 Correct 37 ms 5596 KB Output is correct
3 Correct 34 ms 5596 KB Output is correct
4 Correct 30 ms 5596 KB Output is correct
5 Correct 46 ms 5596 KB Output is correct
6 Correct 17 ms 5596 KB Output is correct
7 Correct 42 ms 5596 KB Output is correct
8 Correct 31 ms 5596 KB Output is correct
9 Correct 41 ms 5596 KB Output is correct
10 Correct 56 ms 5692 KB Output is correct
11 Correct 31 ms 5692 KB Output is correct
12 Correct 14 ms 5692 KB Output is correct
13 Correct 27 ms 5692 KB Output is correct
14 Correct 16 ms 5692 KB Output is correct
15 Correct 36 ms 5692 KB Output is correct
16 Partially correct 95 ms 5692 KB Partially correct - number of queries: 7617
17 Correct 15 ms 5692 KB Output is correct
18 Partially correct 55 ms 5756 KB Partially correct - number of queries: 9161
19 Correct 13 ms 5756 KB Output is correct
20 Correct 29 ms 5756 KB Output is correct
21 Correct 50 ms 5756 KB Output is correct
22 Correct 22 ms 5756 KB Output is correct
23 Correct 23 ms 5756 KB Output is correct
24 Correct 17 ms 5756 KB Output is correct
25 Partially correct 81 ms 5756 KB Partially correct - number of queries: 5036
26 Correct 71 ms 5756 KB Output is correct
27 Correct 23 ms 5756 KB Output is correct
28 Partially correct 118 ms 5820 KB Partially correct - number of queries: 8561
29 Partially correct 49 ms 5820 KB Partially correct - number of queries: 7105
30 Partially correct 60 ms 5820 KB Partially correct - number of queries: 9085
31 Correct 15 ms 5820 KB Output is correct
32 Correct 48 ms 5820 KB Output is correct
33 Correct 7 ms 5820 KB Output is correct
34 Correct 33 ms 5820 KB Output is correct
35 Correct 42 ms 5820 KB Output is correct
36 Correct 37 ms 5820 KB Output is correct
37 Correct 15 ms 5820 KB Output is correct
38 Correct 12 ms 5820 KB Output is correct
39 Correct 62 ms 5820 KB Output is correct
40 Partially correct 61 ms 5820 KB Partially correct - number of queries: 8392
41 Partially correct 66 ms 5820 KB Partially correct - number of queries: 5406
42 Partially correct 74 ms 5820 KB Partially correct - number of queries: 5406
43 Correct 71 ms 5820 KB Output is correct
44 Correct 51 ms 5820 KB Output is correct
45 Correct 46 ms 5820 KB Output is correct
46 Correct 13 ms 5820 KB Output is correct
47 Correct 44 ms 5820 KB Output is correct
48 Partially correct 107 ms 5820 KB Partially correct - number of queries: 6614
49 Correct 17 ms 5820 KB Output is correct
50 Partially correct 126 ms 5820 KB Partially correct - number of queries: 9138
51 Correct 57 ms 5820 KB Output is correct
52 Correct 16 ms 5820 KB Output is correct
53 Correct 45 ms 5820 KB Output is correct
54 Correct 50 ms 5820 KB Output is correct
55 Correct 13 ms 5820 KB Output is correct
56 Partially correct 68 ms 5820 KB Partially correct - number of queries: 9152
57 Partially correct 44 ms 5820 KB Partially correct - number of queries: 6573
58 Partially correct 91 ms 5820 KB Partially correct - number of queries: 6480
59 Partially correct 69 ms 5820 KB Partially correct - number of queries: 5406
60 Partially correct 58 ms 5820 KB Partially correct - number of queries: 5053
61 Correct 47 ms 5820 KB Output is correct
62 Correct 24 ms 5820 KB Output is correct
63 Correct 58 ms 5820 KB Output is correct
64 Correct 20 ms 5820 KB Output is correct
65 Correct 62 ms 5820 KB Output is correct
66 Correct 54 ms 5820 KB Output is correct
67 Correct 53 ms 5820 KB Output is correct
68 Correct 12 ms 5820 KB Output is correct
69 Correct 52 ms 5820 KB Output is correct
70 Correct 63 ms 5820 KB Output is correct
71 Partially correct 102 ms 5820 KB Partially correct - number of queries: 9682
72 Correct 72 ms 5820 KB Output is correct
73 Partially correct 89 ms 5820 KB Partially correct - number of queries: 9605
74 Partially correct 100 ms 5820 KB Partially correct - number of queries: 9638
75 Correct 70 ms 5820 KB Output is correct
76 Partially correct 71 ms 5820 KB Partially correct - number of queries: 8890
77 Partially correct 103 ms 5820 KB Partially correct - number of queries: 8866
78 Correct 48 ms 5820 KB Output is correct
79 Partially correct 80 ms 5820 KB Partially correct - number of queries: 6366
80 Partially correct 81 ms 5820 KB Partially correct - number of queries: 8882
81 Partially correct 59 ms 5820 KB Partially correct - number of queries: 8860
82 Partially correct 87 ms 5820 KB Partially correct - number of queries: 8724
83 Correct 46 ms 5820 KB Output is correct
84 Partially correct 71 ms 5820 KB Partially correct - number of queries: 8024
85 Partially correct 44 ms 5820 KB Partially correct - number of queries: 8789
86 Correct 55 ms 5820 KB Output is correct
87 Correct 66 ms 5820 KB Output is correct
88 Correct 67 ms 5820 KB Output is correct
89 Correct 61 ms 5820 KB Output is correct
90 Correct 55 ms 5820 KB Output is correct
91 Correct 36 ms 5820 KB Output is correct
92 Correct 59 ms 5820 KB Output is correct
93 Correct 51 ms 5820 KB Output is correct
94 Correct 60 ms 5820 KB Output is correct
95 Correct 33 ms 5820 KB Output is correct
96 Correct 76 ms 5820 KB Output is correct
97 Correct 36 ms 5820 KB Output is correct