oj.uz

Submission #65027

# Submission time Handle Problem Language Result Execution time Memory
65027 2018-08-06T13:10:05 Z nvmdava The Big Prize (IOI17_prize) C++17
20 / 100
 1000 ms 5648 KB 
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
 
vector<int> ans[200001];
map<int, set<int> > v;
int L, R, counter = 0;
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;
		}
		counter++;
		if(counter == 10000){
			cout<<"ERT";
		}
		
		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:67: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 8 ms 4984 KB Output is correct
2 Correct 9 ms 5176 KB Output is correct
3 Correct 7 ms 5176 KB Output is correct
4 Correct 7 ms 5176 KB Output is correct
5 Correct 6 ms 5176 KB Output is correct
6 Correct 7 ms 5176 KB Output is correct
7 Correct 6 ms 5176 KB Output is correct
8 Correct 7 ms 5240 KB Output is correct
9 Correct 6 ms 5256 KB Output is correct
10 Correct 8 ms 5256 KB Output is correct

Subtask #2
0 / 80.0

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