답안 #1028882

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1028882 2024-07-20T09:52:03 Z AmirAli_H1 커다란 상품 (IOI17_prize) C++17
90 / 100
47 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 < 500; 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 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;
			else r = mid;
		}
		i = r;
	}
	return -1;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 1880 KB Output is correct
2 Correct 20 ms 1880 KB Output is correct
3 Correct 8 ms 1880 KB Output is correct
4 Correct 36 ms 1880 KB Output is correct
5 Correct 13 ms 1880 KB Output is correct
6 Correct 1 ms 1880 KB Output is correct
7 Correct 13 ms 1880 KB Output is correct
8 Correct 14 ms 1880 KB Output is correct
9 Correct 11 ms 1880 KB Output is correct
10 Correct 21 ms 1880 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 1880 KB Output is correct
2 Correct 15 ms 1972 KB Output is correct
3 Correct 15 ms 1880 KB Output is correct
4 Correct 21 ms 1880 KB Output is correct
5 Correct 10 ms 1880 KB Output is correct
6 Correct 1 ms 1880 KB Output is correct
7 Correct 16 ms 1880 KB Output is correct
8 Correct 10 ms 1880 KB Output is correct
9 Correct 14 ms 1880 KB Output is correct
10 Correct 23 ms 1880 KB Output is correct
11 Correct 13 ms 1880 KB Output is correct
12 Correct 5 ms 1880 KB Output is correct
13 Correct 17 ms 1880 KB Output is correct
14 Correct 3 ms 600 KB Output is correct
15 Correct 8 ms 1972 KB Output is correct
16 Correct 25 ms 1968 KB Output is correct
17 Correct 3 ms 1880 KB Output is correct
18 Correct 24 ms 1880 KB Output is correct
19 Correct 3 ms 1880 KB Output is correct
20 Correct 7 ms 1112 KB Output is correct
21 Correct 7 ms 1880 KB Output is correct
22 Correct 6 ms 1880 KB Output is correct
23 Correct 5 ms 1880 KB Output is correct
24 Correct 3 ms 1976 KB Output is correct
25 Correct 20 ms 1880 KB Output is correct
26 Correct 17 ms 1880 KB Output is correct
27 Correct 10 ms 1880 KB Output is correct
28 Partially correct 37 ms 1880 KB Partially correct - number of queries: 6645
29 Partially correct 34 ms 1880 KB Partially correct - number of queries: 5620
30 Correct 29 ms 1880 KB Output is correct
31 Correct 4 ms 1980 KB Output is correct
32 Correct 19 ms 1880 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 9 ms 1880 KB Output is correct
35 Correct 14 ms 1972 KB Output is correct
36 Correct 7 ms 1880 KB Output is correct
37 Correct 7 ms 1880 KB Output is correct
38 Correct 5 ms 1880 KB Output is correct
39 Correct 11 ms 1880 KB Output is correct
40 Correct 26 ms 1880 KB Output is correct
41 Correct 20 ms 1880 KB Output is correct
42 Correct 14 ms 1880 KB Output is correct
43 Correct 11 ms 1880 KB Output is correct
44 Correct 12 ms 1880 KB Output is correct
45 Correct 11 ms 1968 KB Output is correct
46 Correct 4 ms 1880 KB Output is correct
47 Correct 11 ms 1880 KB Output is correct
48 Correct 17 ms 1880 KB Output is correct
49 Correct 3 ms 1880 KB Output is correct
50 Correct 29 ms 1880 KB Output is correct
51 Correct 13 ms 1880 KB Output is correct
52 Correct 3 ms 1880 KB Output is correct
53 Correct 16 ms 1880 KB Output is correct
54 Correct 11 ms 1976 KB Output is correct
55 Correct 3 ms 1880 KB Output is correct
56 Correct 22 ms 1880 KB Output is correct
57 Correct 23 ms 1880 KB Output is correct
58 Correct 16 ms 1880 KB Output is correct
59 Correct 20 ms 1880 KB Output is correct
60 Correct 18 ms 1880 KB Output is correct
61 Correct 19 ms 1880 KB Output is correct
62 Correct 5 ms 1956 KB Output is correct
63 Correct 20 ms 1880 KB Output is correct
64 Correct 13 ms 1876 KB Output is correct
65 Correct 24 ms 1956 KB Output is correct
66 Correct 29 ms 1880 KB Output is correct
67 Correct 20 ms 1880 KB Output is correct
68 Correct 3 ms 1880 KB Output is correct
69 Correct 23 ms 1880 KB Output is correct
70 Correct 23 ms 1976 KB Output is correct
71 Partially correct 41 ms 1880 KB Partially correct - number of queries: 6290
72 Correct 24 ms 1880 KB Output is correct
73 Partially correct 44 ms 1880 KB Partially correct - number of queries: 6260
74 Partially correct 39 ms 1880 KB Partially correct - number of queries: 6274
75 Correct 27 ms 1880 KB Output is correct
76 Partially correct 27 ms 1880 KB Partially correct - number of queries: 6002
77 Partially correct 24 ms 1880 KB Partially correct - number of queries: 6550
78 Correct 19 ms 1880 KB Output is correct
79 Partially correct 31 ms 1880 KB Partially correct - number of queries: 5328
80 Partially correct 32 ms 1876 KB Partially correct - number of queries: 6582
81 Partially correct 26 ms 1880 KB Partially correct - number of queries: 6545
82 Partially correct 47 ms 1880 KB Partially correct - number of queries: 6559
83 Correct 20 ms 1880 KB Output is correct
84 Partially correct 35 ms 1880 KB Partially correct - number of queries: 6136
85 Partially correct 35 ms 1880 KB Partially correct - number of queries: 6513
86 Correct 22 ms 1880 KB Output is correct
87 Correct 22 ms 1880 KB Output is correct
88 Correct 23 ms 1880 KB Output is correct
89 Correct 15 ms 1880 KB Output is correct
90 Correct 27 ms 1880 KB Output is correct
91 Correct 18 ms 1880 KB Output is correct
92 Correct 28 ms 1880 KB Output is correct
93 Correct 19 ms 1880 KB Output is correct
94 Correct 14 ms 1880 KB Output is correct
95 Correct 27 ms 1880 KB Output is correct
96 Correct 30 ms 1880 KB Output is correct
97 Correct 16 ms 1880 KB Output is correct