oj.uz

Submission #152300

# Submission time Handle Problem Language Result Execution time Memory
152300 2019-09-07T10:34:52 Z mieszko11b The Big Prize (IOI17_prize) C++14
20 / 100
 103 ms 5260 KB 
#include "prize.h"
#include <bits/stdc++.h>

using namespace std;

#define X first
#define Y second

using ii = pair<int, int>;

int n;
vector<int> V[200007];

ii ans(int i) {
	if(V[i].size() == 0)
		V[i] = ask(i);
	return {V[i][0], V[i][1]};
}

int sum(int i) {
	return ans(i).X + ans(i).Y;
}

int worst_sum;

int find_in_segment(int a, int b, int ok) {
	if(!ok)
		return -1;
	
	int mid1 = (a + b) / 2;
	if(sum(mid1) > sum(a - 1)) {
		while(sum(a) < sum(mid1)) {
			if(sum(a) == 0)
				return a;
			a++;
		}
		while(sum(b) < sum(mid1)) {
			if(sum(b) == 0)
				return b;
			b--;
		}
		
		if(a < mid1) {
			int x = find_in_segment(a + 1, mid1 - 1, ans(mid1).X - ans(a).X);
			if(x != -1)
				return x;
		}
		
		if(mid1 < b) {
			int x = find_in_segment(mid1 + 1, b - 1, ans(b).X - ans(mid1).X);
			if(x != -1)
				return x;
		}
		
		return -1;
	}
	
	int mid2 = (a + b) / 2;
	
	while(ans(mid1).X + ans(mid1).Y != sum(a - 1) && mid1 >= a) {
		if(ans(mid1).X + ans(mid1).Y == 0)
			return mid1;
		mid1--;
	}
	
	if(mid1 > a) {
		int x = find_in_segment(a, mid1 - 1, ans(mid1).X - ans(a - 1).X);
		if(x != -1)
			return x;
	}
	
	while(ans(mid2).X + ans(mid2).Y != sum(a - 1) && mid2 <= b) {
		if(ans(mid2).X + ans(mid2).Y == 0)
			return mid2;
		mid2++;
	}
	
	if(mid2 < b) {
		int x = find_in_segment(mid2 + 1, b, ans(b + 1).X - ans(mid2).X);
		if(x != -1)
			return x;
	}
	
	return -1;
}

