Submission #1029199

# Submission time Handle Problem Language Result Execution time Memory
1029199 2024-07-20T13:45:39 Z AmirAli_H1 The Big Prize (IOI17_prize) C++17
95.25 / 100
33 ms 2132 KB
// In the name of Allah
 
#include <bits/stdc++.h>
#include "prize.h"
using namespace std;
 
typedef		long long int			ll;
typedef		long double				ld;
typedef		pair<int, int>			pii;
typedef		pair<ll, ll>			pll;
typedef		complex<ld>				cld;
 
#define		all(x)					(x).begin(),(x).end()
#define		len(x)					((ll) (x).size())
#define		F						first
#define		S						second
#define		pb						push_back
#define		sep						' '
#define		endl					'\n'
#define		Mp						make_pair
#define		kill(x)					cout << x << '\n', exit(0)
#define		set_dec(x)				cout << fixed << setprecision(x);
#define		file_io(x,y)			freopen(x, "r", stdin); freopen(y, "w", stdout);
 
const int maxn = 2e5 + 7;
 
int n; pii A[maxn];
mt19937 rng(923232361);
 
void askx(int i) {
	if (A[i].F != -1) return ;
	vector<int> res = ask(i);
	A[i] = Mp(res[0], res[1]);
	return ;
}
 
