Submission #61549

# Submission time Handle Problem Language Result Execution time Memory
61549 2018-07-26T07:28:37 Z zadrga The Big Prize (IOI17_prize) C++14
90 / 100
109 ms 5860 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 300

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 10 ms 5136 KB Output is correct
2 Correct 22 ms 5220 KB Output is correct
3 Correct 28 ms 5280 KB Output is correct
4 Correct 32 ms 5344 KB Output is correct
5 Correct 18 ms 5344 KB Output is correct
6 Correct 13 ms 5344 KB Output is correct
7 Correct 22 ms 5344 KB Output is correct
8 Correct 21 ms 5388 KB Output is correct
9 Correct 23 ms 5388 KB Output is correct
10 Correct 33 ms 5500 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 15 ms 5500 KB Output is correct
2 Correct 17 ms 5500 KB Output is correct
3 Correct 22 ms 5500 KB Output is correct
4 Correct 20 ms 5500 KB Output is correct
5 Correct 21 ms 5500 KB Output is correct
6 Correct 14 ms 5500 KB Output is correct
7 Correct 22 ms 5500 KB Output is correct
8 Correct 22 ms 5500 KB Output is correct
9 Correct 16 ms 5500 KB Output is correct
10 Correct 20 ms 5500 KB Output is correct
11 Correct 21 ms 5500 KB Output is correct
12 Correct 12 ms 5500 KB Output is correct
13 Correct 35 ms 5500 KB Output is correct
14 Correct 12 ms 5500 KB Output is correct
15 Correct 31 ms 5500 KB Output is correct
16 Partially correct 42 ms 5652 KB Partially correct - number of queries: 6679
17 Correct 15 ms 5652 KB Output is correct
18 Partially correct 41 ms 5716 KB Partially correct - number of queries: 7965
19 Correct 14 ms 5716 KB Output is correct
20 Correct 43 ms 5716 KB Output is correct
21 Correct 22 ms 5716 KB Output is correct
22 Correct 16 ms 5716 KB Output is correct
23 Correct 17 ms 5716 KB Output is correct
24 Correct 16 ms 5716 KB Output is correct
25 Correct 47 ms 5716 KB Output is correct
26 Correct 48 ms 5716 KB Output is correct
27 Correct 17 ms 5716 KB Output is correct
28 Partially correct 88 ms 5716 KB Partially correct - number of queries: 7044
29 Partially correct 74 ms 5716 KB Partially correct - number of queries: 5701
30 Partially correct 107 ms 5716 KB Partially correct - number of queries: 7885
31 Correct 15 ms 5716 KB Output is correct
32 Correct 31 ms 5716 KB Output is correct
33 Correct 10 ms 5716 KB Output is correct
34 Correct 38 ms 5716 KB Output is correct
35 Correct 24 ms 5716 KB Output is correct
36 Correct 16 ms 5716 KB Output is correct
37 Correct 13 ms 5716 KB Output is correct
38 Correct 15 ms 5716 KB Output is correct
39 Correct 41 ms 5716 KB Output is correct
40 Partially correct 72 ms 5716 KB Partially correct - number of queries: 6970
41 Correct 38 ms 5716 KB Output is correct
42 Correct 74 ms 5716 KB Output is correct
43 Correct 45 ms 5716 KB Output is correct
44 Correct 25 ms 5716 KB Output is correct
45 Correct 31 ms 5716 KB Output is correct
46 Correct 13 ms 5716 KB Output is correct
47 Correct 48 ms 5716 KB Output is correct
48 Partially correct 71 ms 5716 KB Partially correct - number of queries: 5837
49 Correct 15 ms 5716 KB Output is correct
50 Partially correct 92 ms 5716 KB Partially correct - number of queries: 7992
51 Correct 43 ms 5716 KB Output is correct
52 Correct 14 ms 5716 KB Output is correct
53 Correct 30 ms 5716 KB Output is correct
54 Correct 44 ms 5716 KB Output is correct
55 Correct 12 ms 5716 KB Output is correct
56 Partially correct 88 ms 5716 KB Partially correct - number of queries: 8005
57 Partially correct 57 ms 5716 KB Partially correct - number of queries: 5779
58 Partially correct 51 ms 5716 KB Partially correct - number of queries: 5759
59 Correct 67 ms 5716 KB Output is correct
60 Correct 52 ms 5716 KB Output is correct
61 Correct 26 ms 5716 KB Output is correct
62 Correct 12 ms 5716 KB Output is correct
63 Correct 26 ms 5716 KB Output is correct
64 Correct 23 ms 5716 KB Output is correct
65 Correct 27 ms 5716 KB Output is correct
66 Correct 26 ms 5716 KB Output is correct
67 Correct 34 ms 5716 KB Output is correct
68 Correct 13 ms 5716 KB Output is correct
69 Correct 23 ms 5716 KB Output is correct
70 Correct 31 ms 5716 KB Output is correct
71 Partially correct 85 ms 5736 KB Partially correct - number of queries: 8437
72 Correct 34 ms 5736 KB Output is correct
73 Partially correct 77 ms 5860 KB Partially correct - number of queries: 8339
74 Partially correct 79 ms 5860 KB Partially correct - number of queries: 8381
75 Correct 31 ms 5860 KB Output is correct
76 Partially correct 95 ms 5860 KB Partially correct - number of queries: 7429
77 Partially correct 91 ms 5860 KB Partially correct - number of queries: 7587
78 Correct 36 ms 5860 KB Output is correct
79 Correct 55 ms 5860 KB Output is correct
80 Partially correct 109 ms 5860 KB Partially correct - number of queries: 7649
81 Partially correct 68 ms 5860 KB Partially correct - number of queries: 7576
82 Partially correct 94 ms 5860 KB Partially correct - number of queries: 7557
83 Correct 33 ms 5860 KB Output is correct
84 Partially correct 77 ms 5860 KB Partially correct - number of queries: 6523
85 Partially correct 76 ms 5860 KB Partially correct - number of queries: 7558
86 Correct 21 ms 5860 KB Output is correct
87 Correct 25 ms 5860 KB Output is correct
88 Correct 32 ms 5860 KB Output is correct
89 Correct 24 ms 5860 KB Output is correct
90 Correct 35 ms 5860 KB Output is correct
91 Correct 31 ms 5860 KB Output is correct
92 Correct 23 ms 5860 KB Output is correct
93 Correct 33 ms 5860 KB Output is correct
94 Correct 17 ms 5860 KB Output is correct
95 Correct 37 ms 5860 KB Output is correct
96 Correct 35 ms 5860 KB Output is correct
97 Correct 18 ms 5860 KB Output is correct