Submission #1029172

# Submission time Handle Problem Language Result Execution time Memory
1029172 2024-07-20T13:30:17 Z AmirAli_H1 The Big Prize (IOI17_prize) C++17
90 / 100
41 ms 1980 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);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int maxn = 2e5 + 7;

int n;
pii A[maxn];

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 i = 0; i < 475; i++) {
		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;
		}
		
		int M = 1024;
		while (i + M < n) {
			int j = i + M; 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) i = j + 1;
			else break;
		}
		bool flag = 0;
		int l = i, r = min(n, i + 512);
		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 5 ms 1880 KB Output is correct
2 Correct 8 ms 1972 KB Output is correct
3 Correct 7 ms 1880 KB Output is correct
4 Correct 22 ms 1880 KB Output is correct
5 Correct 8 ms 1880 KB Output is correct
6 Correct 1 ms 1880 KB Output is correct
7 Correct 8 ms 1880 KB Output is correct
8 Correct 5 ms 1880 KB Output is correct
9 Correct 11 ms 1880 KB Output is correct
10 Correct 19 ms 1880 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 4 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 16 ms 1880 KB Output is correct
5 Correct 8 ms 1880 KB Output is correct
6 Correct 1 ms 1880 KB Output is correct
7 Correct 10 ms 1880 KB Output is correct
8 Correct 8 ms 1880 KB Output is correct
9 Correct 8 ms 1880 KB Output is correct
10 Correct 9 ms 1880 KB Output is correct
11 Correct 6 ms 1880 KB Output is correct
12 Correct 3 ms 1880 KB Output is correct
13 Correct 19 ms 1880 KB Output is correct
14 Correct 4 ms 600 KB Output is correct
15 Correct 7 ms 1880 KB Output is correct
16 Partially correct 27 ms 1880 KB Partially correct - number of queries: 5777
17 Correct 4 ms 1880 KB Output is correct
18 Partially correct 27 ms 1880 KB Partially correct - number of queries: 6882
19 Correct 3 ms 1880 KB Output is correct
20 Correct 9 ms 1112 KB Output is correct
21 Correct 14 ms 1880 KB Output is correct
22 Correct 4 ms 1880 KB Output is correct
23 Correct 4 ms 1880 KB Output is correct
24 Correct 2 ms 1880 KB Output is correct
25 Correct 22 ms 1880 KB Output is correct
26 Correct 16 ms 1880 KB Output is correct
27 Correct 6 ms 1880 KB Output is correct
28 Partially correct 41 ms 1880 KB Partially correct - number of queries: 6661
29 Partially correct 16 ms 1880 KB Partially correct - number of queries: 5431
30 Partially correct 25 ms 1880 KB Partially correct - number of queries: 6844
31 Correct 2 ms 1880 KB Output is correct
32 Correct 8 ms 1880 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 11 ms 1980 KB Output is correct
35 Correct 8 ms 1880 KB Output is correct
36 Correct 10 ms 1880 KB Output is correct
37 Correct 5 ms 1880 KB Output is correct
38 Correct 3 ms 1880 KB Output is correct
39 Correct 13 ms 1880 KB Output is correct
40 Partially correct 26 ms 1880 KB Partially correct - number of queries: 5919
41 Correct 22 ms 1880 KB Output is correct
42 Correct 19 ms 1880 KB Output is correct
43 Correct 17 ms 1880 KB Output is correct
44 Correct 11 ms 1880 KB Output is correct
45 Correct 7 ms 1880 KB Output is correct
46 Correct 2 ms 1880 KB Output is correct
47 Correct 19 ms 1880 KB Output is correct
48 Partially correct 17 ms 1880 KB Partially correct - number of queries: 5042
49 Correct 4 ms 1880 KB Output is correct
50 Partially correct 26 ms 1880 KB Partially correct - number of queries: 6845
51 Correct 9 ms 1880 KB Output is correct
52 Correct 2 ms 1880 KB Output is correct
53 Correct 11 ms 1880 KB Output is correct
54 Correct 14 ms 1880 KB Output is correct
55 Correct 3 ms 1880 KB Output is correct
56 Partially correct 35 ms 1880 KB Partially correct - number of queries: 6875
57 Correct 24 ms 1880 KB Output is correct
58 Partially correct 23 ms 1880 KB Partially correct - number of queries: 5014
59 Correct 20 ms 1880 KB Output is correct
60 Correct 19 ms 1880 KB Output is correct
61 Correct 11 ms 1880 KB Output is correct
62 Correct 5 ms 1880 KB Output is correct
63 Correct 13 ms 1880 KB Output is correct
64 Correct 6 ms 1880 KB Output is correct
65 Correct 10 ms 1880 KB Output is correct
66 Correct 14 ms 1880 KB Output is correct
67 Correct 12 ms 1880 KB Output is correct
68 Correct 3 ms 1880 KB Output is correct
69 Correct 11 ms 1880 KB Output is correct
70 Correct 19 ms 1880 KB Output is correct
71 Partially correct 31 ms 1880 KB Partially correct - number of queries: 6186
72 Correct 13 ms 1880 KB Output is correct
73 Partially correct 20 ms 1880 KB Partially correct - number of queries: 6153
74 Partially correct 21 ms 1880 KB Partially correct - number of queries: 6159
75 Correct 13 ms 1880 KB Output is correct
76 Partially correct 14 ms 1880 KB Partially correct - number of queries: 5705
77 Partially correct 34 ms 1880 KB Partially correct - number of queries: 6478
78 Correct 12 ms 1880 KB Output is correct
79 Correct 19 ms 1880 KB Output is correct
80 Partially correct 32 ms 1880 KB Partially correct - number of queries: 6477
81 Partially correct 29 ms 1880 KB Partially correct - number of queries: 6444
82 Partially correct 34 ms 1880 KB Partially correct - number of queries: 6497
83 Correct 16 ms 1880 KB Output is correct
84 Partially correct 23 ms 1880 KB Partially correct - number of queries: 5786
85 Partially correct 23 ms 1880 KB Partially correct - number of queries: 6435
86 Correct 13 ms 1880 KB Output is correct
87 Correct 8 ms 1880 KB Output is correct
88 Correct 17 ms 1880 KB Output is correct
89 Correct 7 ms 1880 KB Output is correct
90 Correct 12 ms 1880 KB Output is correct
91 Correct 13 ms 1880 KB Output is correct
92 Correct 16 ms 1880 KB Output is correct
93 Correct 8 ms 1880 KB Output is correct
94 Correct 9 ms 1880 KB Output is correct
95 Correct 12 ms 1880 KB Output is correct
96 Correct 12 ms 1880 KB Output is correct
97 Correct 11 ms 1880 KB Output is correct