oj.uz

답안 #815373

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
815373 2023-08-08T14:30:58 Z Pikachu Xylophone (JOI18_xylophone) C++17
100 / 100
 64 ms 440 KB 
#include <bits/stdc++.h>
#include "xylophone.h"

using namespace std;

const int maxn = 5010;
int a[maxn];
bool done[maxn];

void solve(int n) 
{
    int l = 1;
    int r = n;
    int dak = 1;
    while (l <= r) {
        int mid = (l + r) / 2;
        if (query(mid, n) == n - 1) dak = mid, l = mid + 1;
        else r = mid - 1;
    }
    l = dak;
    answer(l, 1);
    a[l] = 1;
    done[1] = true;
    for (int i = l - 1; i >= 1; i--) {
        int x = query(i, i + 1);
        int ans = -1;
        if (a[i + 1] - x <= 0 || done[a[i + 1] - x]) ans = a[i + 1] + x;
        if (a[i + 1] + x > n || done[a[i + 1] + x]) ans = a[i + 1] - x;
        if (ans == -1) {
            if (max({a[i + 1] + x, a[i + 1], a[i + 2]})
              - min({a[i + 1] + x, a[i + 1], a[i + 2]})
             != query(i, i + 2)) ans = a[i + 1] - x;
            else ans = a[i + 1] + x;
        }
        a[i] = ans;
        done[ans] = true;
        answer(i, a[i]);
    }
    for (int i = l + 1; i <= n; i++) {
        int x = query(i - 1, i);
        int ans = -1;
        if (a[i - 1] - x <= 0 || done[a[i - 1] - x]) ans = a[i - 1] + x;
        if (a[i - 1] + x > n || done[a[i - 1] + x]) ans = a[i - 1] - x;
        if (ans == -1) {
            if (max({a[i - 1] + x, a[i - 1], a[i - 2]})
              - min({a[i - 1] + x, a[i - 1], a[i - 2]})
             != query(i - 2, i)) ans = a[i - 1] - x;
            else ans = a[i - 1] + x;
        }
        a[i] = ans;
        done[ans] = true;
        answer(i, a[i]);
    }
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 2 ms 208 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 1 ms 300 KB Output is correct
10 Correct 2 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 2 ms 208 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 2 ms 208 KB Output is correct

Subtask #2
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 2 ms 208 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 1 ms 300 KB Output is correct
10 Correct 2 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 2 ms 208 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 2 ms 208 KB Output is correct
16 Correct 2 ms 208 KB Output is correct
17 Correct 5 ms 208 KB Output is correct
18 Correct 9 ms 304 KB Output is correct
19 Correct 8 ms 308 KB Output is correct
20 Correct 7 ms 312 KB Output is correct
21 Correct 8 ms 208 KB Output is correct
22 Correct 9 ms 304 KB Output is correct
23 Correct 7 ms 208 KB Output is correct
24 Correct 10 ms 308 KB Output is correct
25 Correct 7 ms 208 KB Output is correct
26 Correct 11 ms 208 KB Output is correct
27 Correct 5 ms 304 KB Output is correct
28 Correct 8 ms 208 KB Output is correct
29 Correct 13 ms 308 KB Output is correct
30 Correct 12 ms 208 KB Output is correct

Subtask #3
53.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 2 ms 208 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 1 ms 300 KB Output is correct
10 Correct 2 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 2 ms 208 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 2 ms 208 KB Output is correct
16 Correct 2 ms 208 KB Output is correct
17 Correct 5 ms 208 KB Output is correct
18 Correct 9 ms 304 KB Output is correct
19 Correct 8 ms 308 KB Output is correct
20 Correct 7 ms 312 KB Output is correct
21 Correct 8 ms 208 KB Output is correct
22 Correct 9 ms 304 KB Output is correct
23 Correct 7 ms 208 KB Output is correct
24 Correct 10 ms 308 KB Output is correct
25 Correct 7 ms 208 KB Output is correct
26 Correct 11 ms 208 KB Output is correct
27 Correct 5 ms 304 KB Output is correct
28 Correct 8 ms 208 KB Output is correct
29 Correct 13 ms 308 KB Output is correct
30 Correct 12 ms 208 KB Output is correct
31 Correct 17 ms 292 KB Output is correct
32 Correct 28 ms 292 KB Output is correct
33 Correct 34 ms 292 KB Output is correct
34 Correct 24 ms 320 KB Output is correct
35 Correct 59 ms 208 KB Output is correct
36 Correct 44 ms 304 KB Output is correct
37 Correct 35 ms 304 KB Output is correct
38 Correct 35 ms 296 KB Output is correct
39 Correct 37 ms 440 KB Output is correct
40 Correct 54 ms 300 KB Output is correct
41 Correct 41 ms 208 KB Output is correct
42 Correct 41 ms 304 KB Output is correct
43 Correct 27 ms 300 KB Output is correct
44 Correct 42 ms 312 KB Output is correct
45 Correct 64 ms 304 KB Output is correct
46 Correct 42 ms 300 KB Output is correct
47 Correct 45 ms 208 KB Output is correct
48 Correct 35 ms 208 KB Output is correct
49 Correct 49 ms 300 KB Output is correct
50 Correct 43 ms 208 KB Output is correct
51 Correct 55 ms 304 KB Output is correct
52 Correct 37 ms 208 KB Output is correct
53 Correct 59 ms 208 KB Output is correct
54 Correct 32 ms 292 KB Output is correct
55 Correct 53 ms 312 KB Output is correct
56 Correct 41 ms 208 KB Output is correct
57 Correct 48 ms 300 KB Output is correct
58 Correct 44 ms 312 KB Output is correct
59 Correct 40 ms 304 KB Output is correct
60 Correct 58 ms 208 KB Output is correct