oj.uz

Submission #763296

# Submission time Handle Problem Language Result Execution time Memory
763296 2023-06-22T07:53:21 Z giaminh2211 Xylophone (JOI18_xylophone) C++14
100 / 100
 87 ms 568 KB 
#include "xylophone.h"
#include <bits/stdc++.h>

using namespace std;

int re[300005];
int a[300005];
int b[300005];

void solve(int N) {
    for (int i = 1; i <= N - 1; i++) {
        a[i] = query(i, i + 1);
    }

    for (int i = 1; i <= N - 2; i++) {
        b[i] = query(i, i + 2);
    }

    re[1] = 1;

    for (int i = 1; i <= N - 2; i++) {
        if (a[i] + a[i + 1] == b[i]) {
            re[i + 1] = re[i];
        } else {
            re[i + 1] = -re[i];
        }
    }

    a[N] = 0;
    int Min = 0;

    for (int i = N - 1; i >= 1; i--) {
        a[i] = a[i + 1] - re[i] * a[i];
        Min = min(Min, a[i]);
    }

    for (int i = 1; i <= N; i++) {
        a[i] = a[i] - Min + 1;
    }

    for (int i = 1; i <= N; i++) {
        if (a[i] == 1) {
            break;
        }

        if (a[i] == N) {
            for (int j = 1; j <= N; j++) {
                a[j] = N + 1 - a[j];
            }
            break;
        }
    }

    for (int i = 1; i <= N; i++) {
        answer(i, a[i]);
    }
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory 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 3 ms 336 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

# Verdict Execution time Memory 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 3 ms 336 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 4 ms 208 KB Output is correct
17 Correct 8 ms 208 KB Output is correct
18 Correct 11 ms 312 KB Output is correct
19 Correct 17 ms 312 KB Output is correct
20 Correct 15 ms 308 KB Output is correct
21 Correct 9 ms 320 KB Output is correct
22 Correct 15 ms 312 KB Output is correct
23 Correct 8 ms 336 KB Output is correct
24 Correct 19 ms 300 KB Output is correct
25 Correct 17 ms 312 KB Output is correct
26 Correct 17 ms 316 KB Output is correct
27 Correct 17 ms 300 KB Output is correct
28 Correct 12 ms 316 KB Output is correct
29 Correct 17 ms 316 KB Output is correct
30 Correct 17 ms 312 KB Output is correct

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory 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 3 ms 336 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 4 ms 208 KB Output is correct
17 Correct 8 ms 208 KB Output is correct
18 Correct 11 ms 312 KB Output is correct
19 Correct 17 ms 312 KB Output is correct
20 Correct 15 ms 308 KB Output is correct
21 Correct 9 ms 320 KB Output is correct
22 Correct 15 ms 312 KB Output is correct
23 Correct 8 ms 336 KB Output is correct
24 Correct 19 ms 300 KB Output is correct
25 Correct 17 ms 312 KB Output is correct
26 Correct 17 ms 316 KB Output is correct
27 Correct 17 ms 300 KB Output is correct
28 Correct 12 ms 316 KB Output is correct
29 Correct 17 ms 316 KB Output is correct
30 Correct 17 ms 312 KB Output is correct
31 Correct 39 ms 312 KB Output is correct
32 Correct 25 ms 320 KB Output is correct
33 Correct 64 ms 320 KB Output is correct
34 Correct 63 ms 324 KB Output is correct
35 Correct 73 ms 372 KB Output is correct
36 Correct 55 ms 568 KB Output is correct
37 Correct 83 ms 316 KB Output is correct
38 Correct 79 ms 316 KB Output is correct
39 Correct 65 ms 300 KB Output is correct
40 Correct 60 ms 448 KB Output is correct
41 Correct 87 ms 328 KB Output is correct
42 Correct 85 ms 328 KB Output is correct
43 Correct 61 ms 320 KB Output is correct
44 Correct 85 ms 308 KB Output is correct
45 Correct 76 ms 332 KB Output is correct
46 Correct 58 ms 316 KB Output is correct
47 Correct 77 ms 328 KB Output is correct
48 Correct 37 ms 316 KB Output is correct
49 Correct 86 ms 312 KB Output is correct
50 Correct 71 ms 328 KB Output is correct
51 Correct 38 ms 320 KB Output is correct
52 Correct 35 ms 440 KB Output is correct
53 Correct 67 ms 312 KB Output is correct
54 Correct 82 ms 316 KB Output is correct
55 Correct 85 ms 328 KB Output is correct
56 Correct 77 ms 436 KB Output is correct
57 Correct 61 ms 328 KB Output is correct
58 Correct 80 ms 312 KB Output is correct
59 Correct 81 ms 320 KB Output is correct
60 Correct 70 ms 308 KB Output is correct