답안 #1029201

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1029201 2024-07-20T13:46:21 Z AmirAli_H1 커다란 상품 (IOI17_prize) C++17
20 / 100
44 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);
 
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 < 300; 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;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 3 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 5 ms 1972 KB Output is correct
5 Correct 3 ms 1880 KB Output is correct
6 Correct 2 ms 1880 KB Output is correct
7 Correct 4 ms 1880 KB Output is correct
8 Correct 5 ms 1880 KB Output is correct
9 Correct 4 ms 1880 KB Output is correct
10 Correct 3 ms 1880 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1880 KB Output is correct
2 Correct 4 ms 1880 KB Output is correct
3 Correct 3 ms 1880 KB Output is correct
4 Correct 5 ms 1880 KB Output is correct
5 Correct 5 ms 1972 KB Output is correct
6 Correct 2 ms 1880 KB Output is correct
7 Correct 4 ms 1880 KB Output is correct
8 Correct 2 ms 1880 KB Output is correct
9 Correct 4 ms 1880 KB Output is correct
10 Correct 3 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 6 ms 1976 KB Output is correct
14 Correct 2 ms 596 KB Output is correct
15 Correct 4 ms 1880 KB Output is correct
16 Correct 19 ms 1876 KB Output is correct
17 Correct 2 ms 1880 KB Output is correct
18 Partially correct 40 ms 1880 KB Partially correct - number of queries: 5190
19 Correct 2 ms 1880 KB Output is correct
20 Correct 6 ms 1112 KB Output is correct
21 Correct 7 ms 1880 KB Output is correct
22 Correct 4 ms 1880 KB Output is correct
23 Correct 2 ms 1880 KB Output is correct
24 Correct 3 ms 1880 KB Output is correct
25 Correct 10 ms 1880 KB Output is correct
26 Correct 9 ms 1880 KB Output is correct
27 Correct 3 ms 1880 KB Output is correct
28 Partially correct 20 ms 1880 KB Partially correct - number of queries: 5304
29 Correct 16 ms 1880 KB Output is correct
30 Partially correct 18 ms 1880 KB Partially correct - number of queries: 5070
31 Correct 2 ms 1876 KB Output is correct
32 Correct 5 ms 1880 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 8 ms 1980 KB Output is correct
35 Correct 4 ms 1880 KB Output is correct
36 Correct 7 ms 1880 KB Output is correct
37 Correct 3 ms 1880 KB Output is correct
38 Correct 3 ms 1880 KB Output is correct
39 Correct 10 ms 1880 KB Output is correct
40 Correct 18 ms 1880 KB Output is correct
41 Correct 9 ms 1880 KB Output is correct
42 Correct 11 ms 1880 KB Output is correct
43 Correct 12 ms 1880 KB Output is correct
44 Correct 8 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 12 ms 1880 KB Output is correct
48 Correct 12 ms 1880 KB Output is correct
49 Correct 3 ms 1880 KB Output is correct
50 Partially correct 20 ms 1880 KB Partially correct - number of queries: 5210
51 Correct 10 ms 1876 KB Output is correct
52 Correct 3 ms 1880 KB Output is correct
53 Correct 5 ms 1880 KB Output is correct
54 Correct 10 ms 1880 KB Output is correct
55 Correct 2 ms 1880 KB Output is correct
56 Partially correct 20 ms 1880 KB Partially correct - number of queries: 5196
57 Correct 16 ms 1880 KB Output is correct
58 Correct 20 ms 1880 KB Output is correct
59 Correct 14 ms 1880 KB Output is correct
60 Correct 15 ms 1880 KB Output is correct
61 Correct 3 ms 1880 KB Output is correct
62 Correct 3 ms 1880 KB Output is correct
63 Correct 4 ms 1880 KB Output is correct
64 Correct 4 ms 1880 KB Output is correct
65 Correct 5 ms 1880 KB Output is correct
66 Correct 11 ms 1880 KB Output is correct
67 Correct 5 ms 1880 KB Output is correct
68 Correct 5 ms 1880 KB Output is correct
69 Correct 7 ms 1880 KB Output is correct
70 Correct 5 ms 1976 KB Output is correct
71 Correct 22 ms 1880 KB Output is correct
72 Correct 8 ms 1880 KB Output is correct
73 Correct 19 ms 1880 KB Output is correct
74 Correct 18 ms 1880 KB Output is correct
75 Correct 4 ms 1880 KB Output is correct
76 Correct 28 ms 1880 KB Output is correct
77 Partially correct 22 ms 1880 KB Partially correct - number of queries: 5224
78 Correct 5 ms 1876 KB Output is correct
79 Correct 15 ms 1880 KB Output is correct
80 Partially correct 24 ms 1880 KB Partially correct - number of queries: 5209
81 Partially correct 18 ms 1880 KB Partially correct - number of queries: 5225
82 Partially correct 17 ms 1880 KB Partially correct - number of queries: 5192
83 Correct 7 ms 1880 KB Output is correct
84 Correct 24 ms 1880 KB Output is correct
85 Partially correct 22 ms 1880 KB Partially correct - number of queries: 5237
86 Partially correct 14 ms 1876 KB Partially correct - number of queries: 5010
87 Correct 4 ms 1880 KB Output is correct
88 Correct 15 ms 1880 KB Output is correct
89 Correct 24 ms 1880 KB Output is correct
90 Correct 3 ms 1880 KB Output is correct
91 Correct 14 ms 1880 KB Output is correct
92 Correct 3 ms 1880 KB Output is correct
93 Incorrect 44 ms 1880 KB Incorrect
94 Halted 0 ms 0 KB -