oj.uz

답안 #122832

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
122832 2019-06-29T10:49:41 Z SirCeness 커다란 상품 (IOI17_prize) C++14
100 / 100
 77 ms 2808 KB 
#include <bits/stdc++.h>
 
#define pb push_back
#define mp make_pair
#include "prize.h"
using namespace std;
typedef long long ll;
 
int arr[200005];
int n;
pair<int, int> anslar[200005];
int maxx;
int soncevap = -1;
// 22
 
vector<int> get(int k){
	//cout << "get(" << k << ")" << endl;
	vector<int> ans(2);
	if (anslar[k].first == -1){
		ans = ask(k);
		anslar[k] = mp(ans[0], ans[1]);
		if (ans[0] + ans[1] == 0){
			soncevap = k;
			//cout << "cevabim: " << k << endl;
			//cout << ans[0] << " - " << ans[1] << endl;
		}
	}
	ans[0] = anslar[k].first;
	ans[1] = anslar[k].second;
	//cout << "return " << ans[0] << ", " << ans[1] << endl;
	return ans;
}
 
 
int find_best(int size){
	n = size;
	for (int i = 0; i < size; i++) arr[i] = i;
	for (int i = 0; i < 200005; i++) anslar[i] = mp(-1, -1);
	
	maxx = 1;
	for (int i = 0; i <= min(474, n); i++){
		vector<int> ans = get(i);
		if(soncevap != -1) return soncevap;
		maxx = max(ans[0] + ans[1], maxx);
		if (maxx > sqrt(n)) break;
	}
	
	//cout << "maxx: " << maxx << endl;
	
	for (int i = 0; i < maxx; i++){
		//cout << "i: " << i << endl;
		int l = 0;
		int r = n-1;
		while (l < r){
			int m = (l+r+1)/2;
			vector<int> ans = get(m);
			if(soncevap != -1) return soncevap;
			while (ans[0] + ans[1] != maxx && l < m){
				m--;
				ans = get(m);
				if(soncevap != -1) return soncevap;
			}
			if (l == m) break;
			if (ans[0] > i) r = m-1;
			else l = m;
		}
		//cout << "find: " << l << endl;
		vector<int> ans = get(l);
		if(soncevap != -1) return soncevap;
		if (ans[0] + ans[1] == maxx) l++;
		if (l >= n) continue;
		while (anslar[l].first != -1 && l < n){
			if (anslar[l].first + anslar[l].second == maxx) break;
			l++;
		}
		if (l >= n) continue;
		ans = get(l);
		if(soncevap != -1) return soncevap;
		
	}
	
	//cout << "size: " << vec.size() << endl;
	assert(soncevap != -1);
	return soncevap;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 2680 KB Output is correct
2 Correct 9 ms 2680 KB Output is correct
3 Correct 9 ms 2552 KB Output is correct
4 Correct 8 ms 2552 KB Output is correct
5 Correct 9 ms 2652 KB Output is correct
6 Correct 4 ms 2680 KB Output is correct
7 Correct 8 ms 2552 KB Output is correct
8 Correct 6 ms 2704 KB Output is correct
9 Correct 8 ms 2552 KB Output is correct
10 Correct 9 ms 2556 KB Output is correct

Subtask #2
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 2724 KB Output is correct
2 Correct 9 ms 2552 KB Output is correct
3 Correct 9 ms 2552 KB Output is correct
4 Correct 6 ms 2616 KB Output is correct
5 Correct 8 ms 2552 KB Output is correct
6 Correct 4 ms 2744 KB Output is correct
7 Correct 9 ms 2552 KB Output is correct
8 Correct 10 ms 2552 KB Output is correct
9 Correct 7 ms 2552 KB Output is correct
10 Correct 10 ms 2552 KB Output is correct
11 Correct 11 ms 2552 KB Output is correct
12 Correct 8 ms 2616 KB Output is correct
13 Correct 15 ms 2680 KB Output is correct
14 Correct 10 ms 2040 KB Output is correct
15 Correct 14 ms 2552 KB Output is correct
16 Correct 46 ms 2624 KB Output is correct
17 Correct 4 ms 2552 KB Output is correct
18 Correct 29 ms 2700 KB Output is correct
19 Correct 6 ms 2680 KB Output is correct
20 Correct 9 ms 2324 KB Output is correct
21 Correct 25 ms 2552 KB Output is correct
22 Correct 10 ms 2680 KB Output is correct
23 Correct 9 ms 2552 KB Output is correct
24 Correct 10 ms 2552 KB Output is correct
25 Correct 26 ms 2552 KB Output is correct
26 Correct 26 ms 2552 KB Output is correct
27 Correct 9 ms 2680 KB Output is correct
28 Correct 47 ms 2552 KB Output is correct
29 Correct 35 ms 2552 KB Output is correct
30 Correct 54 ms 2552 KB Output is correct
31 Correct 4 ms 2552 KB Output is correct
32 Correct 14 ms 2552 KB Output is correct
33 Correct 3 ms 1784 KB Output is correct
34 Correct 18 ms 2552 KB Output is correct
35 Correct 9 ms 2708 KB Output is correct
36 Correct 14 ms 2552 KB Output is correct
37 Correct 7 ms 2808 KB Output is correct
38 Correct 8 ms 2600 KB Output is correct
39 Correct 26 ms 2552 KB Output is correct
40 Correct 53 ms 2620 KB Output is correct
41 Correct 29 ms 2552 KB Output is correct
42 Correct 31 ms 2620 KB Output is correct
43 Correct 24 ms 2600 KB Output is correct
44 Correct 13 ms 2616 KB Output is correct
45 Correct 16 ms 2680 KB Output is correct
46 Correct 4 ms 2552 KB Output is correct
47 Correct 15 ms 2552 KB Output is correct
48 Correct 35 ms 2604 KB Output is correct
49 Correct 8 ms 2552 KB Output is correct
50 Correct 49 ms 2620 KB Output is correct
51 Correct 23 ms 2552 KB Output is correct
52 Correct 4 ms 2624 KB Output is correct
53 Correct 10 ms 2552 KB Output is correct
54 Correct 14 ms 2680 KB Output is correct
55 Correct 4 ms 2600 KB Output is correct
56 Correct 48 ms 2552 KB Output is correct
57 Correct 35 ms 2604 KB Output is correct
58 Correct 25 ms 2600 KB Output is correct
59 Correct 27 ms 2556 KB Output is correct
60 Correct 17 ms 2680 KB Output is correct
61 Correct 10 ms 2680 KB Output is correct
62 Correct 8 ms 2552 KB Output is correct
63 Correct 11 ms 2552 KB Output is correct
64 Correct 10 ms 2552 KB Output is correct
65 Correct 9 ms 2552 KB Output is correct
66 Correct 12 ms 2552 KB Output is correct
67 Correct 4 ms 2552 KB Output is correct
68 Correct 9 ms 2624 KB Output is correct
69 Correct 10 ms 2616 KB Output is correct
70 Correct 9 ms 2552 KB Output is correct
71 Correct 48 ms 2552 KB Output is correct
72 Correct 17 ms 2552 KB Output is correct
73 Correct 61 ms 2616 KB Output is correct
74 Correct 68 ms 2680 KB Output is correct
75 Correct 11 ms 2552 KB Output is correct
76 Correct 52 ms 2552 KB Output is correct
77 Correct 52 ms 2680 KB Output is correct
78 Correct 9 ms 2680 KB Output is correct
79 Correct 34 ms 2552 KB Output is correct
80 Correct 30 ms 2728 KB Output is correct
81 Correct 77 ms 2552 KB Output is correct
82 Correct 50 ms 2552 KB Output is correct
83 Correct 8 ms 2552 KB Output is correct
84 Correct 33 ms 2708 KB Output is correct
85 Correct 51 ms 2680 KB Output is correct
86 Correct 16 ms 2552 KB Output is correct
87 Correct 7 ms 2704 KB Output is correct
88 Correct 16 ms 2552 KB Output is correct
89 Correct 20 ms 2552 KB Output is correct
90 Correct 10 ms 2552 KB Output is correct
91 Correct 9 ms 2680 KB Output is correct
92 Correct 13 ms 2808 KB Output is correct
93 Correct 19 ms 2552 KB Output is correct
94 Correct 19 ms 2552 KB Output is correct
95 Correct 19 ms 2552 KB Output is correct
96 Correct 18 ms 2680 KB Output is correct
97 Correct 16 ms 2552 KB Output is correct