Submission #778868

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
778868	2023-07-10T22:30:49 Z	kingfran1907	The Big Prize (IOI17_prize)	C++14	20 / 100	1000 ms	1864 KB

prize

#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);
	for (int i = 0; i < 300; 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	1676 KB	Output is correct
2	Correct	2 ms	1680 KB	Output is correct
3	Correct	5 ms	1572 KB	Output is correct
4	Correct	3 ms	1616 KB	Output is correct
5	Correct	2 ms	1712 KB	Output is correct
6	Correct	3 ms	1624 KB	Output is correct
7	Correct	2 ms	1680 KB	Output is correct
8	Correct	4 ms	1596 KB	Output is correct
9	Correct	4 ms	1616 KB	Output is correct
10	Correct	3 ms	1616 KB	Output is correct

Subtask #2

0 / 80.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	1708 KB	Output is correct
2	Correct	5 ms	1616 KB	Output is correct
3	Correct	2 ms	1676 KB	Output is correct
4	Correct	2 ms	1680 KB	Output is correct
5	Correct	3 ms	1708 KB	Output is correct
6	Correct	3 ms	1616 KB	Output is correct
7	Correct	4 ms	1616 KB	Output is correct
8	Correct	2 ms	1672 KB	Output is correct
9	Correct	4 ms	1704 KB	Output is correct
10	Correct	4 ms	1616 KB	Output is correct
11	Correct	3 ms	1676 KB	Output is correct
12	Correct	4 ms	1708 KB	Output is correct
13	Correct	8 ms	1744 KB	Output is correct
14	Correct	6 ms	1148 KB	Output is correct
15	Correct	5 ms	1708 KB	Output is correct
16	Correct	15 ms	1836 KB	Output is correct
17	Correct	3 ms	1616 KB	Output is correct
18	Correct	25 ms	1820 KB	Output is correct
19	Correct	2 ms	1616 KB	Output is correct
20	Correct	5 ms	1500 KB	Output is correct
21	Correct	16 ms	1832 KB	Output is correct
22	Correct	3 ms	1720 KB	Output is correct
23	Correct	3 ms	1704 KB	Output is correct
24	Correct	3 ms	1616 KB	Output is correct
25	Correct	18 ms	1788 KB	Output is correct
26	Correct	9 ms	1776 KB	Output is correct
27	Correct	3 ms	1608 KB	Output is correct
28	Correct	28 ms	1832 KB	Output is correct
29	Correct	23 ms	1816 KB	Output is correct
30	Correct	33 ms	1780 KB	Output is correct
31	Correct	4 ms	1644 KB	Output is correct
32	Correct	6 ms	1736 KB	Output is correct
33	Correct	1 ms	976 KB	Output is correct
34	Correct	7 ms	1748 KB	Output is correct
35	Correct	4 ms	1708 KB	Output is correct
36	Correct	11 ms	1712 KB	Output is correct
37	Correct	3 ms	1616 KB	Output is correct
38	Correct	3 ms	1700 KB	Output is correct
39	Correct	14 ms	1744 KB	Output is correct
40	Correct	37 ms	1744 KB	Output is correct
41	Correct	10 ms	1788 KB	Output is correct
42	Correct	18 ms	1672 KB	Output is correct
43	Correct	11 ms	1756 KB	Output is correct
44	Correct	8 ms	1740 KB	Output is correct
45	Correct	7 ms	1744 KB	Output is correct
46	Correct	2 ms	1676 KB	Output is correct
47	Correct	18 ms	1736 KB	Output is correct
48	Correct	29 ms	1736 KB	Output is correct
49	Correct	7 ms	1616 KB	Output is correct
50	Correct	30 ms	1840 KB	Output is correct
51	Correct	17 ms	1736 KB	Output is correct
52	Correct	3 ms	1708 KB	Output is correct
53	Correct	2 ms	1704 KB	Output is correct
54	Correct	14 ms	1736 KB	Output is correct
55	Correct	3 ms	1616 KB	Output is correct
56	Correct	30 ms	1824 KB	Output is correct
57	Correct	13 ms	1792 KB	Output is correct
58	Correct	39 ms	1736 KB	Output is correct
59	Correct	17 ms	1744 KB	Output is correct
60	Correct	22 ms	1756 KB	Output is correct
61	Correct	4 ms	1708 KB	Output is correct
62	Correct	2 ms	1644 KB	Output is correct
63	Correct	5 ms	1616 KB	Output is correct
64	Correct	2 ms	1712 KB	Output is correct
65	Correct	4 ms	1692 KB	Output is correct
66	Correct	2 ms	1676 KB	Output is correct
67	Correct	6 ms	1652 KB	Output is correct
68	Correct	8 ms	1576 KB	Output is correct
69	Correct	3 ms	1616 KB	Output is correct
70	Correct	7 ms	1712 KB	Output is correct
71	Partially correct	42 ms	1836 KB	Partially correct - number of queries: 5045
72	Correct	9 ms	1752 KB	Output is correct
73	Correct	30 ms	1780 KB	Output is correct
74	Partially correct	43 ms	1828 KB	Partially correct - number of queries: 5009
75	Correct	5 ms	1744 KB	Output is correct
76	Correct	24 ms	1844 KB	Output is correct
77	Partially correct	34 ms	1816 KB	Partially correct - number of queries: 5040
78	Correct	9 ms	1744 KB	Output is correct
79	Correct	24 ms	1800 KB	Output is correct
80	Partially correct	42 ms	1864 KB	Partially correct - number of queries: 5011
81	Partially correct	31 ms	1736 KB	Partially correct - number of queries: 5046
82	Correct	53 ms	1760 KB	Output is correct
83	Correct	4 ms	1744 KB	Output is correct
84	Correct	37 ms	1752 KB	Output is correct
85	Correct	46 ms	1808 KB	Output is correct
86	Correct	26 ms	1736 KB	Output is correct
87	Correct	3 ms	1616 KB	Output is correct
88	Correct	30 ms	1728 KB	Output is correct
89	Correct	15 ms	1852 KB	Output is correct
90	Correct	3 ms	1616 KB	Output is correct
91	Correct	16 ms	1732 KB	Output is correct
92	Correct	18 ms	1752 KB	Output is correct
93	Execution timed out	3071 ms	1636 KB	Time limit exceeded
94	Halted	0 ms	0 KB	-