Submission #39398

# Submission time Handle Problem Language Result Execution time Memory
39398 2018-01-13T19:03:56 Z mohammad_kilani The Big Prize (IOI17_prize) C++14
98.99 / 100
166 ms 16592 KB
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 200010;
#define oo 2000000000
bool asked[N];
vector<int> answer[N] , v;
vector< pair<int,int> > v2;
int mx = 0 ;

vector<int> get(int i){
	if(asked[i])
		return answer[i];
	asked[i] = true;
	answer[i] = ask(i);
	if(answer[i][0] + answer[i][1] == mx) v2.push_back(make_pair(answer[i][0],i)); else v.push_back(i);
	return answer[i];
}

int solve(int s,int e){
	int res = e;
	vector<int> v1 = get(s);
	while(e >= s){
		int mid = (s + e) / 2;
		vector<int> cur = get(mid);
		if(cur[0] + cur[1] == mx && cur[0] == v1[0])
			s = mid + 1;
		else {
			res = mid;
			e = mid - 1;
		}
	}
	return res;
}

int find_best(int n) {
	srand(time(0));
	int num = min(n,480);
	set < int > st;
	for(int i=0;i<n;i++) st.insert(i);
	for(int i=0;i<num;i++){
		int num = rand() % n;
		while(true){
			set < int > :: iterator it =st.lower_bound(num);
			if(it != st.end()){
				vector<int> res = get(*it);
				int cur = res[0] + res[1];
				mx = max(mx,cur);
				st.erase(it);
				break;
			}
			num = rand() % n;
		}
	}
	int low = 0;
	while(true){
		int high = n - 1;
		vector<int> cur = get(low);
		if(cur[0] + cur[1] == 0) return low;
		if(cur[0] + cur[1] != mx){
			low++;
			continue;
		}
		for(int i=0;i<v2.size();i++){
			if(v2[i].second >= low && v2[i].first != cur[0]){
				high = min(high,v2[i].second);
			}
			else if(v2[i].second >= low){
				low = max(low,v2[i].second);
			}
		}
		bool flag = false;
		for(int i=0;i<v.size();i++){
			vector<int> tmp = get(v[i]);
			if(tmp[0] + tmp[1] == 0) return v[i];
			if(v[i] > low){
				high = min(high,v[i]);
			}
		}
		if(flag) continue;
		low = solve(low,high);
	}
	return 0;
}

Compilation message

