oj.uz

Submission #610970

# Submission time Handle Problem Language Result Execution time Memory
610970 2022-07-28T20:32:37 Z Apiram The Big Prize (IOI17_prize) C++14
100 / 100
 47 ms 528 KB 
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> ask(int i);
int find_best(int n) {
	int ans = -1;
	int rejectedright = n,rejectedleft = -1;
	queue<pair<int,int>>q;
	q.push({0,n - 1});
	map<int,set<pair<int,int>>>pq;
	while(!q.empty()){
		auto u = q.front();
		q.pop();
		int left = u.first,right = u.second;
		if (left > right)continue;
		if (left >=rejectedright)continue;
		if (right<=rejectedleft)continue;
		if (right > rejectedright){
			q.push({left,rejectedright - 1});
			continue;
		}
		if (left < rejectedleft){
			q.push({rejectedleft + 1,right});
			continue;
		}
		if (left == right){
			vector<int>res = ask(left);
			pq[res[0] + res[1]].insert(make_pair(left,res[1]));
			if (res[0] + res[1] == 0){
				ans = left;
				break;
			} 
			continue;
		}
		int mid = (left + right)>>1;
		vector<int>res = ask(mid);
		pq[res[0] + res[1]].insert(make_pair(mid,res[1]));
		if (res[0] + res[1] == 0){
			ans = mid;
			break;
		}
		auto it = pq[res[0] + res[1]].find(make_pair(mid,res[1]));
		if (res[0] > 0){
			bool ok = true;
			if (it != pq[res[0] + res[1]].begin()){
				auto it2 = *prev(it);
				if (it2.second - res[1] <=0)ok = false;
			}
			if (ok){
				q.push({left,mid - 1});
			}
			else{
				//rejectedleft = max(rejectedleft,mid);
			}
		}
		else{
			rejectedleft = max(rejectedleft,mid);
		}
		if (res[1] > 0){
			bool ok = true;
			if (next(it)!=pq[res[0] + res[1]].end()){
				auto it2 = *next(it);
				if (res[1] - it2.second <=0)ok = false;
			}
			if (ok){
				q.push({mid + 1,right});
			}
			else{
				//rejectedright = min(rejectedright,mid);
			}
		}
		else{
			rejectedright = min(rejectedright,mid);
		}
	}
	return ans;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 288 KB Output is correct
3 Correct 0 ms 288 KB Output is correct
4 Correct 0 ms 292 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 292 KB Output is correct
8 Correct 0 ms 288 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct

Subtask #2
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 292 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 1 ms 292 KB Output is correct
5 Correct 0 ms 292 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 0 ms 276 KB Output is correct
8 Correct 1 ms 284 KB Output is correct
9 Correct 1 ms 292 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 3 ms 292 KB Output is correct
12 Correct 4 ms 208 KB Output is correct
13 Correct 5 ms 416 KB Output is correct
14 Correct 10 ms 320 KB Output is correct
15 Correct 7 ms 284 KB Output is correct
16 Correct 33 ms 328 KB Output is correct
17 Correct 27 ms 340 KB Output is correct
18 Correct 13 ms 436 KB Output is correct
19 Correct 20 ms 528 KB Output is correct
20 Correct 15 ms 300 KB Output is correct
21 Correct 27 ms 408 KB Output is correct
22 Correct 21 ms 344 KB Output is correct
23 Correct 1 ms 292 KB Output is correct
24 Correct 3 ms 284 KB Output is correct
25 Correct 23 ms 360 KB Output is correct
26 Correct 33 ms 436 KB Output is correct
27 Correct 1 ms 292 KB Output is correct
28 Correct 19 ms 384 KB Output is correct
29 Correct 14 ms 432 KB Output is correct
30 Correct 31 ms 416 KB Output is correct
31 Correct 16 ms 344 KB Output is correct
32 Correct 4 ms 292 KB Output is correct
33 Correct 0 ms 208 KB Output is correct
34 Correct 21 ms 288 KB Output is correct
35 Correct 1 ms 284 KB Output is correct
36 Correct 15 ms 444 KB Output is correct
37 Correct 3 ms 208 KB Output is correct
38 Correct 1 ms 268 KB Output is correct
39 Correct 29 ms 412 KB Output is correct
40 Correct 26 ms 420 KB Output is correct
41 Correct 43 ms 436 KB Output is correct
42 Correct 37 ms 456 KB Output is correct
43 Correct 13 ms 408 KB Output is correct
44 Correct 18 ms 432 KB Output is correct
45 Correct 14 ms 416 KB Output is correct
46 Correct 34 ms 336 KB Output is correct
47 Correct 30 ms 380 KB Output is correct
48 Correct 34 ms 420 KB Output is correct
49 Correct 21 ms 288 KB Output is correct
50 Correct 32 ms 456 KB Output is correct
51 Correct 24 ms 452 KB Output is correct
52 Correct 32 ms 408 KB Output is correct
53 Correct 1 ms 288 KB Output is correct
54 Correct 36 ms 412 KB Output is correct
55 Correct 31 ms 436 KB Output is correct
56 Correct 33 ms 392 KB Output is correct
57 Correct 26 ms 336 KB Output is correct
58 Correct 33 ms 440 KB Output is correct
59 Correct 16 ms 448 KB Output is correct
60 Correct 24 ms 328 KB Output is correct
61 Correct 2 ms 288 KB Output is correct
62 Correct 1 ms 268 KB Output is correct
63 Correct 1 ms 280 KB Output is correct
64 Correct 2 ms 288 KB Output is correct
65 Correct 1 ms 208 KB Output is correct
66 Correct 0 ms 296 KB Output is correct
67 Correct 1 ms 288 KB Output is correct
68 Correct 1 ms 208 KB Output is correct
69 Correct 1 ms 276 KB Output is correct
70 Correct 1 ms 208 KB Output is correct
71 Correct 47 ms 464 KB Output is correct
72 Correct 5 ms 208 KB Output is correct
73 Correct 37 ms 440 KB Output is correct
74 Correct 27 ms 420 KB Output is correct
75 Correct 1 ms 208 KB Output is correct
76 Correct 34 ms 472 KB Output is correct
77 Correct 20 ms 380 KB Output is correct
78 Correct 6 ms 208 KB Output is correct
79 Correct 15 ms 340 KB Output is correct
80 Correct 24 ms 432 KB Output is correct
81 Correct 31 ms 456 KB Output is correct
82 Correct 38 ms 416 KB Output is correct
83 Correct 1 ms 288 KB Output is correct
84 Correct 28 ms 356 KB Output is correct
85 Correct 36 ms 452 KB Output is correct
86 Correct 3 ms 208 KB Output is correct
87 Correct 1 ms 208 KB Output is correct
88 Correct 2 ms 208 KB Output is correct
89 Correct 2 ms 208 KB Output is correct
90 Correct 1 ms 292 KB Output is correct
91 Correct 1 ms 344 KB Output is correct
92 Correct 1 ms 208 KB Output is correct
93 Correct 4 ms 208 KB Output is correct
94 Correct 3 ms 208 KB Output is correct
95 Correct 2 ms 308 KB Output is correct
96 Correct 3 ms 208 KB Output is correct
97 Correct 0 ms 208 KB Output is correct