oj.uz

답안 #586889

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
586889 2022-06-30T22:22:37 Z stevancv Xylophone (JOI18_xylophone) C++14
100 / 100
 147 ms 328 KB 
#include <bits/stdc++.h>
#include "xylophone.h"
#define ll long long
#define ld long double
#define sp ' '
#define en '\n'
#define smin(a, b) a = min(a, b)
#define smax(a, b) a = max(a, b)
using namespace std;
void solve(int n) {
    vector<int> a(n);
    for (int i = 1; i < n; i++) {
        a[i] = query(i, i + 1);
    }
    vector<bool> b(n - 1);
    for (int i = 1; i < n - 1; i++) {
        int x = query(i, i + 2);
        if (x == a[i] + a[i + 1]) b[i] = 1;
    }
    vector<int> ans(n + 1);
    auto Can = [&] (int x) {
        ans[x] = 1;
        int tr = 1;
        int up = 1;
        for (int i = x - 1; i >= 1; i--) {
            if (i == x - 1) {
                tr += a[i];
                ans[i] = tr;
                continue;
            }
            if (b[i] == 0) up ^= 1;
            if (up == 1) tr += a[i];
            else tr -= a[i];
            ans[i] = tr;
        }
        tr = 1;
        up = 1;
        for (int i = x + 1; i <= n; i++) {
            if (i == x + 1) {
                tr += a[i - 1];
                ans[i] = tr;
                continue;
            }
            if (b[i - 2] == 0) up ^= 1;
            if (up == 1) tr += a[i - 1];
            else tr -= a[i - 1];
            ans[i] = tr;
        }
        bool p = 0;
        for (int i = 1; i <= n; i++) {
            if (ans[i] <= 0) return false;
            if (i > x && ans[i] == n) p = 1;
        }
        return p;
    };
    for (int i = 1; i <= n; i++) {
        if (Can(i)) {
            for (int j = 1; j <= n; j++) answer(j, ans[j]);
            return;
        }
    }
}

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 2 ms 208 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 2 ms 208 KB Output is correct
9 Correct 2 ms 208 KB Output is correct
10 Correct 2 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 2 ms 208 KB Output is correct
13 Correct 2 ms 208 KB Output is correct
14 Correct 2 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 2 ms 208 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 2 ms 208 KB Output is correct
9 Correct 2 ms 208 KB Output is correct
10 Correct 2 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 2 ms 208 KB Output is correct
13 Correct 2 ms 208 KB Output is correct
14 Correct 2 ms 208 KB Output is correct
15 Correct 2 ms 208 KB Output is correct
16 Correct 5 ms 208 KB Output is correct
17 Correct 11 ms 208 KB Output is correct
18 Correct 15 ms 284 KB Output is correct
19 Correct 15 ms 208 KB Output is correct
20 Correct 19 ms 208 KB Output is correct
21 Correct 22 ms 280 KB Output is correct
22 Correct 16 ms 208 KB Output is correct
23 Correct 19 ms 292 KB Output is correct
24 Correct 20 ms 208 KB Output is correct
25 Correct 17 ms 208 KB Output is correct
26 Correct 21 ms 280 KB Output is correct
27 Correct 17 ms 208 KB Output is correct
28 Correct 16 ms 304 KB Output is correct
29 Correct 19 ms 208 KB Output is correct
30 Correct 15 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 2 ms 208 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 2 ms 208 KB Output is correct
9 Correct 2 ms 208 KB Output is correct
10 Correct 2 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 2 ms 208 KB Output is correct
13 Correct 2 ms 208 KB Output is correct
14 Correct 2 ms 208 KB Output is correct
15 Correct 2 ms 208 KB Output is correct
16 Correct 5 ms 208 KB Output is correct
17 Correct 11 ms 208 KB Output is correct
18 Correct 15 ms 284 KB Output is correct
19 Correct 15 ms 208 KB Output is correct
20 Correct 19 ms 208 KB Output is correct
21 Correct 22 ms 280 KB Output is correct
22 Correct 16 ms 208 KB Output is correct
23 Correct 19 ms 292 KB Output is correct
24 Correct 20 ms 208 KB Output is correct
25 Correct 17 ms 208 KB Output is correct
26 Correct 21 ms 280 KB Output is correct
27 Correct 17 ms 208 KB Output is correct
28 Correct 16 ms 304 KB Output is correct
29 Correct 19 ms 208 KB Output is correct
30 Correct 15 ms 208 KB Output is correct
31 Correct 38 ms 288 KB Output is correct
32 Correct 56 ms 304 KB Output is correct
33 Correct 91 ms 300 KB Output is correct
34 Correct 91 ms 312 KB Output is correct
35 Correct 90 ms 328 KB Output is correct
36 Correct 82 ms 296 KB Output is correct
37 Correct 122 ms 328 KB Output is correct
38 Correct 94 ms 300 KB Output is correct
39 Correct 79 ms 296 KB Output is correct
40 Correct 89 ms 300 KB Output is correct
41 Correct 101 ms 300 KB Output is correct
42 Correct 86 ms 296 KB Output is correct
43 Correct 147 ms 312 KB Output is correct
44 Correct 91 ms 300 KB Output is correct
45 Correct 82 ms 304 KB Output is correct
46 Correct 93 ms 308 KB Output is correct
47 Correct 69 ms 328 KB Output is correct
48 Correct 72 ms 300 KB Output is correct
49 Correct 81 ms 308 KB Output is correct
50 Correct 109 ms 320 KB Output is correct
51 Correct 73 ms 328 KB Output is correct
52 Correct 119 ms 300 KB Output is correct
53 Correct 96 ms 320 KB Output is correct
54 Correct 91 ms 296 KB Output is correct
55 Correct 90 ms 316 KB Output is correct
56 Correct 65 ms 300 KB Output is correct
57 Correct 83 ms 296 KB Output is correct
58 Correct 121 ms 312 KB Output is correct
59 Correct 68 ms 328 KB Output is correct
60 Correct 88 ms 296 KB Output is correct