oj.uz

Submission #601244

# Submission time Handle Problem Language Result Execution time Memory
601244 2022-07-21T13:54:42 Z Lucpp The Big Prize (IOI17_prize) C++17
100 / 100
 56 ms 884 KB 
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;

int MAX = 500;
int v;

map<int, vector<int>> memo;
vector<int> qry(int i){
	if(memo.count(i)) return memo[i];
	vector<int> a = ask(i);
	return memo[i] = a;
}

int ans = -1;

void solve(int l, int r, int subL, int subR){
	if(r < l) return;
	int m = (l+r)/2;
	int lo = m-1, hi = m;
	int it = 1;
	int cnt = 0;
	while(true){
		it = 1-it;
		if(ans != -1) return;
		if(it == 0) m = hi++;
		else m = lo--;
		if(lo < l && hi > r && (m < l || m > r)) break;
		if(m < l || m > r) continue;
		vector<int> a = qry(m);
		if(a[0]+a[1] == 0){
			ans = m;
			return;
		}
		if(a[0]+a[1] != v){
			cnt++;
			continue;
		}
		if(it == 0){
			if(cnt < a[0]-subL) solve(l, lo, subL, cnt+a[1]);
			if(0 < a[1]-subR) solve(hi, r, a[0]+cnt, subR);
		}
		else{
			if(0 < a[0]-subL) solve(l, lo, subL, cnt+a[1]);
			if(cnt < a[1]-subR)solve(hi, r, a[0]+cnt, subR);
		}
		break;
	}
}

int find_best(int n) {
	MAX = min(n, MAX);
	v = 0;
	for(int i = 0; i < MAX; i++){
		vector<int> a = qry(i);
		if(a[0] + a[1] == 0) return i;
		v = max(v, a[0]+a[1]);
		if(v > 26) break;
	}
	solve(0, n-1, 0, 0);
	return ans;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 288 KB Output is correct
2 Correct 4 ms 292 KB Output is correct
3 Correct 7 ms 292 KB Output is correct
4 Correct 5 ms 336 KB Output is correct
5 Correct 6 ms 292 KB Output is correct
6 Correct 0 ms 288 KB Output is correct
7 Correct 4 ms 408 KB Output is correct
8 Correct 5 ms 288 KB Output is correct
9 Correct 5 ms 408 KB Output is correct
10 Correct 6 ms 568 KB Output is correct

Subtask #2
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 336 KB Output is correct
2 Correct 6 ms 336 KB Output is correct
3 Correct 3 ms 352 KB Output is correct
4 Correct 3 ms 320 KB Output is correct
5 Correct 5 ms 336 KB Output is correct
6 Correct 0 ms 292 KB Output is correct
7 Correct 5 ms 328 KB Output is correct
8 Correct 6 ms 300 KB Output is correct
9 Correct 3 ms 324 KB Output is correct
10 Correct 5 ms 336 KB Output is correct
11 Correct 2 ms 284 KB Output is correct
12 Correct 1 ms 288 KB Output is correct
13 Correct 4 ms 328 KB Output is correct
14 Correct 2 ms 208 KB Output is correct
15 Correct 6 ms 288 KB Output is correct
16 Correct 32 ms 576 KB Output is correct
17 Correct 1 ms 284 KB Output is correct
18 Correct 32 ms 796 KB Output is correct
19 Correct 0 ms 208 KB Output is correct
20 Correct 6 ms 344 KB Output is correct
21 Correct 21 ms 456 KB Output is correct
22 Correct 6 ms 432 KB Output is correct
23 Correct 8 ms 328 KB Output is correct
24 Correct 1 ms 208 KB Output is correct
25 Correct 18 ms 396 KB Output is correct
26 Correct 24 ms 492 KB Output is correct
27 Correct 3 ms 352 KB Output is correct
28 Correct 20 ms 656 KB Output is correct
29 Correct 33 ms 536 KB Output is correct
30 Correct 44 ms 684 KB Output is correct
31 Correct 1 ms 208 KB Output is correct
32 Correct 3 ms 316 KB Output is correct
33 Correct 0 ms 208 KB Output is correct
34 Correct 10 ms 408 KB Output is correct
35 Correct 5 ms 336 KB Output is correct
36 Correct 10 ms 356 KB Output is correct
37 Correct 1 ms 208 KB Output is correct
38 Correct 8 ms 408 KB Output is correct
39 Correct 14 ms 560 KB Output is correct
40 Correct 36 ms 640 KB Output is correct
41 Correct 30 ms 536 KB Output is correct
42 Correct 22 ms 592 KB Output is correct
43 Correct 28 ms 488 KB Output is correct
44 Correct 19 ms 540 KB Output is correct
45 Correct 13 ms 340 KB Output is correct
46 Correct 0 ms 272 KB Output is correct
47 Correct 21 ms 456 KB Output is correct
48 Correct 23 ms 532 KB Output is correct
49 Correct 3 ms 336 KB Output is correct
50 Correct 36 ms 704 KB Output is correct
51 Correct 9 ms 448 KB Output is correct
52 Correct 1 ms 292 KB Output is correct
53 Correct 8 ms 280 KB Output is correct
54 Correct 14 ms 400 KB Output is correct
55 Correct 1 ms 208 KB Output is correct
56 Correct 32 ms 664 KB Output is correct
57 Correct 35 ms 528 KB Output is correct
58 Correct 15 ms 640 KB Output is correct
59 Correct 18 ms 544 KB Output is correct
60 Correct 18 ms 408 KB Output is correct
61 Correct 8 ms 336 KB Output is correct
62 Correct 5 ms 280 KB Output is correct
63 Correct 6 ms 292 KB Output is correct
64 Correct 3 ms 356 KB Output is correct
65 Correct 1 ms 292 KB Output is correct
66 Correct 5 ms 288 KB Output is correct
67 Correct 3 ms 288 KB Output is correct
68 Correct 5 ms 300 KB Output is correct
69 Correct 6 ms 288 KB Output is correct
70 Correct 3 ms 288 KB Output is correct
71 Correct 48 ms 732 KB Output is correct
72 Correct 5 ms 336 KB Output is correct
73 Correct 56 ms 884 KB Output is correct
74 Correct 40 ms 712 KB Output is correct
75 Correct 6 ms 336 KB Output is correct
76 Correct 31 ms 728 KB Output is correct
77 Correct 38 ms 728 KB Output is correct
78 Correct 7 ms 332 KB Output is correct
79 Correct 25 ms 524 KB Output is correct
80 Correct 37 ms 720 KB Output is correct
81 Correct 49 ms 712 KB Output is correct
82 Correct 37 ms 708 KB Output is correct
83 Correct 7 ms 312 KB Output is correct
84 Correct 29 ms 632 KB Output is correct
85 Correct 48 ms 720 KB Output is correct
86 Correct 6 ms 316 KB Output is correct
87 Correct 1 ms 208 KB Output is correct
88 Correct 4 ms 336 KB Output is correct
89 Correct 6 ms 336 KB Output is correct
90 Correct 6 ms 336 KB Output is correct
91 Correct 4 ms 208 KB Output is correct
92 Correct 7 ms 292 KB Output is correct
93 Correct 8 ms 352 KB Output is correct
94 Correct 9 ms 356 KB Output is correct
95 Correct 9 ms 324 KB Output is correct
96 Correct 10 ms 304 KB Output is correct
97 Correct 6 ms 336 KB Output is correct