oj.uz

Submission #1082924

# Submission time Handle Problem Language Result Execution time Memory
1082924 2024-09-02T06:12:49 Z happypotato The Big Prize (IOI17_prize) C++17
97.42 / 100
 62 ms 4424 KB 
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
#define pii pair<int, int>
#define ff first
#define ss second
#define pb push_back
vector<pii> sto;
pii Ask(int x) {
	if (sto[x].ff != -1) return sto[x];
	// cerr << "ASK " << x << endl;
	vector<int> res = ask(x);
	return (sto[x] = make_pair(res[0], res[1]));
}
int brainless(int n) {
	for (int i = 0; i < n; i++) {
		pii ret = Ask(i);
		if (ret.ff + ret.ss == 0) return i;
	}
	throw runtime_error("no answer?");
}
vector<int> bit;
void update(int pos) {
	pos++;
	int n = (int)(bit.size()) - 1;
	while (pos <= n) {
		bit[pos]++;
		pos += (pos & -pos);
	}
}
int pquery(int pos) {
	int n = (int)(bit.size()) - 1;
	int res = 0;
	while (pos >= 1) {
		res += bit[pos];
		pos -= (pos & -pos);
	}
	return res;
}
int query(int l, int r) {
	if (l > r) return 0;
	l++; r++;
	return pquery(r) - pquery(l - 1);
}
int find_best(int n) {
	sto.clear(); sto.resize(n, make_pair(-1, -1));
	bit.clear(); bit.resize(n + 1, 0);
	if (n <= 5000) return brainless(n);
	// only 472 max: 1 4 21 446 []
	set<int> asked;
	int times = 0;
	for (int i = 1; i <= 500; i++) {
		pii ret = Ask(i);
		times = max(times, ret.ff + ret.ss);
	}
	vector<int> v(n);
	for (int i = 0; i < n; i++) v[i] = i;

	auto pickmid = [&](int lb, int rb) -> int {
		set<int>::iterator it;
		int mid = v[(lb + rb) >> 1];
		it = asked.lower_bound(mid);
		if (it != asked.end() && *it < v[rb]) return *it;
		it = asked.upper_bound(mid);
		if (it != asked.begin() && *(--it) >= v[lb]) return *it;
		return mid;
	};

	auto findpos = [&](int tar) -> int {
		int lb = 0, rb = (int)(v.size()) - 1;
		while (lb < rb) {
			int mid = (lb + rb) >> 1;
			if (v[mid] == tar) return mid;
			if (v[mid] < tar) lb = mid + 1;
			else rb = mid;
		}
		return lb;
	};

	auto findone = [&]() -> int {
		int lb = 0, rb = (int)(v.size()) - 1;
		while (lb < rb) {
			int mid = pickmid(lb, rb);
			int pos = findpos(mid);
			pii ret = Ask(mid);
			if (ret.ff + ret.ss < times) return mid;
			asked.insert(mid);
			if (query(0, mid - 1) < ret.ff) rb = pos - 1;
			else lb = pos + 1;
		}
		return v[lb];
	};

	for (int t = 1; t <= times; t++) {
		int res = findone();
		pii ret = Ask(res);
		if (ret.ff + ret.ss == 0) return res;
		update(res);
		for (int i = 0; i < (int)(v.size()); i++) {
			if (v[i] == res) {
				v.erase(v.begin() + i);
				break;
			}
		}
	}
	// throw runtime_error("oh no");
	return -1;
}

Compilation message

prize.cpp: In function 'int pquery(int)':
prize.cpp:32:6: warning: unused variable 'n' [-Wunused-variable]
   32 |  int n = (int)(bit.size()) - 1;
      |      ^

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3416 KB Output is correct
2 Correct 5 ms 3416 KB Output is correct
3 Correct 4 ms 3668 KB Output is correct
4 Correct 5 ms 3672 KB Output is correct
5 Correct 4 ms 3416 KB Output is correct
6 Correct 4 ms 3560 KB Output is correct
7 Correct 4 ms 3416 KB Output is correct
8 Correct 5 ms 3672 KB Output is correct
9 Correct 5 ms 3416 KB Output is correct
10 Correct 4 ms 3416 KB Output is correct

