oj.uz

Submission #65028

# Submission time Handle Problem Language Result Execution time Memory
65028 2018-08-06T13:11:25 Z nvmdava The Big Prize (IOI17_prize) C++17
20 / 100
 93 ms 5716 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";
			return 0;
		}
		
		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:68: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 9 ms 4984 KB Output is correct
2 Correct 7 ms 5048 KB Output is correct
3 Correct 8 ms 5248 KB Output is correct
4 Correct 8 ms 5248 KB Output is correct
5 Correct 8 ms 5248 KB Output is correct
6 Correct 7 ms 5248 KB Output is correct
7 Correct 7 ms 5248 KB Output is correct
8 Correct 8 ms 5268 KB Output is correct
9 Correct 7 ms 5268 KB Output is correct
10 Correct 6 ms 5268 KB Output is correct

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5268 KB Output is correct
2 Correct 8 ms 5268 KB Output is correct
3 Correct 8 ms 5268 KB Output is correct
4 Correct 7 ms 5268 KB Output is correct
5 Correct 7 ms 5268 KB Output is correct
6 Correct 7 ms 5268 KB Output is correct
7 Correct 8 ms 5268 KB Output is correct
8 Correct 8 ms 5268 KB Output is correct
9 Correct 6 ms 5268 KB Output is correct
10 Correct 7 ms 5268 KB Output is correct
11 Correct 11 ms 5268 KB Output is correct
12 Correct 14 ms 5268 KB Output is correct
13 Correct 12 ms 5268 KB Output is correct
14 Correct 16 ms 5312 KB Output is correct
15 Correct 46 ms 5564 KB Output is correct
16 Correct 42 ms 5564 KB Output is correct
17 Correct 46 ms 5692 KB Output is correct
18 Correct 39 ms 5692 KB Output is correct
19 Correct 47 ms 5692 KB Output is correct
20 Correct 45 ms 5692 KB Output is correct
21 Correct 67 ms 5692 KB Output is correct
22 Correct 41 ms 5692 KB Output is correct
23 Correct 7 ms 5692 KB Output is correct
24 Correct 13 ms 5692 KB Output is correct
25 Correct 61 ms 5692 KB Output is correct
26 Correct 54 ms 5692 KB Output is correct
27 Correct 8 ms 5692 KB Output is correct
28 Correct 45 ms 5692 KB Output is correct
29 Correct 41 ms 5692 KB Output is correct
30 Correct 49 ms 5692 KB Output is correct
31 Correct 32 ms 5692 KB Output is correct
32 Correct 13 ms 5692 KB Output is correct
33 Correct 8 ms 5692 KB Output is correct
34 Correct 40 ms 5692 KB Output is correct
35 Correct 13 ms 5692 KB Output is correct
36 Correct 43 ms 5692 KB Output is correct
37 Correct 12 ms 5692 KB Output is correct
38 Correct 7 ms 5692 KB Output is correct
39 Correct 21 ms 5692 KB Output is correct
40 Correct 57 ms 5692 KB Output is correct
41 Correct 66 ms 5692 KB Output is correct
42 Correct 62 ms 5692 KB Output is correct
43 Correct 43 ms 5692 KB Output is correct
44 Correct 75 ms 5692 KB Output is correct
45 Correct 32 ms 5692 KB Output is correct
46 Correct 40 ms 5692 KB Output is correct
47 Correct 46 ms 5692 KB Output is correct
48 Correct 48 ms 5692 KB Output is correct
49 Correct 29 ms 5692 KB Output is correct
50 Correct 50 ms 5692 KB Output is correct
51 Correct 76 ms 5692 KB Output is correct
52 Correct 61 ms 5692 KB Output is correct
53 Correct 9 ms 5692 KB Output is correct
54 Correct 54 ms 5692 KB Output is correct
55 Correct 83 ms 5692 KB Output is correct
56 Correct 44 ms 5692 KB Output is correct
57 Correct 41 ms 5692 KB Output is correct
58 Correct 74 ms 5692 KB Output is correct
59 Correct 56 ms 5692 KB Output is correct
60 Correct 36 ms 5692 KB Output is correct
61 Correct 11 ms 5692 KB Output is correct
62 Correct 11 ms 5692 KB Output is correct
63 Correct 9 ms 5692 KB Output is correct
64 Correct 10 ms 5692 KB Output is correct
65 Correct 7 ms 5692 KB Output is correct
66 Correct 7 ms 5692 KB Output is correct
67 Correct 8 ms 5692 KB Output is correct
68 Correct 8 ms 5692 KB Output is correct
69 Correct 8 ms 5692 KB Output is correct
70 Correct 8 ms 5692 KB Output is correct
71 Correct 67 ms 5692 KB Output is correct
72 Correct 10 ms 5692 KB Output is correct
73 Correct 93 ms 5716 KB Output is correct
74 Correct 70 ms 5716 KB Output is correct
75 Correct 9 ms 5716 KB Output is correct
76 Correct 47 ms 5716 KB Output is correct
77 Correct 35 ms 5716 KB Output is correct
78 Correct 11 ms 5716 KB Output is correct
79 Incorrect 29 ms 5716 KB Token "ERTB" doesn't correspond to pattern "[A-B]{1}"
80 Halted 0 ms 0 KB -