oj.uz

답안 #122736

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
122736 2019-06-29T07:48:05 Z SirCeness 커다란 상품 (IOI17_prize) C++14
20 / 100
 97 ms 2728 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;
int tmp[200005];
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;
	}
	ans[0] = anslar[k].first;
	ans[1] = anslar[k].second;
	return ans;
}


int find_best(int size){
	n = size;
	for (int i = 0; i < size; i++) arr[i] = i;
	for (int i = 0; i < n; i++) anslar[i] = mp(-1, -1);
	
	srand(time(0));
	maxx = 0;
	for (int i = 0; i < min(50, n); i++){
		vector<int> ans = get(rand()%n);
		if(soncevap != -1) return soncevap;
		maxx = max(ans[0] + ans[1], maxx);
		if (maxx >= sqrt(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;
		ans = get(l);
		if(soncevap != -1) return soncevap;
		while (ans[0] + ans[1] != maxx){
			l++;
			if (l >= n) break;
			ans = get(l);
			if(soncevap != -1) return soncevap;
		}
	}
	
	//cout << "size: " << vec.size() << endl;
	
	return soncevap;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 2616 KB Output is correct
2 Correct 4 ms 2616 KB Output is correct
3 Correct 5 ms 2620 KB Output is correct
4 Correct 4 ms 2552 KB Output is correct
5 Correct 4 ms 2564 KB Output is correct
6 Correct 4 ms 2552 KB Output is correct
7 Correct 4 ms 2552 KB Output is correct
8 Correct 4 ms 2552 KB Output is correct
9 Correct 5 ms 2696 KB Output is correct
10 Correct 4 ms 2552 KB Output is correct
11 Correct 5 ms 2700 KB Output is correct
12 Correct 4 ms 2616 KB Output is correct
13 Correct 10 ms 2552 KB Output is correct
14 Correct 4 ms 504 KB Output is correct
15 Correct 7 ms 2620 KB Output is correct
16 Correct 41 ms 2552 KB Output is correct
17 Correct 4 ms 2620 KB Output is correct
18 Correct 50 ms 2696 KB Output is correct
19 Correct 4 ms 2552 KB Output is correct
20 Correct 11 ms 1528 KB Output is correct
21 Correct 13 ms 2612 KB Output is correct
22 Correct 8 ms 2552 KB Output is correct
23 Correct 4 ms 2616 KB Output is correct
24 Correct 4 ms 2552 KB Output is correct
25 Correct 22 ms 2620 KB Output is correct
26 Correct 16 ms 2612 KB Output is correct
27 Correct 5 ms 2696 KB Output is correct
28 Correct 27 ms 2612 KB Output is correct
29 Correct 39 ms 2620 KB Output is correct
30 Correct 36 ms 2564 KB Output is correct
31 Correct 4 ms 2616 KB Output is correct
32 Correct 9 ms 2556 KB Output is correct
33 Correct 2 ms 248 KB Output is correct
34 Correct 12 ms 2700 KB Output is correct
35 Correct 5 ms 2612 KB Output is correct
36 Correct 10 ms 2700 KB Output is correct
37 Correct 5 ms 2552 KB Output is correct
38 Correct 5 ms 2552 KB Output is correct
39 Correct 24 ms 2552 KB Output is correct
40 Correct 46 ms 2600 KB Output is correct
41 Correct 27 ms 2616 KB Output is correct
42 Correct 31 ms 2600 KB Output is correct
43 Correct 26 ms 2620 KB Output is correct
44 Correct 23 ms 2552 KB Output is correct
45 Correct 16 ms 2680 KB Output is correct
46 Correct 4 ms 2616 KB Output is correct
47 Correct 20 ms 2552 KB Output is correct
48 Correct 22 ms 2552 KB Output is correct
49 Correct 5 ms 2616 KB Output is correct
50 Correct 47 ms 2616 KB Output is correct
51 Correct 13 ms 2620 KB Output is correct
52 Correct 4 ms 2552 KB Output is correct
53 Correct 5 ms 2616 KB Output is correct
54 Correct 22 ms 2616 KB Output is correct
55 Correct 4 ms 2552 KB Output is correct
56 Correct 53 ms 2612 KB Output is correct
57 Correct 38 ms 2552 KB Output is correct
58 Correct 22 ms 2620 KB Output is correct
59 Correct 26 ms 2552 KB Output is correct
60 Correct 27 ms 2552 KB Output is correct
61 Correct 5 ms 2552 KB Output is correct
62 Correct 4 ms 2700 KB Output is correct
63 Correct 6 ms 2552 KB Output is correct
64 Correct 4 ms 2680 KB Output is correct
65 Correct 4 ms 2616 KB Output is correct
66 Correct 9 ms 2624 KB Output is correct
67 Correct 5 ms 2696 KB Output is correct
68 Correct 9 ms 2616 KB Output is correct
69 Correct 6 ms 2700 KB Output is correct
70 Correct 4 ms 2612 KB Output is correct
71 Correct 55 ms 2680 KB Output is correct
72 Correct 9 ms 2580 KB Output is correct
73 Correct 51 ms 2552 KB Output is correct
74 Correct 53 ms 2680 KB Output is correct
75 Correct 5 ms 2552 KB Output is correct
76 Correct 45 ms 2700 KB Output is correct
77 Correct 51 ms 2552 KB Output is correct
78 Correct 9 ms 2552 KB Output is correct
79 Correct 29 ms 2680 KB Output is correct
80 Correct 45 ms 2680 KB Output is correct
81 Correct 39 ms 2680 KB Output is correct
82 Correct 60 ms 2552 KB Output is correct
83 Correct 6 ms 2552 KB Output is correct
84 Correct 54 ms 2552 KB Output is correct
85 Correct 40 ms 2728 KB Output is correct
86 Incorrect 97 ms 2552 KB Incorrect
87 Halted 0 ms 0 KB -