Submission #65026

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
65026	2018-08-06T13:09:29 Z	nvmdava	The Big Prize (IOI17_prize)	C++17	20 / 100	67 ms	5652 KB

prize

#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()){
		counter++;
		if(counter == 10000){
			cout<<"ERT";
		}
		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: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	7 ms	4984 KB	Output is correct
2	Correct	8 ms	5072 KB	Output is correct
3	Correct	7 ms	5124 KB	Output is correct
4	Correct	6 ms	5176 KB	Output is correct
5	Correct	8 ms	5176 KB	Output is correct
6	Correct	10 ms	5176 KB	Output is correct
7	Correct	8 ms	5176 KB	Output is correct
8	Correct	7 ms	5248 KB	Output is correct
9	Correct	7 ms	5248 KB	Output is correct
10	Correct	8 ms	5248 KB	Output is correct

Subtask #2

0 / 80.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	7 ms	5248 KB	Output is correct
2	Correct	8 ms	5248 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	7 ms	5248 KB	Output is correct
9	Correct	8 ms	5248 KB	Output is correct
10	Correct	7 ms	5248 KB	Output is correct
11	Correct	11 ms	5248 KB	Output is correct
12	Correct	10 ms	5248 KB	Output is correct
13	Correct	10 ms	5248 KB	Output is correct
14	Correct	17 ms	5308 KB	Output is correct
15	Correct	53 ms	5468 KB	Output is correct
16	Correct	49 ms	5580 KB	Output is correct
17	Correct	32 ms	5628 KB	Output is correct
18	Correct	49 ms	5628 KB	Output is correct
19	Correct	39 ms	5628 KB	Output is correct
20	Correct	51 ms	5628 KB	Output is correct
21	Correct	62 ms	5652 KB	Output is correct
22	Correct	40 ms	5652 KB	Output is correct
23	Correct	8 ms	5652 KB	Output is correct
24	Correct	12 ms	5652 KB	Output is correct
25	Correct	28 ms	5652 KB	Output is correct
26	Correct	67 ms	5652 KB	Output is correct
27	Correct	12 ms	5652 KB	Output is correct
28	Correct	37 ms	5652 KB	Output is correct
29	Correct	60 ms	5652 KB	Output is correct
30	Correct	45 ms	5652 KB	Output is correct
31	Correct	29 ms	5652 KB	Output is correct
32	Correct	11 ms	5652 KB	Output is correct
33	Correct	7 ms	5652 KB	Output is correct
34	Correct	44 ms	5652 KB	Output is correct
35	Correct	8 ms	5652 KB	Output is correct
36	Correct	40 ms	5652 KB	Output is correct
37	Correct	12 ms	5652 KB	Output is correct
38	Correct	10 ms	5652 KB	Output is correct
39	Correct	22 ms	5652 KB	Output is correct
40	Correct	59 ms	5652 KB	Output is correct
41	Correct	27 ms	5652 KB	Output is correct
42	Correct	50 ms	5652 KB	Output is correct
43	Correct	44 ms	5652 KB	Output is correct
44	Incorrect	56 ms	5652 KB	Token "ERTA" doesn't correspond to pattern "[A-B]{1}"
45	Halted	0 ms	0 KB	-