int find_best(int n) {
	fill(A, A + n, Mp(-1, -1));
	
	if (n <= 5000) {
		for (int i = 0; i < n; i++) {
			askx(i);
			if (A[i].F + A[i].S == 0) return i;
		}
		return -1;
	}
	
	int mx = 0;
	for (int T = 0; T < 475; T++) {
		int i = rng() % n; askx(i);
		if (A[i].F + A[i].S == 0) return i;
		mx = max(mx, A[i].F + A[i].S);
	}
	
	int i = 0;
	while (i < n) {
		askx(i);
		if (A[i].F + A[i].S == 0) return i;
		else if (A[i].F + A[i].S != mx) {
			i++;
			continue;
		}
		
		bool flag = 0;
		int l = i, r = min(n, i + 1024);
		while (r - l > 1) {
			int mid = (l + r) / 2;
			int j = mid; askx(j);
			if (A[j].F + A[j].S == 0) return j;
			if (A[j].F + A[j].S == mx && A[j].F == A[i].F) {
				l = mid;
				if (!flag) break;
			}
			else r = mid;
			flag = 1;
		}
		i = l + 1;
	}
	return -1;
}
# Verdict Execution time Memory Grader output
1 Correct 4 ms 1880 KB Output is correct
2 Correct 4 ms 1880 KB Output is correct
3 Correct 4 ms 1880 KB Output is correct
4 Correct 7 ms 1880 KB Output is correct
5 Correct 5 ms 1880 KB Output is correct
6 Correct 3 ms 1880 KB Output is correct
7 Correct 4 ms 1880 KB Output is correct
8 Correct 4 ms 1880 KB Output is correct
9 Correct 5 ms 1880 KB Output is correct
10 Correct 3 ms 1876 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 1880 KB Output is correct
2 Correct 6 ms 1880 KB Output is correct
3 Correct 6 ms 1880 KB Output is correct
4 Correct 6 ms 1880 KB Output is correct
5 Correct 6 ms 1880 KB Output is correct
6 Correct 2 ms 1880 KB Output is correct
7 Correct 3 ms 1880 KB Output is correct
8 Correct 4 ms 1976 KB Output is correct
9 Correct 4 ms 1880 KB Output is correct
10 Correct 4 ms 1880 KB Output is correct
11 Correct 5 ms 1880 KB Output is correct
12 Correct 2 ms 1880 KB Output is correct
13 Correct 5 ms 1880 KB Output is correct
14 Correct 4 ms 600 KB Output is correct
15 Correct 5 ms 2132 KB Output is correct
16 Correct 11 ms 1880 KB Output is correct
17 Correct 3 ms 1880 KB Output is correct
18 Partially correct 20 ms 1880 KB Partially correct - number of queries: 5360
19 Correct 3 ms 1880 KB Output is correct
20 Correct 9 ms 1112 KB Output is correct
21 Correct 11 ms 1880 KB Output is correct
22 Correct 7 ms 1880 KB Output is correct
23 Correct 3 ms 1880 KB Output is correct
24 Correct 4 ms 2132 KB Output is correct
25 Correct 10 ms 1880 KB Output is correct
26 Correct 15 ms 1880 KB Output is correct
27 Correct 4 ms 1880 KB Output is correct
28 Partially correct 25 ms 1880 KB Partially correct - number of queries: 5475
29 Correct 20 ms 1880 KB Output is correct
30 Partially correct 33 ms 1880 KB Partially correct - number of queries: 5239
31 Correct 3 ms 1876 KB Output is correct
32 Correct 6 ms 1880 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 10 ms 1980 KB Output is correct
35 Correct 5 ms 1880 KB Output is correct
36 Correct 10 ms 1880 KB Output is correct
37 Correct 4 ms 1880 KB Output is correct
38 Correct 4 ms 1880 KB Output is correct
39 Correct 12 ms 1880 KB Output is correct
40 Correct 25 ms 1976 KB Output is correct
41 Correct 20 ms 1976 KB Output is correct
42 Correct 24 ms 1880 KB Output is correct
43 Correct 19 ms 1976 KB Output is correct
44 Correct 11 ms 1880 KB Output is correct
45 Correct 14 ms 1880 KB Output is correct
46 Correct 4 ms 1880 KB Output is correct
47 Correct 17 ms 1880 KB Output is correct
48 Correct 12 ms 1880 KB Output is correct
49 Correct 7 ms 1880 KB Output is correct
50 Partially correct 31 ms 1880 KB Partially correct - number of queries: 5384
51 Correct 11 ms 1880 KB Output is correct
52 Correct 3 ms 1880 KB Output is correct
53 Correct 9 ms 1876 KB Output is correct
54 Correct 10 ms 1880 KB Output is correct
55 Correct 3 ms 1880 KB Output is correct
56 Partially correct 21 ms 1880 KB Partially correct - number of queries: 5361
57 Correct 12 ms 1880 KB Output is correct
58 Correct 12 ms 1880 KB Output is correct
59 Correct 19 ms 1880 KB Output is correct
60 Correct 14 ms 1880 KB Output is correct
61 Correct 5 ms 1880 KB Output is correct
62 Correct 3 ms 1880 KB Output is correct
63 Correct 6 ms 1880 KB Output is correct
64 Correct 5 ms 1880 KB Output is correct
65 Correct 8 ms 1880 KB Output is correct
66 Correct 6 ms 1880 KB Output is correct
67 Correct 5 ms 1880 KB Output is correct
68 Correct 4 ms 1880 KB Output is correct
69 Correct 8 ms 1880 KB Output is correct
70 Correct 6 ms 1880 KB Output is correct
71 Partially correct 22 ms 1880 KB Partially correct - number of queries: 5083
72 Correct 10 ms 1880 KB Output is correct
73 Partially correct 16 ms 1880 KB Partially correct - number of queries: 5024
74 Partially correct 26 ms 1880 KB Partially correct - number of queries: 5050
75 Correct 7 ms 1880 KB Output is correct
76 Correct 23 ms 1880 KB Output is correct
77 Partially correct 27 ms 1880 KB Partially correct - number of queries: 5415
78 Correct 7 ms 1880 KB Output is correct
79 Correct 21 ms 1880 KB Output is correct
80 Partially correct 21 ms 1880 KB Partially correct - number of queries: 5389
81 Partially correct 33 ms 1880 KB Partially correct - number of queries: 5409
82 Partially correct 23 ms 1880 KB Partially correct - number of queries: 5376
83 Correct 6 ms 1880 KB Output is correct
84 Correct 32 ms 1880 KB Output is correct
85 Partially correct 21 ms 1880 KB Partially correct - number of queries: 5403
86 Correct 24 ms 1880 KB Output is correct
87 Correct 8 ms 1880 KB Output is correct
88 Correct 21 ms 1880 KB Output is correct
89 Correct 16 ms 1880 KB Output is correct
90 Correct 6 ms 1880 KB Output is correct
91 Correct 8 ms 1880 KB Output is correct
92 Correct 6 ms 1880 KB Output is correct
93 Partially correct 25 ms 1880 KB Partially correct - number of queries: 5009
94 Partially correct 26 ms 1880 KB Partially correct - number of queries: 5287
95 Partially correct 22 ms 1880 KB Partially correct - number of queries: 5307
96 Partially correct 29 ms 1880 KB Partially correct - number of queries: 5268
97 Correct 19 ms 1880 KB Output is correct