oj.uz

Submission #64625

# Submission time Handle Problem Language Result Execution time Memory
64625 2018-08-05T05:22:48 Z nvmdava The Big Prize (IOI17_prize) C++17
20 / 100
 1000 ms 5672 KB 
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;

vector<int> ans[200001];
map<int, set<int> > v;
int L, R;
int find_best(int n) {
	L = 0;
	R = n - 1;
	queue<pair<int, int> > q;
	q.push(make_pair(L, R));
	int l, r, m;
	while(!q.empty()){
		l = q.front().first;
		r = q.front().second;
		q.pop();
		if(L > r ||  l > R || l > r){
			continue;
		}
		m = (l + r) >> 1;
		if(ans[m].size() == 0)ans[m] = ask(m);
		if(ans[m][0] + ans[m][1] == 0){
			return m;
		}
		
		v[ans[m][0] + ans[m][1]].insert(m);
		auto it = v.find(ans[m][0] + ans[m][1]);
		auto loc = it -> second.find(m);
		bool in = 0;
		auto tmp = loc;
		while(tmp != it -> second.begin()){
			if(ans[m][0] != ans[*tmp][0]){
				in = 1;
				tmp++;
				q.push(make_pair(l, *tmp));
				break;
			}
			tmp--;
			
		}
		if(in == 0){
			tmp = it->second.begin();
			q.push(make_pair(l, *tmp - 1));
		} else {
			in = 0;
		}
		tmp = loc;
		while(tmp != it -> second.end()){
			if(ans[m][0] != ans[*tmp][0]){
				in = 1;
				tmp--;
				q.push(make_pair(*tmp, r));
				break;
			}
			tmp++;
		}
		if(in == 0){
			tmp = it->second.end();
			tmp--;
			q.push(make_pair(*tmp + 1, r));
		}
	}
}

Compilation message

prize.cpp: In function 'int find_best(int)':
prize.cpp:64:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4984 KB Output is correct
2 Correct 9 ms 5072 KB Output is correct
3 Correct 7 ms 5124 KB Output is correct
4 Correct 9 ms 5200 KB Output is correct
5 Correct 6 ms 5200 KB Output is correct
6 Correct 7 ms 5200 KB Output is correct
7 Correct 7 ms 5200 KB Output is correct
8 Correct 7 ms 5256 KB Output is correct
9 Correct 7 ms 5256 KB Output is correct
10 Correct 7 ms 5256 KB Output is correct

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 5256 KB Output is correct
2 Correct 9 ms 5256 KB Output is correct
3 Correct 8 ms 5256 KB Output is correct
4 Correct 9 ms 5260 KB Output is correct
5 Correct 9 ms 5260 KB Output is correct
6 Correct 8 ms 5260 KB Output is correct
7 Correct 9 ms 5260 KB Output is correct
8 Correct 7 ms 5260 KB Output is correct
9 Correct 6 ms 5260 KB Output is correct
10 Correct 8 ms 5260 KB Output is correct
11 Correct 14 ms 5260 KB Output is correct
12 Correct 12 ms 5260 KB Output is correct
13 Correct 13 ms 5260 KB Output is correct
14 Correct 16 ms 5308 KB Output is correct
15 Correct 51 ms 5564 KB Output is correct
16 Correct 41 ms 5604 KB Output is correct
17 Correct 74 ms 5604 KB Output is correct
18 Correct 44 ms 5604 KB Output is correct
19 Correct 46 ms 5604 KB Output is correct
20 Correct 34 ms 5604 KB Output is correct
21 Correct 71 ms 5604 KB Output is correct
22 Correct 42 ms 5604 KB Output is correct
23 Correct 8 ms 5604 KB Output is correct
24 Correct 11 ms 5604 KB Output is correct
25 Correct 41 ms 5604 KB Output is correct
26 Correct 27 ms 5604 KB Output is correct
27 Correct 10 ms 5604 KB Output is correct
28 Correct 30 ms 5604 KB Output is correct
29 Correct 45 ms 5604 KB Output is correct
30 Correct 38 ms 5604 KB Output is correct
31 Correct 41 ms 5604 KB Output is correct
32 Correct 15 ms 5604 KB Output is correct
33 Correct 6 ms 5604 KB Output is correct
34 Correct 43 ms 5604 KB Output is correct
35 Correct 12 ms 5604 KB Output is correct
36 Correct 52 ms 5604 KB Output is correct
37 Correct 13 ms 5604 KB Output is correct
38 Correct 8 ms 5604 KB Output is correct
39 Correct 22 ms 5604 KB Output is correct
40 Correct 73 ms 5604 KB Output is correct
41 Correct 45 ms 5604 KB Output is correct
42 Correct 66 ms 5656 KB Output is correct
43 Correct 43 ms 5656 KB Output is correct
44 Correct 59 ms 5656 KB Output is correct
45 Correct 59 ms 5656 KB Output is correct
46 Correct 35 ms 5672 KB Output is correct
47 Correct 31 ms 5672 KB Output is correct
48 Correct 46 ms 5672 KB Output is correct
49 Correct 47 ms 5672 KB Output is correct
50 Correct 49 ms 5672 KB Output is correct
51 Correct 50 ms 5672 KB Output is correct
52 Correct 59 ms 5672 KB Output is correct
53 Correct 10 ms 5672 KB Output is correct
54 Correct 50 ms 5672 KB Output is correct
55 Correct 42 ms 5672 KB Output is correct
56 Correct 53 ms 5672 KB Output is correct
57 Correct 46 ms 5672 KB Output is correct
58 Correct 56 ms 5672 KB Output is correct
59 Correct 44 ms 5672 KB Output is correct
60 Correct 58 ms 5672 KB Output is correct
61 Correct 8 ms 5672 KB Output is correct
62 Correct 11 ms 5672 KB Output is correct
63 Correct 9 ms 5672 KB Output is correct
64 Correct 9 ms 5672 KB Output is correct
65 Correct 9 ms 5672 KB Output is correct
66 Correct 8 ms 5672 KB Output is correct
67 Correct 7 ms 5672 KB Output is correct
68 Correct 8 ms 5672 KB Output is correct
69 Correct 8 ms 5672 KB Output is correct
70 Correct 9 ms 5672 KB Output is correct
71 Correct 74 ms 5672 KB Output is correct
72 Correct 10 ms 5672 KB Output is correct
73 Correct 71 ms 5672 KB Output is correct
74 Correct 60 ms 5672 KB Output is correct
75 Correct 9 ms 5672 KB Output is correct
76 Correct 48 ms 5672 KB Output is correct
77 Correct 76 ms 5672 KB Output is correct
78 Correct 16 ms 5672 KB Output is correct
79 Execution timed out 1043 ms 5672 KB Time limit exceeded
80 Halted 0 ms 0 KB -