oj.uz

Submission #739641

# Submission time Handle Problem Language Result Execution time Memory
739641 2023-05-10T21:37:03 Z Charizard2021 The Big Prize (IOI17_prize) C++17
100 / 100
 60 ms 632 KB 
#include "prize.h"
#include <bits/stdc++.h>
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
using namespace std;
using pi = pair<int, int>;

map<int, pi> mp;

pi Ask(int x){
	if(mp.find(x) != mp.end()) return mp[x];
	auto q = ask(x);
	return mp[x] = pi(q[0], q[1]);
}

int find_best(int n) {
	if(n <= 5000){
		for(int i = 0; i < n; i++) {
			std::vector<int> res = ask(i);
			if(res[0] + res[1] == 0)
				return i;
		}
	}
	vector<int> cp;
	for(int i=0; i<=500; i++){
		int w = ((n-1) * i) / 500;
		cp.push_back(w);
	}
	int thres = 0;
	for(auto &i : cp){
		pi p = Ask(i);
		thres = max(thres, p.first + p.second);
	}
	auto abnormal = [&](int x){
		pi p = Ask(x);
		return p.first + p.second != thres;
	};
	for(int i=0; i<n; i++){
		if(abnormal(i)){
			pi p = Ask(i);
			if(p.first + p.second == 0) return i;
		}
		else{
			auto incompatible = [&](int x, int y){
				assert(x < y);
				if(abnormal(y)) return true;
				auto p = Ask(x).second;
				auto q = Ask(y).second;
				return p != q;
			};
			int s = i + 1;
			int e = n + 100;
			for(auto &j : cp){
				if(j > i && incompatible(i, j)){
					e = j;
					break;
				}
				s = max(s, j);
			}
			while(s != e){
				int m = (s + e) / 2;
				if(incompatible(i, m)) e = m;
				else s = m + 1;
			}
			assert(abnormal(s));
			i = s - 1;
		}
	}
	assert(0);
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 296 KB Output is correct
2 Correct 6 ms 300 KB Output is correct
3 Correct 2 ms 304 KB Output is correct
4 Correct 3 ms 312 KB Output is correct
5 Correct 3 ms 320 KB Output is correct
6 Correct 3 ms 208 KB Output is correct
7 Correct 4 ms 292 KB Output is correct
8 Correct 6 ms 292 KB Output is correct
9 Correct 4 ms 208 KB Output is correct
10 Correct 5 ms 208 KB Output is correct

Subtask #2
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 208 KB Output is correct
2 Correct 3 ms 292 KB Output is correct
3 Correct 6 ms 288 KB Output is correct
4 Correct 4 ms 208 KB Output is correct
5 Correct 8 ms 312 KB Output is correct
6 Correct 4 ms 292 KB Output is correct
7 Correct 8 ms 320 KB Output is correct
8 Correct 4 ms 300 KB Output is correct
9 Correct 8 ms 444 KB Output is correct
10 Correct 7 ms 208 KB Output is correct
11 Correct 8 ms 292 KB Output is correct
12 Correct 4 ms 296 KB Output is correct
13 Correct 8 ms 328 KB Output is correct
14 Correct 7 ms 308 KB Output is correct
15 Correct 9 ms 316 KB Output is correct
16 Correct 42 ms 464 KB Output is correct
17 Correct 6 ms 288 KB Output is correct
18 Correct 23 ms 560 KB Output is correct
19 Correct 6 ms 292 KB Output is correct
20 Correct 16 ms 372 KB Output is correct
21 Correct 11 ms 472 KB Output is correct
22 Correct 6 ms 284 KB Output is correct
23 Correct 6 ms 436 KB Output is correct
24 Correct 3 ms 300 KB Output is correct
25 Correct 30 ms 408 KB Output is correct
26 Correct 29 ms 328 KB Output is correct
27 Correct 4 ms 316 KB Output is correct
28 Correct 52 ms 544 KB Output is correct
29 Correct 35 ms 416 KB Output is correct
30 Correct 48 ms 600 KB Output is correct
31 Correct 6 ms 328 KB Output is correct
32 Correct 4 ms 328 KB Output is correct
33 Correct 1 ms 208 KB Output is correct
34 Correct 21 ms 328 KB Output is correct
35 Correct 3 ms 320 KB Output is correct
36 Correct 10 ms 344 KB Output is correct
37 Correct 10 ms 292 KB Output is correct
38 Correct 5 ms 288 KB Output is correct
39 Correct 24 ms 428 KB Output is correct
40 Correct 33 ms 544 KB Output is correct
41 Correct 32 ms 416 KB Output is correct
42 Correct 30 ms 412 KB Output is correct
43 Correct 14 ms 540 KB Output is correct
44 Correct 20 ms 492 KB Output is correct
45 Correct 8 ms 376 KB Output is correct
46 Correct 5 ms 212 KB Output is correct
47 Correct 22 ms 400 KB Output is correct
48 Correct 36 ms 412 KB Output is correct
49 Correct 5 ms 328 KB Output is correct
50 Correct 37 ms 540 KB Output is correct
51 Correct 26 ms 408 KB Output is correct
52 Correct 4 ms 408 KB Output is correct
53 Correct 4 ms 436 KB Output is correct
54 Correct 18 ms 344 KB Output is correct
55 Correct 6 ms 292 KB Output is correct
56 Correct 55 ms 548 KB Output is correct
57 Correct 27 ms 496 KB Output is correct
58 Correct 30 ms 408 KB Output is correct
59 Correct 26 ms 456 KB Output is correct
60 Correct 30 ms 344 KB Output is correct
61 Correct 5 ms 208 KB Output is correct
62 Correct 4 ms 276 KB Output is correct
63 Correct 4 ms 324 KB Output is correct
64 Correct 3 ms 336 KB Output is correct
65 Correct 6 ms 288 KB Output is correct
66 Correct 5 ms 324 KB Output is correct
67 Correct 3 ms 300 KB Output is correct
68 Correct 10 ms 288 KB Output is correct
69 Correct 10 ms 280 KB Output is correct
70 Correct 7 ms 308 KB Output is correct
71 Correct 45 ms 624 KB Output is correct
72 Correct 4 ms 344 KB Output is correct
73 Correct 54 ms 456 KB Output is correct
74 Correct 47 ms 460 KB Output is correct
75 Correct 4 ms 332 KB Output is correct
76 Correct 45 ms 452 KB Output is correct
77 Correct 35 ms 580 KB Output is correct
78 Correct 9 ms 336 KB Output is correct
79 Correct 24 ms 320 KB Output is correct
80 Correct 49 ms 524 KB Output is correct
81 Correct 31 ms 584 KB Output is correct
82 Correct 60 ms 580 KB Output is correct
83 Correct 5 ms 208 KB Output is correct
84 Correct 36 ms 632 KB Output is correct
85 Correct 43 ms 476 KB Output is correct
86 Correct 17 ms 476 KB Output is correct
87 Correct 8 ms 304 KB Output is correct
88 Correct 38 ms 432 KB Output is correct
89 Correct 31 ms 468 KB Output is correct
90 Correct 6 ms 316 KB Output is correct
91 Correct 31 ms 452 KB Output is correct
92 Correct 36 ms 464 KB Output is correct
93 Correct 27 ms 584 KB Output is correct
94 Correct 37 ms 568 KB Output is correct
95 Correct 49 ms 524 KB Output is correct
96 Correct 57 ms 456 KB Output is correct
97 Correct 51 ms 584 KB Output is correct