oj.uz

답안 #1028674

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1028674 2024-07-20T06:55:21 Z DorostWef 커다란 상품 (IOI17_prize) C++17
97.69 / 100
 26 ms 432 KB 
#include "prize.h"
#include <bits/stdc++.h>

using namespace std;

int cnt;
int L, R;

int solve (int l, int r, int cl, int cr) {
	if (l > r || cl + cr == cnt || l > R || r < L)
		return 0;
	if (l == r) {
		vector<int> a = ask(l);
		if (a[0] + a[1] == 0)
			return l;
		if (a[0] + a[1] != cnt) {
			if (a[0] == 0)
				L = max (L, l + 1);
			if (a[1] == 0)
				R = min (R, l - 1);
		}
		return 0;
	}
	int wef = cl + cr;
	int mid = (l + r) >> 1;
	int mn = mid, mx = mid;
	for (int i = 0; i < cnt - wef; i++) {
		int x;
		if (i % 2 == 1) {
			x = mid + i / 2 + 1;
		} else {
			x = mid - i / 2;
		}
		mn = min (mn, x);
		mx = max (mx, x);
		vector<int> a = ask(x);
		if (a[0] + a[1] == 0)
			return x;
		if (a[0] + a[1] == cnt) {
			int ans = 0;
				if (x == mn) 
					ans ^= solve (l, mn - 1, cl, a[1]);
				else
					ans ^= solve (l, mn - 1, cl, a[1] + i);
				if (x == mx)
					ans ^= solve (mx + 1, r, a[0], cr);
				else
					ans ^= solve (mx + 1, r, a[0] + i, cr);
			return ans;
		}
		if (a[0] == 0)
			L = max (L, x + 1);
		if (a[1] == 0)
			R = min (R, x - 1);
	}
	return 0;
}

int find_best(int n) {
	R = n - 1;
	L = 0;
	for (int i = max (0, n - 472); i < n; i++) {
		vector<int> a = ask(i);
		if(a[0] + a[1] == 0)
			return i;
		cnt = max (cnt, a[0] + a[1]);
	}
	return solve (0, n - 1, 0, 0);
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 344 KB Output is correct
2 Correct 2 ms 344 KB Output is correct
3 Correct 2 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 3 ms 344 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 3 ms 344 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Correct 2 ms 344 KB Output is correct
10 Correct 2 ms 344 KB Output is correct

Subtask #2
77.69 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 344 KB Output is correct
2 Correct 2 ms 344 KB Output is correct
3 Correct 2 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 3 ms 344 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Correct 2 ms 344 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 4 ms 344 KB Output is correct
12 Correct 3 ms 344 KB Output is correct
13 Correct 5 ms 344 KB Output is correct
14 Correct 3 ms 344 KB Output is correct
15 Correct 4 ms 428 KB Output is correct
16 Correct 11 ms 344 KB Output is correct
17 Correct 3 ms 344 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 7 ms 432 KB Output is correct
20 Correct 11 ms 344 KB Output is correct
21 Correct 14 ms 344 KB Output is correct
22 Correct 4 ms 344 KB Output is correct
23 Correct 3 ms 344 KB Output is correct
24 Correct 3 ms 344 KB Output is correct
25 Correct 9 ms 344 KB Output is correct
26 Correct 8 ms 344 KB Output is correct
27 Correct 3 ms 344 KB Output is correct
28 Correct 14 ms 344 KB Output is correct
29 Correct 17 ms 344 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 2 ms 344 KB Output is correct
32 Correct 5 ms 344 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 10 ms 388 KB Output is correct
35 Correct 2 ms 344 KB Output is correct
36 Correct 7 ms 344 KB Output is correct
37 Correct 4 ms 344 KB Output is correct
38 Correct 2 ms 344 KB Output is correct
39 Correct 10 ms 344 KB Output is correct
40 Correct 20 ms 344 KB Output is correct
41 Correct 19 ms 344 KB Output is correct
42 Correct 10 ms 344 KB Output is correct
43 Correct 14 ms 344 KB Output is correct
44 Correct 12 ms 344 KB Output is correct
45 Correct 10 ms 344 KB Output is correct
46 Correct 7 ms 344 KB Output is correct
47 Correct 13 ms 344 KB Output is correct
48 Correct 16 ms 344 KB Output is correct
49 Correct 5 ms 340 KB Output is correct
50 Correct 1 ms 344 KB Output is correct
51 Correct 18 ms 344 KB Output is correct
52 Correct 5 ms 344 KB Output is correct
53 Correct 3 ms 344 KB Output is correct
54 Correct 10 ms 344 KB Output is correct
55 Correct 3 ms 344 KB Output is correct
56 Correct 0 ms 344 KB Output is correct
57 Correct 15 ms 344 KB Output is correct
58 Correct 14 ms 340 KB Output is correct
59 Correct 13 ms 344 KB Output is correct
60 Correct 11 ms 344 KB Output is correct
61 Correct 4 ms 344 KB Output is correct
62 Correct 2 ms 344 KB Output is correct
63 Correct 4 ms 344 KB Output is correct
64 Correct 2 ms 344 KB Output is correct
65 Correct 1 ms 344 KB Output is correct
66 Correct 3 ms 344 KB Output is correct
67 Correct 0 ms 344 KB Output is correct
68 Correct 3 ms 344 KB Output is correct
69 Correct 2 ms 344 KB Output is correct
70 Correct 1 ms 344 KB Output is correct
71 Partially correct 23 ms 344 KB Partially correct - number of queries: 5231
72 Correct 5 ms 340 KB Output is correct
73 Partially correct 21 ms 344 KB Partially correct - number of queries: 5168
74 Partially correct 22 ms 344 KB Partially correct - number of queries: 5195
75 Correct 2 ms 344 KB Output is correct
76 Correct 26 ms 340 KB Output is correct
77 Correct 16 ms 344 KB Output is correct
78 Correct 4 ms 344 KB Output is correct
79 Correct 11 ms 344 KB Output is correct
80 Correct 26 ms 344 KB Output is correct
81 Correct 18 ms 344 KB Output is correct
82 Correct 15 ms 344 KB Output is correct
83 Correct 2 ms 344 KB Output is correct
84 Correct 11 ms 344 KB Output is correct
85 Correct 20 ms 344 KB Output is correct
86 Correct 4 ms 344 KB Output is correct
87 Correct 3 ms 344 KB Output is correct
88 Correct 7 ms 344 KB Output is correct
89 Correct 3 ms 344 KB Output is correct
90 Correct 2 ms 344 KB Output is correct
91 Correct 3 ms 344 KB Output is correct
92 Correct 4 ms 344 KB Output is correct
93 Correct 4 ms 340 KB Output is correct
94 Correct 4 ms 344 KB Output is correct
95 Correct 4 ms 344 KB Output is correct
96 Correct 5 ms 344 KB Output is correct
97 Correct 3 ms 344 KB Output is correct