Submission #61545

# Submission time Handle Problem Language Result Execution time Memory
61545 2018-07-26T07:26:38 Z zadrga The Big Prize (IOI17_prize) C++14
90 / 100
117 ms 5820 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 500

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 23 ms 5028 KB Output is correct
2 Correct 14 ms 5260 KB Output is correct
3 Correct 28 ms 5260 KB Output is correct
4 Correct 23 ms 5440 KB Output is correct
5 Correct 25 ms 5440 KB Output is correct
6 Correct 17 ms 5440 KB Output is correct
7 Correct 12 ms 5440 KB Output is correct
8 Correct 25 ms 5456 KB Output is correct
9 Correct 11 ms 5456 KB Output is correct
10 Correct 33 ms 5456 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 24 ms 5456 KB Output is correct
2 Correct 24 ms 5456 KB Output is correct
3 Correct 22 ms 5456 KB Output is correct
4 Correct 34 ms 5456 KB Output is correct
5 Correct 24 ms 5456 KB Output is correct
6 Correct 18 ms 5456 KB Output is correct
7 Correct 22 ms 5456 KB Output is correct
8 Correct 34 ms 5456 KB Output is correct
9 Correct 23 ms 5456 KB Output is correct
10 Correct 30 ms 5456 KB Output is correct
11 Correct 21 ms 5456 KB Output is correct
12 Correct 27 ms 5456 KB Output is correct
13 Correct 34 ms 5456 KB Output is correct
14 Correct 23 ms 5456 KB Output is correct
15 Correct 21 ms 5456 KB Output is correct
16 Partially correct 85 ms 5740 KB Partially correct - number of queries: 7172
17 Correct 14 ms 5740 KB Output is correct
18 Partially correct 109 ms 5740 KB Partially correct - number of queries: 8441
19 Correct 15 ms 5740 KB Output is correct
20 Correct 37 ms 5740 KB Output is correct
21 Correct 45 ms 5740 KB Output is correct
22 Correct 13 ms 5740 KB Output is correct
23 Correct 20 ms 5740 KB Output is correct
24 Correct 15 ms 5740 KB Output is correct
25 Correct 54 ms 5740 KB Output is correct
26 Correct 54 ms 5740 KB Output is correct
27 Correct 22 ms 5740 KB Output is correct
28 Partially correct 99 ms 5740 KB Partially correct - number of queries: 7411
29 Partially correct 67 ms 5740 KB Partially correct - number of queries: 5965
30 Partially correct 82 ms 5740 KB Partially correct - number of queries: 8364
31 Correct 17 ms 5740 KB Output is correct
32 Correct 23 ms 5740 KB Output is correct
33 Correct 9 ms 5740 KB Output is correct
34 Correct 46 ms 5740 KB Output is correct
35 Correct 32 ms 5740 KB Output is correct
36 Correct 36 ms 5740 KB Output is correct
37 Correct 23 ms 5740 KB Output is correct
38 Correct 20 ms 5740 KB Output is correct
39 Correct 51 ms 5740 KB Output is correct
40 Partially correct 98 ms 5740 KB Partially correct - number of queries: 7524
41 Partially correct 77 ms 5740 KB Partially correct - number of queries: 5231
42 Partially correct 50 ms 5740 KB Partially correct - number of queries: 5231
43 Correct 73 ms 5740 KB Output is correct
44 Correct 43 ms 5740 KB Output is correct
45 Correct 35 ms 5740 KB Output is correct
46 Correct 20 ms 5740 KB Output is correct
47 Correct 51 ms 5740 KB Output is correct
48 Partially correct 87 ms 5740 KB Partially correct - number of queries: 6300
49 Correct 23 ms 5740 KB Output is correct
50 Partially correct 103 ms 5740 KB Partially correct - number of queries: 8422
51 Correct 37 ms 5740 KB Output is correct
52 Correct 18 ms 5740 KB Output is correct
53 Correct 18 ms 5740 KB Output is correct
54 Correct 53 ms 5740 KB Output is correct
55 Correct 16 ms 5740 KB Output is correct
56 Partially correct 111 ms 5740 KB Partially correct - number of queries: 8404
57 Partially correct 33 ms 5740 KB Partially correct - number of queries: 6242
58 Partially correct 90 ms 5740 KB Partially correct - number of queries: 6243
59 Partially correct 60 ms 5740 KB Partially correct - number of queries: 5231
60 Correct 44 ms 5740 KB Output is correct
61 Correct 28 ms 5740 KB Output is correct
62 Correct 13 ms 5740 KB Output is correct
63 Correct 28 ms 5740 KB Output is correct
64 Correct 21 ms 5740 KB Output is correct
65 Correct 23 ms 5740 KB Output is correct
66 Correct 29 ms 5740 KB Output is correct
67 Correct 27 ms 5740 KB Output is correct
68 Correct 18 ms 5740 KB Output is correct
69 Correct 30 ms 5740 KB Output is correct
70 Correct 30 ms 5740 KB Output is correct
71 Partially correct 117 ms 5740 KB Partially correct - number of queries: 8728
72 Correct 21 ms 5740 KB Output is correct
73 Partially correct 84 ms 5740 KB Partially correct - number of queries: 8637
74 Partially correct 112 ms 5740 KB Partially correct - number of queries: 8676
75 Correct 27 ms 5740 KB Output is correct
76 Partially correct 76 ms 5748 KB Partially correct - number of queries: 7792
77 Partially correct 61 ms 5748 KB Partially correct - number of queries: 8054
78 Correct 21 ms 5748 KB Output is correct
79 Correct 49 ms 5748 KB Output is correct
80 Partially correct 77 ms 5748 KB Partially correct - number of queries: 8015
81 Partially correct 87 ms 5748 KB Partially correct - number of queries: 8076
82 Partially correct 77 ms 5748 KB Partially correct - number of queries: 7934
83 Correct 20 ms 5748 KB Output is correct
84 Partially correct 71 ms 5748 KB Partially correct - number of queries: 6877
85 Partially correct 89 ms 5820 KB Partially correct - number of queries: 7987
86 Correct 38 ms 5820 KB Output is correct
87 Correct 24 ms 5820 KB Output is correct
88 Correct 31 ms 5820 KB Output is correct
89 Correct 32 ms 5820 KB Output is correct
90 Correct 31 ms 5820 KB Output is correct
91 Correct 36 ms 5820 KB Output is correct
92 Correct 17 ms 5820 KB Output is correct
93 Correct 33 ms 5820 KB Output is correct
94 Correct 36 ms 5820 KB Output is correct
95 Correct 33 ms 5820 KB Output is correct
96 Correct 32 ms 5820 KB Output is correct
97 Correct 21 ms 5820 KB Output is correct