oj.uz

Submission #975484

# Submission time Handle Problem Language Result Execution time Memory
975484 2024-05-05T09:45:59 Z pirhosig The Big Prize (IOI17_prize) C++17
20 / 100
 33 ms 692 KB 
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> ii;



int solve(int low, int upp, int less, int more, int large) {
	if (less + more == large) return 0;

	int mid = (low + upp) / 2;
	auto a = ask(mid);
	int tot = a[0] + a[1];
	if (tot == 0) return mid;

	if (low == upp) return 0;

	int res = 0;
	if (tot == large) {
		if (low < mid) res += solve(low, mid - 1, less, a[1], large);
		if (mid < upp) res += solve(mid + 1, upp, a[0], more, large);
	}
	else {
		int mdx = mid;
		while (tot < large && mdx < upp) {
			mdx++;
			a = ask(mdx);
			tot = a[0] + a[1];
			if (tot == 0) return mdx;
		}
		if (tot == large) {
			if (low < mid) res += solve(low, mid - 1, less, a[1] + mdx - mid, large);
			if (mdx < upp) res += solve(mdx + 1, upp, a[0], more, large);
		}
		else if (low < mid) res += solve(low, mid - 1, less, more + mdx - mid, large);
	}

	return res;
}


	
int find_best(int n) {
	if (n < 5000) {
		for (int i = 0; i < n; ++i) {
			auto a = ask(i);
			if (a[0] + a[1] == 0) return i;
		}
	}
	
	int large = 0;
	vector<int> val(450);
	for (int i = 0; i < 450; ++i) {
		auto a = ask(i);
		val[i] = a[0] + a[1];
		if (val[i] == 0) return i;
		large = max(large, val[i]);
	}
	
	int found = 0;
	for (int a : val) if (a != large) found++;
	
	return solve(450, n - 1, found, 0, large);
}

Subtask #1
20.0 / 20.0

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

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 432 KB Output is correct
2 Correct 2 ms 436 KB Output is correct
3 Correct 2 ms 436 KB Output is correct
4 Correct 2 ms 436 KB Output is correct
5 Correct 2 ms 440 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 2 ms 444 KB Output is correct
8 Correct 2 ms 600 KB Output is correct
9 Correct 3 ms 436 KB Output is correct
10 Correct 2 ms 436 KB Output is correct
11 Correct 4 ms 436 KB Output is correct
12 Correct 3 ms 440 KB Output is correct
13 Correct 4 ms 432 KB Output is correct
14 Correct 5 ms 432 KB Output is correct
15 Correct 22 ms 436 KB Output is correct
16 Correct 26 ms 436 KB Output is correct
17 Correct 2 ms 344 KB Output is correct
18 Correct 19 ms 436 KB Output is correct
19 Correct 28 ms 428 KB Output is correct
20 Correct 22 ms 432 KB Output is correct
21 Correct 27 ms 432 KB Output is correct
22 Correct 22 ms 432 KB Output is correct
23 Correct 3 ms 440 KB Output is correct
24 Correct 3 ms 436 KB Output is correct
25 Correct 25 ms 440 KB Output is correct
26 Correct 27 ms 440 KB Output is correct
27 Correct 3 ms 436 KB Output is correct
28 Correct 22 ms 440 KB Output is correct
29 Correct 18 ms 436 KB Output is correct
30 Correct 33 ms 440 KB Output is correct
31 Correct 3 ms 344 KB Output is correct
32 Correct 4 ms 436 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 26 ms 436 KB Output is correct
35 Correct 3 ms 432 KB Output is correct
36 Correct 21 ms 504 KB Output is correct
37 Correct 3 ms 440 KB Output is correct
38 Correct 2 ms 436 KB Output is correct
39 Correct 18 ms 440 KB Output is correct
40 Correct 23 ms 432 KB Output is correct
41 Correct 23 ms 436 KB Output is correct
42 Correct 21 ms 436 KB Output is correct
43 Correct 19 ms 440 KB Output is correct
44 Correct 21 ms 432 KB Output is correct
45 Correct 18 ms 436 KB Output is correct
46 Correct 2 ms 600 KB Output is correct
47 Correct 19 ms 432 KB Output is correct
48 Correct 26 ms 436 KB Output is correct
49 Correct 21 ms 440 KB Output is correct
50 Correct 23 ms 432 KB Output is correct
51 Correct 21 ms 436 KB Output is correct
52 Correct 21 ms 436 KB Output is correct
53 Correct 3 ms 440 KB Output is correct
54 Correct 22 ms 440 KB Output is correct
55 Correct 2 ms 344 KB Output is correct
56 Correct 19 ms 608 KB Output is correct
57 Correct 23 ms 432 KB Output is correct
58 Correct 26 ms 440 KB Output is correct
59 Correct 23 ms 436 KB Output is correct
60 Correct 24 ms 432 KB Output is correct
61 Correct 2 ms 436 KB Output is correct
62 Correct 2 ms 436 KB Output is correct
63 Correct 3 ms 692 KB Output is correct
64 Correct 2 ms 436 KB Output is correct
65 Correct 2 ms 608 KB Output is correct
66 Correct 4 ms 436 KB Output is correct
67 Correct 5 ms 600 KB Output is correct
68 Correct 2 ms 344 KB Output is correct
69 Correct 3 ms 684 KB Output is correct
70 Correct 3 ms 432 KB Output is correct
71 Partially correct 23 ms 432 KB Partially correct - number of queries: 5209
72 Correct 4 ms 432 KB Output is correct
73 Partially correct 28 ms 432 KB Partially correct - number of queries: 5146
74 Partially correct 23 ms 440 KB Partially correct - number of queries: 5173
75 Correct 2 ms 432 KB Output is correct
76 Correct 22 ms 436 KB Output is correct
77 Correct 22 ms 436 KB Output is correct
78 Correct 4 ms 440 KB Output is correct
79 Correct 14 ms 440 KB Output is correct
80 Correct 19 ms 432 KB Output is correct
81 Correct 24 ms 440 KB Output is correct
82 Correct 24 ms 424 KB Output is correct
83 Correct 2 ms 436 KB Output is correct
84 Correct 17 ms 432 KB Output is correct
85 Correct 19 ms 440 KB Output is correct
86 Incorrect 2 ms 436 KB answer is not correct
87 Halted 0 ms 0 KB -