oj.uz

Submission #778869

# Submission time Handle Problem Language Result Execution time Memory
778869 2023-07-10T22:32:14 Z kingfran1907 The Big Prize (IOI17_prize) C++14
20 / 100
 1000 ms 1992 KB 
#include "prize.h"
#include <bits/stdc++.h>
#define X first
#define Y second

using namespace std;
typedef long long llint;
const int maxn = 2e5+10;

int l[maxn], r[maxn];
int out = -1;
int maxi = 0;

pair<int,int> query(int x) {
	if (l[x] != -1) return {l[x], r[x]};
	
	vector< int > v = ask(x);
	l[x] = v[0], r[x] = v[1];
	return {l[x], r[x]};
}

llint ra() {
	return (llint)rand() * rand() + rand();
}

void solve(int l, int r) {
	if (l > r) return;
	if (out != -1) return;
	if (query(l).X + query(l).Y == 0) {
		out = l;
		return;
	}
	if (query(l).X + query(l).Y < maxi) {solve(l + 1, r); return;}
	if (l == r) return;
	if (query(r).X + query(r).Y == 0) {
		out = r;
		return;
	}
	if (query(r).X + query(r).Y < maxi) {solve(l, r - 1); return;}
	if (query(l).X == query(r).X) return;
	
	int mid = (l + r) / 2;
	solve(l, mid);
	solve(mid, r);
}

int find_best(int n) {
	memset(l, -1, sizeof l);
	srand(13);
	for (int i = 0; i < 200; i++) {
		int x = ra() % n;
		pair<int, int> tr = query(x);
		if (tr.X + tr.Y == 0) return x;
		maxi = max(maxi, tr.X + tr.Y);
	}
	solve(0, n - 1);
	assert(out != -1);
	return out;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1584 KB Output is correct
2 Correct 3 ms 1580 KB Output is correct
3 Correct 2 ms 1476 KB Output is correct
4 Correct 1 ms 1480 KB Output is correct
5 Correct 1 ms 1472 KB Output is correct
6 Correct 2 ms 1488 KB Output is correct
7 Correct 3 ms 1488 KB Output is correct
8 Correct 1 ms 1480 KB Output is correct
9 Correct 2 ms 1476 KB Output is correct
10 Correct 3 ms 1488 KB Output is correct

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1488 KB Output is correct
2 Correct 3 ms 1580 KB Output is correct
3 Correct 3 ms 1488 KB Output is correct
4 Correct 3 ms 1452 KB Output is correct
5 Correct 2 ms 1472 KB Output is correct
6 Correct 3 ms 1488 KB Output is correct
7 Correct 2 ms 1488 KB Output is correct
8 Correct 2 ms 1488 KB Output is correct
9 Correct 3 ms 1488 KB Output is correct
10 Correct 2 ms 1488 KB Output is correct
11 Correct 5 ms 1616 KB Output is correct
12 Correct 2 ms 1556 KB Output is correct
13 Correct 5 ms 1616 KB Output is correct
14 Correct 4 ms 1104 KB Output is correct
15 Correct 4 ms 1596 KB Output is correct
16 Correct 15 ms 1804 KB Output is correct
17 Correct 2 ms 1512 KB Output is correct
18 Correct 44 ms 1728 KB Output is correct
19 Correct 1 ms 1472 KB Output is correct
20 Correct 5 ms 1432 KB Output is correct
21 Correct 18 ms 1588 KB Output is correct
22 Correct 6 ms 1580 KB Output is correct
23 Correct 2 ms 1536 KB Output is correct
24 Correct 3 ms 1488 KB Output is correct
25 Correct 11 ms 1672 KB Output is correct
26 Correct 24 ms 1620 KB Output is correct
27 Correct 2 ms 1472 KB Output is correct
28 Correct 38 ms 1736 KB Output is correct
29 Correct 28 ms 1780 KB Output is correct
30 Correct 33 ms 1788 KB Output is correct
31 Correct 2 ms 1512 KB Output is correct
32 Correct 1 ms 1360 KB Output is correct
33 Correct 1 ms 976 KB Output is correct
34 Correct 13 ms 1560 KB Output is correct
35 Correct 4 ms 1568 KB Output is correct
36 Correct 8 ms 1580 KB Output is correct
37 Correct 2 ms 1592 KB Output is correct
38 Correct 3 ms 1512 KB Output is correct
39 Correct 9 ms 1692 KB Output is correct
40 Correct 25 ms 1820 KB Output is correct
41 Correct 26 ms 1608 KB Output is correct
42 Correct 25 ms 1660 KB Output is correct
43 Correct 10 ms 1716 KB Output is correct
44 Correct 14 ms 1628 KB Output is correct
45 Correct 12 ms 1560 KB Output is correct
46 Correct 2 ms 1568 KB Output is correct
47 Correct 18 ms 1588 KB Output is correct
48 Correct 13 ms 1792 KB Output is correct
49 Correct 6 ms 1488 KB Output is correct
50 Correct 1 ms 1220 KB Output is correct
51 Correct 17 ms 1596 KB Output is correct
52 Correct 3 ms 1484 KB Output is correct
53 Correct 2 ms 1604 KB Output is correct
54 Correct 20 ms 1656 KB Output is correct
55 Correct 2 ms 1552 KB Output is correct
56 Correct 30 ms 1992 KB Output is correct
57 Correct 31 ms 1728 KB Output is correct
58 Correct 13 ms 1748 KB Output is correct
59 Correct 27 ms 1736 KB Output is correct
60 Correct 22 ms 1616 KB Output is correct
61 Correct 3 ms 1572 KB Output is correct
62 Correct 2 ms 1488 KB Output is correct
63 Correct 3 ms 1584 KB Output is correct
64 Correct 2 ms 1584 KB Output is correct
65 Correct 2 ms 1476 KB Output is correct
66 Correct 2 ms 1488 KB Output is correct
67 Correct 6 ms 1452 KB Output is correct
68 Correct 6 ms 1452 KB Output is correct
69 Correct 3 ms 1488 KB Output is correct
70 Correct 5 ms 1448 KB Output is correct
71 Correct 44 ms 1736 KB Output is correct
72 Correct 4 ms 1732 KB Output is correct
73 Correct 44 ms 1784 KB Output is correct
74 Correct 44 ms 1788 KB Output is correct
75 Correct 3 ms 1604 KB Output is correct
76 Correct 28 ms 1836 KB Output is correct
77 Correct 18 ms 1852 KB Output is correct
78 Correct 5 ms 1708 KB Output is correct
79 Correct 17 ms 1792 KB Output is correct
80 Correct 32 ms 1828 KB Output is correct
81 Correct 42 ms 1720 KB Output is correct
82 Correct 30 ms 1800 KB Output is correct
83 Correct 3 ms 1576 KB Output is correct
84 Correct 33 ms 1816 KB Output is correct
85 Correct 18 ms 1752 KB Output is correct
86 Correct 18 ms 1736 KB Output is correct
87 Correct 3 ms 1604 KB Output is correct
88 Correct 23 ms 1724 KB Output is correct
89 Correct 18 ms 1736 KB Output is correct
90 Correct 3 ms 1488 KB Output is correct
91 Correct 12 ms 1612 KB Output is correct
92 Correct 6 ms 1672 KB Output is correct
93 Execution timed out 3073 ms 1616 KB Time limit exceeded
94 Halted 0 ms 0 KB -