답안 #67426

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
67426 2018-08-14T09:14:17 Z aome Xylophone (JOI18_xylophone) C++17
100 / 100
90 ms 716 KB
#include "xylophone.h"

#include <bits/stdc++.h>

using namespace std;

int a[5005];
bool visit[5005];

void solve(int n) {
	int l = 1, r = n;
	while (l < r) {
		int mid = (l + r + 1) >> 1;
		if (query(mid, n) == n - 1) l = mid;
		else r = mid - 1;
	}
	int pos1 = l;
	a[pos1] = 1;
	visit[1] = 1;
	int tmp = 1 + query(pos1, pos1 + 1);
	a[pos1 + 1] = tmp;
	visit[tmp] = 1;
	for (int i = pos1 + 2; i <= n; ++i) {
		int tmp = query(i - 1, i);
		if (a[i - 1] + tmp > n || visit[a[i - 1] + tmp]) {
			a[i] = a[i - 1] - tmp;
		}
		else if (a[i - 1] - tmp < 1 || visit[a[i - 1] - tmp]) {
			a[i] = a[i - 1] + tmp;
		}
		else {
			int tmp2 = query(i - 2, i);
			a[i] = a[i - 1] + tmp;
			int mn = min(min(a[i], a[i - 1]), a[i - 2]);
			int mx = max(max(a[i], a[i - 1]), a[i - 2]);
			if (mx - mn != tmp2) a[i] = a[i - 1] - tmp;
		}
		visit[a[i]] = 1;
	}
	if (pos1 != 1) {
		int tmp = 1 + query(pos1 - 1, pos1);
		a[pos1 - 1] = tmp;
	}
	for (int i = pos1 - 2; i >= 1; --i) {
		int tmp = query(i, i + 1);
		if (a[i + 1] + tmp > n || visit[a[i + 1] + tmp]) {
			a[i] = a[i + 1] - tmp;
		}
		else if (a[i + 1] - tmp < 1 || visit[a[i + 1] - tmp]) {
			a[i] = a[i + 1] + tmp;
		}
		else {
			int tmp2 = query(i, i + 2);
			a[i] = a[i + 1] + tmp;
			int mn = min(min(a[i], a[i + 1]), a[i + 2]);
			int mx = max(max(a[i], a[i + 1]), a[i + 2]);
			if (mx - mn != tmp2) a[i] = a[i + 1] - tmp;
		}
		visit[a[i]] = 1;
	}
	for (int i = 1; i <= n; ++i) answer(i, a[i]);
}
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 3 ms 436 KB Output is correct
3 Correct 2 ms 436 KB Output is correct
4 Correct 3 ms 464 KB Output is correct
5 Correct 3 ms 464 KB Output is correct
6 Correct 5 ms 464 KB Output is correct
7 Correct 3 ms 464 KB Output is correct
8 Correct 4 ms 496 KB Output is correct
9 Correct 3 ms 496 KB Output is correct
10 Correct 3 ms 496 KB Output is correct
11 Correct 4 ms 496 KB Output is correct
12 Correct 3 ms 516 KB Output is correct
13 Correct 3 ms 520 KB Output is correct
14 Correct 3 ms 520 KB Output is correct
15 Correct 4 ms 524 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 3 ms 436 KB Output is correct
3 Correct 2 ms 436 KB Output is correct
4 Correct 3 ms 464 KB Output is correct
5 Correct 3 ms 464 KB Output is correct
6 Correct 5 ms 464 KB Output is correct
7 Correct 3 ms 464 KB Output is correct
8 Correct 4 ms 496 KB Output is correct
9 Correct 3 ms 496 KB Output is correct
10 Correct 3 ms 496 KB Output is correct
11 Correct 4 ms 496 KB Output is correct
12 Correct 3 ms 516 KB Output is correct
13 Correct 3 ms 520 KB Output is correct
14 Correct 3 ms 520 KB Output is correct
15 Correct 4 ms 524 KB Output is correct
16 Correct 6 ms 528 KB Output is correct
17 Correct 7 ms 528 KB Output is correct
18 Correct 15 ms 572 KB Output is correct
19 Correct 14 ms 572 KB Output is correct
20 Correct 14 ms 572 KB Output is correct
21 Correct 13 ms 572 KB Output is correct
22 Correct 11 ms 572 KB Output is correct
23 Correct 9 ms 572 KB Output is correct
24 Correct 10 ms 716 KB Output is correct
25 Correct 10 ms 716 KB Output is correct
26 Correct 10 ms 716 KB Output is correct
27 Correct 13 ms 716 KB Output is correct
28 Correct 13 ms 716 KB Output is correct
29 Correct 12 ms 716 KB Output is correct
30 Correct 16 ms 716 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 3 ms 436 KB Output is correct
3 Correct 2 ms 436 KB Output is correct
4 Correct 3 ms 464 KB Output is correct
5 Correct 3 ms 464 KB Output is correct
6 Correct 5 ms 464 KB Output is correct
7 Correct 3 ms 464 KB Output is correct
8 Correct 4 ms 496 KB Output is correct
9 Correct 3 ms 496 KB Output is correct
10 Correct 3 ms 496 KB Output is correct
11 Correct 4 ms 496 KB Output is correct
12 Correct 3 ms 516 KB Output is correct
13 Correct 3 ms 520 KB Output is correct
14 Correct 3 ms 520 KB Output is correct
15 Correct 4 ms 524 KB Output is correct
16 Correct 6 ms 528 KB Output is correct
17 Correct 7 ms 528 KB Output is correct
18 Correct 15 ms 572 KB Output is correct
19 Correct 14 ms 572 KB Output is correct
20 Correct 14 ms 572 KB Output is correct
21 Correct 13 ms 572 KB Output is correct
22 Correct 11 ms 572 KB Output is correct
23 Correct 9 ms 572 KB Output is correct
24 Correct 10 ms 716 KB Output is correct
25 Correct 10 ms 716 KB Output is correct
26 Correct 10 ms 716 KB Output is correct
27 Correct 13 ms 716 KB Output is correct
28 Correct 13 ms 716 KB Output is correct
29 Correct 12 ms 716 KB Output is correct
30 Correct 16 ms 716 KB Output is correct
31 Correct 23 ms 716 KB Output is correct
32 Correct 36 ms 716 KB Output is correct
33 Correct 46 ms 716 KB Output is correct
34 Correct 80 ms 716 KB Output is correct
35 Correct 83 ms 716 KB Output is correct
36 Correct 55 ms 716 KB Output is correct
37 Correct 42 ms 716 KB Output is correct
38 Correct 48 ms 716 KB Output is correct
39 Correct 44 ms 716 KB Output is correct
40 Correct 78 ms 716 KB Output is correct
41 Correct 90 ms 716 KB Output is correct
42 Correct 51 ms 716 KB Output is correct
43 Correct 74 ms 716 KB Output is correct
44 Correct 56 ms 716 KB Output is correct
45 Correct 68 ms 716 KB Output is correct
46 Correct 34 ms 716 KB Output is correct
47 Correct 55 ms 716 KB Output is correct
48 Correct 31 ms 716 KB Output is correct
49 Correct 57 ms 716 KB Output is correct
50 Correct 75 ms 716 KB Output is correct
51 Correct 84 ms 716 KB Output is correct
52 Correct 72 ms 716 KB Output is correct
53 Correct 56 ms 716 KB Output is correct
54 Correct 47 ms 716 KB Output is correct
55 Correct 89 ms 716 KB Output is correct
56 Correct 47 ms 716 KB Output is correct
57 Correct 73 ms 716 KB Output is correct
58 Correct 86 ms 716 KB Output is correct
59 Correct 64 ms 716 KB Output is correct
60 Correct 72 ms 716 KB Output is correct