답안 #152162

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
152162 2019-09-06T16:00:38 Z mieszko11b 커다란 상품 (IOI17_prize) C++14
97.64 / 100
77 ms 5392 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 worst_sum;

int find_in_segment(int a, int b, int ok) {
	if(!ok)
		return -1;
	
	int mid1 = (a + b) / 2;
	int mid2 = (a + b) / 2;
	
	while(ans(mid1).X + ans(mid1).Y != worst_sum && 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 != worst_sum && 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 pocz = 0, kon = n - 1;
	set<int> diff;
	while(pocz <= min(474, n) && diff.size() < 5) {
		worst_sum = max(worst_sum, ans(pocz).X + ans(pocz).Y);
		diff.insert(ans(pocz).X + ans(pocz).Y);
		if(ans(pocz).X + ans(pocz).Y == 0)
			return pocz;
		pocz++;
	}
	
	while(ans(pocz).X + ans(pocz).Y != worst_sum) {
		if(ans(pocz).X + ans(pocz).Y == 0)
			return pocz;
		pocz++;		
	}
	
	while(ans(kon).X + ans(kon).Y != worst_sum) {
		if(ans(kon).X + ans(kon).Y == 0)
			return kon;
		kon--;
	}
	
	pocz++;
	kon--;
	return find_in_segment(pocz, kon, ans(kon + 1).X - ans(pocz - 1).X);
}
# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 5028 KB Output is correct
2 Correct 12 ms 4984 KB Output is correct
3 Correct 12 ms 4984 KB Output is correct
4 Correct 11 ms 4984 KB Output is correct
5 Correct 12 ms 5092 KB Output is correct
6 Correct 7 ms 5112 KB Output is correct
7 Correct 9 ms 5128 KB Output is correct
8 Correct 9 ms 5128 KB Output is correct
9 Correct 11 ms 4984 KB Output is correct
10 Correct 11 ms 4988 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 5128 KB Output is correct
2 Correct 16 ms 5028 KB Output is correct
3 Correct 13 ms 4984 KB Output is correct
4 Correct 14 ms 4984 KB Output is correct
5 Correct 11 ms 4984 KB Output is correct
6 Correct 6 ms 4984 KB Output is correct
7 Correct 14 ms 5008 KB Output is correct
8 Correct 11 ms 5032 KB Output is correct
9 Correct 11 ms 5012 KB Output is correct
10 Correct 12 ms 4984 KB Output is correct
11 Correct 10 ms 5112 KB Output is correct
12 Correct 9 ms 5108 KB Output is correct
13 Correct 12 ms 5136 KB Output is correct
14 Correct 16 ms 4984 KB Output is correct
15 Correct 20 ms 5040 KB Output is correct
16 Correct 49 ms 5160 KB Output is correct
17 Correct 12 ms 4988 KB Output is correct
18 Partially correct 56 ms 5120 KB Partially correct - number of queries: 5046
19 Correct 11 ms 4984 KB Output is correct
20 Correct 19 ms 5164 KB Output is correct
21 Correct 27 ms 5128 KB Output is correct
22 Correct 14 ms 4984 KB Output is correct
23 Correct 9 ms 5128 KB Output is correct
24 Correct 12 ms 5100 KB Output is correct
25 Correct 31 ms 5112 KB Output is correct
26 Correct 21 ms 5196 KB Output is correct
27 Correct 13 ms 5032 KB Output is correct
28 Correct 48 ms 5376 KB Output is correct
29 Correct 29 ms 5132 KB Output is correct
30 Partially correct 62 ms 5164 KB Partially correct - number of queries: 5058
31 Correct 10 ms 5128 KB Output is correct
32 Correct 16 ms 5132 KB Output is correct
33 Correct 6 ms 4984 KB Output is correct
34 Correct 25 ms 5028 KB Output is correct
35 Correct 12 ms 4984 KB Output is correct
36 Correct 27 ms 5064 KB Output is correct
37 Correct 12 ms 4984 KB Output is correct
38 Correct 11 ms 4984 KB Output is correct
39 Correct 31 ms 4984 KB Output is correct
40 Correct 30 ms 5252 KB Output is correct
41 Correct 41 ms 5076 KB Output is correct
42 Correct 40 ms 5088 KB Output is correct
43 Correct 27 ms 5164 KB Output is correct
44 Correct 29 ms 5052 KB Output is correct
45 Correct 29 ms 5112 KB Output is correct
46 Correct 12 ms 5016 KB Output is correct
47 Correct 40 ms 5080 KB Output is correct
48 Correct 49 ms 5160 KB Output is correct
49 Correct 10 ms 4984 KB Output is correct
50 Partially correct 52 ms 5160 KB Partially correct - number of queries: 5097
51 Correct 28 ms 4988 KB Output is correct
52 Correct 11 ms 4984 KB Output is correct
53 Correct 10 ms 5136 KB Output is correct
54 Correct 30 ms 4984 KB Output is correct
55 Correct 11 ms 4984 KB Output is correct
56 Partially correct 33 ms 5288 KB Partially correct - number of queries: 5093
57 Correct 26 ms 5128 KB Output is correct
58 Correct 26 ms 5228 KB Output is correct
59 Correct 46 ms 5220 KB Output is correct
60 Correct 49 ms 5100 KB Output is correct
61 Correct 12 ms 5004 KB Output is correct
62 Correct 13 ms 5004 KB Output is correct
63 Correct 19 ms 5032 KB Output is correct
64 Correct 13 ms 5032 KB Output is correct
65 Correct 9 ms 5028 KB Output is correct
66 Correct 12 ms 4984 KB Output is correct
67 Correct 18 ms 5012 KB Output is correct
68 Correct 11 ms 4984 KB Output is correct
69 Correct 10 ms 5024 KB Output is correct
70 Correct 14 ms 4984 KB Output is correct
71 Partially correct 56 ms 5160 KB Partially correct - number of queries: 5236
72 Correct 17 ms 5032 KB Output is correct
73 Partially correct 77 ms 5156 KB Partially correct - number of queries: 5173
74 Partially correct 46 ms 5392 KB Partially correct - number of queries: 5200
75 Correct 14 ms 4984 KB Output is correct
76 Correct 53 ms 5276 KB Output is correct
77 Partially correct 43 ms 5088 KB Partially correct - number of queries: 5214
78 Correct 11 ms 5016 KB Output is correct
79 Correct 30 ms 4984 KB Output is correct
80 Partially correct 64 ms 5160 KB Partially correct - number of queries: 5217
81 Partially correct 59 ms 5244 KB Partially correct - number of queries: 5172
82 Partially correct 55 ms 5112 KB Partially correct - number of queries: 5178
83 Correct 11 ms 4984 KB Output is correct
84 Correct 51 ms 5108 KB Output is correct
85 Partially correct 64 ms 5240 KB Partially correct - number of queries: 5175
86 Correct 13 ms 4984 KB Output is correct
87 Correct 6 ms 5020 KB Output is correct
88 Correct 12 ms 5112 KB Output is correct
89 Correct 9 ms 5012 KB Output is correct
90 Correct 14 ms 4956 KB Output is correct
91 Correct 11 ms 5112 KB Output is correct
92 Correct 9 ms 4944 KB Output is correct
93 Correct 17 ms 4984 KB Output is correct
94 Correct 16 ms 5108 KB Output is correct
95 Correct 16 ms 4984 KB Output is correct
96 Correct 14 ms 5040 KB Output is correct
97 Correct 11 ms 5112 KB Output is correct