int find_best(int n) {
	::n = n;
	
	int total = ans(0).Y;
	V[n] = {total, 0};
	if(total == 0) 
		return 0;
		
	return find_in_segment(1, n - 1, total);
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4984 KB Output is correct
2 Correct 7 ms 4984 KB Output is correct
3 Correct 6 ms 5112 KB Output is correct
4 Correct 7 ms 4984 KB Output is correct
5 Correct 7 ms 4984 KB Output is correct
6 Correct 6 ms 5112 KB Output is correct
7 Correct 7 ms 4984 KB Output is correct
8 Correct 6 ms 5008 KB Output is correct
9 Correct 8 ms 4984 KB Output is correct
10 Correct 6 ms 4984 KB Output is correct

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4984 KB Output is correct
2 Correct 7 ms 4984 KB Output is correct
3 Correct 14 ms 4988 KB Output is correct
4 Correct 8 ms 4984 KB Output is correct
5 Correct 6 ms 5008 KB Output is correct
6 Correct 6 ms 5092 KB Output is correct
7 Correct 6 ms 5112 KB Output is correct
8 Correct 7 ms 5012 KB Output is correct
9 Correct 6 ms 4984 KB Output is correct
10 Correct 6 ms 4984 KB Output is correct
11 Correct 9 ms 4984 KB Output is correct
12 Correct 8 ms 4984 KB Output is correct
13 Correct 12 ms 5012 KB Output is correct
14 Correct 8 ms 4984 KB Output is correct
15 Correct 10 ms 5036 KB Output is correct
16 Correct 27 ms 5228 KB Output is correct
17 Correct 7 ms 4984 KB Output is correct
18 Correct 51 ms 5192 KB Output is correct
19 Correct 8 ms 4984 KB Output is correct
20 Correct 12 ms 5152 KB Output is correct
21 Correct 25 ms 5032 KB Output is correct
22 Correct 10 ms 4984 KB Output is correct
23 Correct 7 ms 5116 KB Output is correct
24 Correct 7 ms 5004 KB Output is correct
25 Correct 26 ms 5100 KB Output is correct
26 Correct 30 ms 5112 KB Output is correct
27 Correct 7 ms 4984 KB Output is correct
28 Correct 51 ms 5188 KB Output is correct
29 Correct 38 ms 5056 KB Output is correct
30 Correct 33 ms 5164 KB Output is correct
31 Correct 7 ms 5032 KB Output is correct
32 Correct 10 ms 4988 KB Output is correct
33 Correct 6 ms 4984 KB Output is correct
34 Correct 19 ms 4984 KB Output is correct
35 Correct 7 ms 5120 KB Output is correct
36 Correct 17 ms 4984 KB Output is correct
37 Correct 9 ms 4984 KB Output is correct
38 Correct 10 ms 4984 KB Output is correct
39 Correct 29 ms 5068 KB Output is correct
40 Correct 39 ms 5128 KB Output is correct
41 Correct 28 ms 5068 KB Output is correct
42 Correct 37 ms 5076 KB Output is correct
43 Correct 27 ms 5084 KB Output is correct
44 Correct 26 ms 5004 KB Output is correct
45 Correct 22 ms 5032 KB Output is correct
46 Correct 7 ms 4984 KB Output is correct
47 Correct 27 ms 5072 KB Output is correct
48 Correct 27 ms 5116 KB Output is correct
49 Correct 9 ms 5004 KB Output is correct
50 Correct 60 ms 5112 KB Output is correct
51 Correct 22 ms 5108 KB Output is correct
52 Correct 8 ms 5092 KB Output is correct
53 Correct 7 ms 4984 KB Output is correct
54 Correct 27 ms 5020 KB Output is correct
55 Correct 7 ms 4984 KB Output is correct
56 Correct 51 ms 5168 KB Output is correct
57 Correct 29 ms 5172 KB Output is correct
58 Correct 44 ms 5104 KB Output is correct
59 Correct 31 ms 4984 KB Output is correct
60 Correct 28 ms 4984 KB Output is correct
61 Correct 8 ms 4984 KB Output is correct
62 Correct 6 ms 5112 KB Output is correct
63 Correct 7 ms 5012 KB Output is correct
64 Correct 8 ms 4984 KB Output is correct
65 Correct 7 ms 5008 KB Output is correct
66 Correct 12 ms 5008 KB Output is correct
67 Correct 7 ms 4984 KB Output is correct
68 Correct 11 ms 4984 KB Output is correct
69 Correct 9 ms 5020 KB Output is correct
70 Correct 8 ms 4984 KB Output is correct
71 Correct 60 ms 5156 KB Output is correct
72 Correct 11 ms 4984 KB Output is correct
73 Correct 55 ms 5160 KB Output is correct
74 Correct 52 ms 5224 KB Output is correct
75 Correct 7 ms 5112 KB Output is correct
76 Correct 49 ms 5112 KB Output is correct
77 Correct 63 ms 5172 KB Output is correct
78 Correct 13 ms 4984 KB Output is correct
79 Correct 26 ms 4984 KB Output is correct
80 Correct 61 ms 5112 KB Output is correct
81 Correct 53 ms 5112 KB Output is correct
82 Correct 53 ms 5136 KB Output is correct
83 Correct 7 ms 5032 KB Output is correct
84 Correct 54 ms 5084 KB Output is correct
85 Correct 52 ms 5184 KB Output is correct
86 Incorrect 103 ms 5260 KB Incorrect
87 Halted 0 ms 0 KB -