Subtask #2
77.42 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 3416 KB Output is correct
2 Correct 7 ms 3416 KB Output is correct
3 Correct 5 ms 3416 KB Output is correct
4 Correct 4 ms 3416 KB Output is correct
5 Correct 4 ms 3568 KB Output is correct
6 Correct 4 ms 3416 KB Output is correct
7 Correct 4 ms 3416 KB Output is correct
8 Correct 4 ms 3672 KB Output is correct
9 Correct 3 ms 3416 KB Output is correct
10 Correct 4 ms 3416 KB Output is correct
11 Correct 6 ms 3416 KB Output is correct
12 Correct 3 ms 3416 KB Output is correct
13 Correct 9 ms 3416 KB Output is correct
14 Correct 5 ms 600 KB Output is correct
15 Correct 9 ms 3416 KB Output is correct
16 Correct 38 ms 3664 KB Output is correct
17 Correct 4 ms 3668 KB Output is correct
18 Correct 52 ms 3912 KB Output is correct
19 Correct 4 ms 3416 KB Output is correct
20 Correct 10 ms 2032 KB Output is correct
21 Correct 14 ms 3416 KB Output is correct
22 Correct 5 ms 3416 KB Output is correct
23 Correct 5 ms 3416 KB Output is correct
24 Correct 6 ms 3416 KB Output is correct
25 Correct 21 ms 3412 KB Output is correct
26 Correct 22 ms 3416 KB Output is correct
27 Correct 4 ms 3416 KB Output is correct
28 Correct 51 ms 3664 KB Output is correct
29 Correct 33 ms 3664 KB Output is correct
30 Correct 52 ms 3672 KB Output is correct
31 Correct 5 ms 3416 KB Output is correct
32 Correct 9 ms 3416 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 12 ms 3820 KB Output is correct
35 Correct 5 ms 3416 KB Output is correct
36 Correct 15 ms 3416 KB Output is correct
37 Correct 5 ms 3416 KB Output is correct
38 Correct 3 ms 3416 KB Output is correct
39 Correct 20 ms 3664 KB Output is correct
40 Correct 48 ms 4424 KB Output is correct
41 Correct 28 ms 3604 KB Output is correct
42 Correct 24 ms 3672 KB Output is correct
43 Correct 28 ms 3672 KB Output is correct
44 Correct 19 ms 3820 KB Output is correct
45 Correct 15 ms 3672 KB Output is correct
46 Correct 4 ms 3416 KB Output is correct
47 Correct 17 ms 3672 KB Output is correct
48 Correct 35 ms 3664 KB Output is correct
49 Correct 6 ms 3672 KB Output is correct
50 Correct 60 ms 3816 KB Output is correct
51 Correct 17 ms 3644 KB Output is correct
52 Correct 5 ms 3416 KB Output is correct
53 Correct 4 ms 3416 KB Output is correct
54 Correct 19 ms 3632 KB Output is correct
55 Correct 4 ms 3568 KB Output is correct
56 Correct 58 ms 4136 KB Output is correct
57 Correct 37 ms 3920 KB Output is correct
58 Correct 32 ms 3660 KB Output is correct
59 Correct 26 ms 3416 KB Output is correct
60 Correct 30 ms 3608 KB Output is correct
61 Correct 4 ms 3416 KB Output is correct
62 Correct 3 ms 3416 KB Output is correct
63 Correct 4 ms 3416 KB Output is correct
64 Correct 6 ms 3416 KB Output is correct
65 Correct 5 ms 3416 KB Output is correct
66 Correct 40 ms 3584 KB Output is correct
67 Correct 15 ms 3564 KB Output is correct
68 Correct 6 ms 3420 KB Output is correct
69 Correct 35 ms 3416 KB Output is correct
70 Correct 16 ms 3416 KB Output is correct
71 Partially correct 50 ms 3868 KB Partially correct - number of queries: 5258
72 Correct 7 ms 3416 KB Output is correct
73 Partially correct 50 ms 3672 KB Partially correct - number of queries: 5195
74 Partially correct 53 ms 3664 KB Partially correct - number of queries: 5222
75 Correct 4 ms 3416 KB Output is correct
76 Correct 54 ms 3916 KB Output is correct
77 Correct 44 ms 3968 KB Output is correct
78 Correct 10 ms 3416 KB Output is correct
79 Correct 27 ms 3672 KB Output is correct
80 Correct 46 ms 3836 KB Output is correct
81 Correct 62 ms 3668 KB Output is correct
82 Correct 43 ms 3664 KB Output is correct
83 Correct 4 ms 3416 KB Output is correct
84 Correct 37 ms 4080 KB Output is correct
85 Correct 42 ms 3672 KB Output is correct
86 Correct 11 ms 3416 KB Output is correct
87 Correct 5 ms 3672 KB Output is correct
88 Correct 11 ms 3588 KB Output is correct
89 Correct 12 ms 3416 KB Output is correct
90 Correct 3 ms 3672 KB Output is correct
91 Correct 8 ms 3416 KB Output is correct
92 Correct 12 ms 3416 KB Output is correct
93 Correct 14 ms 3416 KB Output is correct
94 Correct 16 ms 3416 KB Output is correct
95 Correct 14 ms 3416 KB Output is correct
96 Correct 15 ms 3416 KB Output is correct
97 Correct 13 ms 3416 KB Output is correct