Submission #61544

# Submission time Handle Problem Language Result Execution time Memory
61544 2018-07-26T07:24:28 Z zadrga The Big Prize (IOI17_prize) C++14
90 / 100
113 ms 5896 KB
//  8.55  + 25min 


#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

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(2 * SQRT, n); i++){
		vector<int> ret = ASK(i);
		max_val = max(max_val, ret[0] + ret[1]);
	}

	ans = -1;
	for(int i = 0; i < SQRT; i++){
		int l = i * SQRT;
		solve(l, min(n - 1, l + SQRT - 1));
	}
	return ans;
}
# Verdict Execution time Memory Grader output
1 Correct 14 ms 5136 KB Output is correct
2 Correct 14 ms 5260 KB Output is correct
3 Correct 27 ms 5260 KB Output is correct
4 Correct 17 ms 5328 KB Output is correct
5 Correct 24 ms 5348 KB Output is correct
6 Correct 20 ms 5348 KB Output is correct
7 Correct 26 ms 5348 KB Output is correct
8 Correct 26 ms 5348 KB Output is correct
9 Correct 24 ms 5488 KB Output is correct
10 Correct 26 ms 5488 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 21 ms 5488 KB Output is correct
2 Correct 27 ms 5488 KB Output is correct
3 Correct 25 ms 5488 KB Output is correct
4 Correct 27 ms 5488 KB Output is correct
5 Correct 23 ms 5488 KB Output is correct
6 Correct 19 ms 5488 KB Output is correct
7 Correct 25 ms 5488 KB Output is correct
8 Correct 22 ms 5488 KB Output is correct
9 Correct 24 ms 5488 KB Output is correct
10 Correct 26 ms 5488 KB Output is correct
11 Correct 26 ms 5488 KB Output is correct
12 Correct 22 ms 5488 KB Output is correct
13 Correct 36 ms 5512 KB Output is correct
14 Correct 20 ms 5512 KB Output is correct
15 Correct 40 ms 5512 KB Output is correct
16 Partially correct 96 ms 5564 KB Partially correct - number of queries: 7082
17 Correct 14 ms 5564 KB Output is correct
18 Partially correct 113 ms 5692 KB Partially correct - number of queries: 8339
19 Correct 17 ms 5692 KB Output is correct
20 Correct 32 ms 5692 KB Output is correct
21 Correct 43 ms 5692 KB Output is correct
22 Correct 15 ms 5692 KB Output is correct
23 Correct 16 ms 5692 KB Output is correct
24 Correct 18 ms 5692 KB Output is correct
25 Correct 51 ms 5692 KB Output is correct
26 Correct 47 ms 5692 KB Output is correct
27 Correct 20 ms 5692 KB Output is correct
28 Partially correct 94 ms 5728 KB Partially correct - number of queries: 7310
29 Partially correct 100 ms 5748 KB Partially correct - number of queries: 5882
30 Partially correct 92 ms 5896 KB Partially correct - number of queries: 8360
31 Correct 13 ms 5896 KB Output is correct
32 Correct 27 ms 5896 KB Output is correct
33 Correct 8 ms 5896 KB Output is correct
34 Correct 28 ms 5896 KB Output is correct
35 Correct 19 ms 5896 KB Output is correct
36 Correct 17 ms 5896 KB Output is correct
37 Correct 20 ms 5896 KB Output is correct
38 Correct 18 ms 5896 KB Output is correct
39 Correct 26 ms 5896 KB Output is correct
40 Partially correct 78 ms 5896 KB Partially correct - number of queries: 7482
41 Partially correct 60 ms 5896 KB Partially correct - number of queries: 5092
42 Partially correct 69 ms 5896 KB Partially correct - number of queries: 5092
43 Correct 76 ms 5896 KB Output is correct
44 Correct 45 ms 5896 KB Output is correct
45 Correct 34 ms 5896 KB Output is correct
46 Correct 11 ms 5896 KB Output is correct
47 Correct 46 ms 5896 KB Output is correct
48 Partially correct 74 ms 5896 KB Partially correct - number of queries: 6198
49 Correct 18 ms 5896 KB Output is correct
50 Partially correct 90 ms 5896 KB Partially correct - number of queries: 8321
51 Correct 56 ms 5896 KB Output is correct
52 Correct 14 ms 5896 KB Output is correct
53 Correct 26 ms 5896 KB Output is correct
54 Correct 40 ms 5896 KB Output is correct
55 Correct 22 ms 5896 KB Output is correct
56 Partially correct 95 ms 5896 KB Partially correct - number of queries: 8353
57 Partially correct 61 ms 5896 KB Partially correct - number of queries: 6115
58 Partially correct 66 ms 5896 KB Partially correct - number of queries: 6239
59 Partially correct 29 ms 5896 KB Partially correct - number of queries: 5092
60 Correct 71 ms 5896 KB Output is correct
61 Correct 24 ms 5896 KB Output is correct
62 Correct 19 ms 5896 KB Output is correct
63 Correct 26 ms 5896 KB Output is correct
64 Correct 13 ms 5896 KB Output is correct
65 Correct 15 ms 5896 KB Output is correct
66 Correct 37 ms 5896 KB Output is correct
67 Correct 31 ms 5896 KB Output is correct
68 Correct 16 ms 5896 KB Output is correct
69 Correct 17 ms 5896 KB Output is correct
70 Correct 28 ms 5896 KB Output is correct
71 Partially correct 112 ms 5896 KB Partially correct - number of queries: 8806
72 Correct 17 ms 5896 KB Output is correct
73 Partially correct 54 ms 5896 KB Partially correct - number of queries: 8715
74 Partially correct 112 ms 5896 KB Partially correct - number of queries: 8754
75 Correct 28 ms 5896 KB Output is correct
76 Partially correct 62 ms 5896 KB Partially correct - number of queries: 7784
77 Partially correct 51 ms 5896 KB Partially correct - number of queries: 7974
78 Correct 33 ms 5896 KB Output is correct
79 Correct 57 ms 5896 KB Output is correct
80 Partially correct 76 ms 5896 KB Partially correct - number of queries: 8033
81 Partially correct 65 ms 5896 KB Partially correct - number of queries: 7990
82 Partially correct 70 ms 5896 KB Partially correct - number of queries: 7992
83 Correct 26 ms 5896 KB Output is correct
84 Partially correct 76 ms 5896 KB Partially correct - number of queries: 6896
85 Partially correct 96 ms 5896 KB Partially correct - number of queries: 7947
86 Correct 18 ms 5896 KB Output is correct
87 Correct 24 ms 5896 KB Output is correct
88 Correct 26 ms 5896 KB Output is correct
89 Correct 27 ms 5896 KB Output is correct
90 Correct 19 ms 5896 KB Output is correct
91 Correct 19 ms 5896 KB Output is correct
92 Correct 16 ms 5896 KB Output is correct
93 Correct 31 ms 5896 KB Output is correct
94 Correct 24 ms 5896 KB Output is correct
95 Correct 29 ms 5896 KB Output is correct
96 Correct 29 ms 5896 KB Output is correct
97 Correct 22 ms 5896 KB Output is correct