oj.uz

답안 #152303

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
152303 2019-09-07T10:47:22 Z mieszko11b 커다란 상품 (IOI17_prize) C++14
100 / 100
 65 ms 5240 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];

int worst_sum;

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

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

int find_in_segment(int a, int b, int ok) {
	if(!ok)
		return -1;
	
	int mid1 = (a + b) / 2;
	int mid2 = (a + b) / 2;
	
	for(int i = 0 ; i < 5 ; i++) {
		while(sum(a - 1) < worst_sum && a <= mid1) {
			if(sum(a) == 0)
				return a;
			a++;
		}
		while(sum(b + 1) < worst_sum && mid1 <= b) {
			if(sum(b) == 0)
				return b;
			b--;
		}
		
		while(sum(mid1) < worst_sum && mid1 >= a) {
			if(sum(mid1) == 0)
				return mid1;
			mid1--;
		}
		
		while(sum(mid2) < worst_sum && mid2 <= b) {
			if(sum(mid2) == 0)
				return mid2;
			mid2++;
		}
	}
	
	if(mid1 > a) {
		int x = find_in_segment(a, mid1 - 1, ans(mid1).X - ans(a - 1).X);
		if(x != -1)
			return x;
	}
	
	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;
	worst_sum = total;
	V[n] = {total, 0};
	if(total == 0) 
		return 0;
		
	return find_in_segment(1, n - 1, total);
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 4984 KB Output is correct
2 Correct 7 ms 4984 KB Output is correct
3 Correct 7 ms 4984 KB Output is correct
4 Correct 6 ms 4984 KB Output is correct
5 Correct 6 ms 4984 KB Output is correct
6 Correct 6 ms 4904 KB Output is correct
7 Correct 6 ms 4984 KB Output is correct
8 Correct 7 ms 4984 KB Output is correct
9 Correct 7 ms 5088 KB Output is correct
10 Correct 6 ms 4984 KB Output is correct

Subtask #2
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 5112 KB Output is correct
2 Correct 7 ms 4984 KB Output is correct
3 Correct 7 ms 4988 KB Output is correct
4 Correct 7 ms 4984 KB Output is correct
5 Correct 8 ms 4984 KB Output is correct
6 Correct 7 ms 5088 KB Output is correct
7 Correct 7 ms 4984 KB Output is correct
8 Correct 7 ms 4984 KB Output is correct
9 Correct 7 ms 5016 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 5004 KB Output is correct
13 Correct 10 ms 4984 KB Output is correct
14 Correct 7 ms 5100 KB Output is correct
15 Correct 10 ms 5136 KB Output is correct
16 Correct 48 ms 5108 KB Output is correct
17 Correct 7 ms 4984 KB Output is correct
18 Correct 52 ms 5228 KB Output is correct
19 Correct 8 ms 4984 KB Output is correct
20 Correct 23 ms 5112 KB Output is correct
21 Correct 17 ms 5060 KB Output is correct
22 Correct 12 ms 4984 KB Output is correct
23 Correct 8 ms 4984 KB Output is correct
24 Correct 7 ms 4984 KB Output is correct
25 Correct 34 ms 4984 KB Output is correct
26 Correct 20 ms 5188 KB Output is correct
27 Correct 9 ms 4984 KB Output is correct
28 Correct 31 ms 5228 KB Output is correct
29 Correct 27 ms 5108 KB Output is correct
30 Correct 54 ms 5112 KB Output is correct
31 Correct 7 ms 5008 KB Output is correct
32 Correct 8 ms 5020 KB Output is correct
33 Correct 6 ms 4984 KB Output is correct
34 Correct 22 ms 5112 KB Output is correct
35 Correct 8 ms 4984 KB Output is correct
36 Correct 19 ms 5012 KB Output is correct
37 Correct 8 ms 4984 KB Output is correct
38 Correct 7 ms 4904 KB Output is correct
39 Correct 19 ms 5152 KB Output is correct
40 Correct 44 ms 5132 KB Output is correct
41 Correct 21 ms 5092 KB Output is correct
42 Correct 31 ms 4984 KB Output is correct
43 Correct 31 ms 4988 KB Output is correct
44 Correct 24 ms 5128 KB Output is correct
45 Correct 14 ms 5052 KB Output is correct
46 Correct 7 ms 4984 KB Output is correct
47 Correct 27 ms 4948 KB Output is correct
48 Correct 46 ms 5056 KB Output is correct
49 Correct 8 ms 5128 KB Output is correct
50 Correct 33 ms 5228 KB Output is correct
51 Correct 25 ms 5160 KB Output is correct
52 Correct 7 ms 4984 KB Output is correct
53 Correct 8 ms 5012 KB Output is correct
54 Correct 23 ms 4984 KB Output is correct
55 Correct 6 ms 5012 KB Output is correct
56 Correct 51 ms 5224 KB Output is correct
57 Correct 27 ms 5108 KB Output is correct
58 Correct 46 ms 5020 KB Output is correct
59 Correct 34 ms 5084 KB Output is correct
60 Correct 28 ms 5112 KB Output is correct
61 Correct 8 ms 4984 KB Output is correct
62 Correct 7 ms 5004 KB Output is correct
63 Correct 7 ms 5120 KB Output is correct
64 Correct 7 ms 5120 KB Output is correct
65 Correct 7 ms 4984 KB Output is correct
66 Correct 11 ms 4984 KB Output is correct
67 Correct 5 ms 5120 KB Output is correct
68 Correct 10 ms 4988 KB Output is correct
69 Correct 11 ms 5112 KB Output is correct
70 Correct 8 ms 4984 KB Output is correct
71 Correct 60 ms 5084 KB Output is correct
72 Correct 9 ms 5028 KB Output is correct
73 Correct 54 ms 5112 KB Output is correct
74 Correct 51 ms 5196 KB Output is correct
75 Correct 8 ms 4984 KB Output is correct
76 Correct 47 ms 5168 KB Output is correct
77 Correct 60 ms 5068 KB Output is correct
78 Correct 11 ms 4984 KB Output is correct
79 Correct 22 ms 5184 KB Output is correct
80 Correct 65 ms 5112 KB Output is correct
81 Correct 35 ms 5240 KB Output is correct
82 Correct 60 ms 5160 KB Output is correct
83 Correct 10 ms 4984 KB Output is correct
84 Correct 39 ms 5080 KB Output is correct
85 Correct 56 ms 5116 KB Output is correct
86 Correct 12 ms 5004 KB Output is correct
87 Correct 7 ms 5020 KB Output is correct
88 Correct 9 ms 5120 KB Output is correct
89 Correct 10 ms 5032 KB Output is correct
90 Correct 6 ms 4984 KB Output is correct
91 Correct 10 ms 4984 KB Output is correct
92 Correct 6 ms 4904 KB Output is correct
93 Correct 9 ms 4984 KB Output is correct
94 Correct 10 ms 4984 KB Output is correct
95 Correct 11 ms 4984 KB Output is correct
96 Correct 10 ms 4984 KB Output is correct
97 Correct 6 ms 4984 KB Output is correct