prize.cpp: In function 'int find_best(int)':
prize.cpp:64:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=0;i<v2.size();i++){
                ^
prize.cpp:73:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=0;i<v.size();i++){
                ^
# Verdict Execution time Memory Grader output
1 Correct 53 ms 16280 KB Output is correct
2 Correct 66 ms 16280 KB Output is correct
3 Correct 59 ms 16280 KB Output is correct
4 Correct 66 ms 16280 KB Output is correct
5 Correct 63 ms 16280 KB Output is correct
6 Correct 59 ms 16280 KB Output is correct
7 Correct 69 ms 16280 KB Output is correct
8 Correct 53 ms 16280 KB Output is correct
9 Correct 86 ms 16280 KB Output is correct
10 Correct 63 ms 16280 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 66 ms 16280 KB Output is correct
2 Correct 89 ms 16280 KB Output is correct
3 Correct 66 ms 16280 KB Output is correct
4 Correct 53 ms 16280 KB Output is correct
5 Correct 56 ms 16280 KB Output is correct
6 Correct 59 ms 16280 KB Output is correct
7 Correct 63 ms 16280 KB Output is correct
8 Correct 56 ms 16280 KB Output is correct
9 Correct 66 ms 16280 KB Output is correct
10 Correct 73 ms 16280 KB Output is correct
11 Correct 69 ms 16280 KB Output is correct
12 Correct 56 ms 16280 KB Output is correct
13 Correct 69 ms 16280 KB Output is correct
14 Correct 13 ms 7964 KB Output is correct
15 Correct 76 ms 16416 KB Output is correct
16 Correct 76 ms 16412 KB Output is correct
17 Correct 73 ms 16280 KB Output is correct
18 Correct 116 ms 16592 KB Output is correct
19 Correct 53 ms 16280 KB Output is correct
20 Correct 36 ms 11660 KB Output is correct
21 Correct 76 ms 16412 KB Output is correct
22 Correct 76 ms 16280 KB Output is correct
23 Correct 76 ms 16280 KB Output is correct
24 Correct 63 ms 16280 KB Output is correct
25 Correct 89 ms 16416 KB Output is correct
26 Correct 79 ms 16416 KB Output is correct
27 Correct 56 ms 16280 KB Output is correct
28 Correct 149 ms 16412 KB Output is correct
29 Correct 96 ms 16416 KB Output is correct
30 Correct 123 ms 16592 KB Output is correct
31 Correct 66 ms 16280 KB Output is correct
32 Correct 63 ms 16280 KB Output is correct
33 Correct 3 ms 6908 KB Output is correct
34 Correct 73 ms 16412 KB Output is correct
35 Correct 63 ms 16280 KB Output is correct
36 Correct 59 ms 16412 KB Output is correct
37 Correct 73 ms 16280 KB Output is correct
38 Correct 66 ms 16280 KB Output is correct
39 Correct 86 ms 16416 KB Output is correct
40 Correct 123 ms 16412 KB Output is correct
41 Correct 116 ms 16416 KB Output is correct
42 Correct 83 ms 16416 KB Output is correct
43 Correct 79 ms 16412 KB Output is correct
44 Correct 69 ms 16416 KB Output is correct
45 Correct 99 ms 16416 KB Output is correct
46 Correct 53 ms 16280 KB Output is correct
47 Correct 103 ms 16416 KB Output is correct
48 Correct 96 ms 16412 KB Output is correct
49 Correct 119 ms 16280 KB Output is correct
50 Correct 99 ms 16592 KB Output is correct
51 Correct 83 ms 16416 KB Output is correct
52 Correct 63 ms 16280 KB Output is correct
53 Correct 59 ms 16280 KB Output is correct
54 Correct 76 ms 16416 KB Output is correct
55 Correct 73 ms 16280 KB Output is correct
56 Correct 143 ms 16592 KB Output is correct
57 Correct 113 ms 16412 KB Output is correct
58 Correct 73 ms 16416 KB Output is correct
59 Correct 129 ms 16412 KB Output is correct
60 Correct 103 ms 16416 KB Output is correct
61 Correct 59 ms 16280 KB Output is correct
62 Correct 66 ms 16280 KB Output is correct
63 Correct 76 ms 16280 KB Output is correct
64 Correct 73 ms 16280 KB Output is correct
65 Correct 59 ms 16280 KB Output is correct
66 Correct 46 ms 16280 KB Output is correct
67 Correct 53 ms 16280 KB Output is correct
68 Correct 69 ms 16280 KB Output is correct
69 Correct 73 ms 16280 KB Output is correct
70 Correct 63 ms 16280 KB Output is correct
71 Correct 93 ms 16588 KB Output is correct
72 Correct 59 ms 16280 KB Output is correct
73 Correct 166 ms 16588 KB Output is correct
74 Correct 139 ms 16588 KB Output is correct
75 Correct 63 ms 16280 KB Output is correct
76 Correct 93 ms 16412 KB Output is correct
77 Partially correct 133 ms 16592 KB Partially correct - number of queries: 5101
78 Correct 56 ms 16280 KB Output is correct
79 Correct 76 ms 16412 KB Output is correct
80 Partially correct 89 ms 16592 KB Partially correct - number of queries: 5075
81 Partially correct 119 ms 16592 KB Partially correct - number of queries: 5065
82 Partially correct 89 ms 16592 KB Partially correct - number of queries: 5060
83 Correct 63 ms 16280 KB Output is correct
84 Correct 113 ms 16412 KB Output is correct
85 Partially correct 96 ms 16592 KB Partially correct - number of queries: 5073
86 Correct 83 ms 16424 KB Output is correct
87 Correct 59 ms 16280 KB Output is correct
88 Correct 119 ms 16424 KB Output is correct
89 Correct 96 ms 16424 KB Output is correct
90 Correct 66 ms 16280 KB Output is correct
91 Correct 86 ms 16420 KB Output is correct
92 Correct 66 ms 16280 KB Output is correct
93 Correct 56 ms 16412 KB Output is correct
94 Correct 69 ms 16412 KB Output is correct
95 Correct 96 ms 16412 KB Output is correct
96 Correct 86 ms 16412 KB Output is correct
97 Correct 46 ms 16280 KB Output is correct