oj.uz

Submission #643798

# Submission time Handle Problem Language Result Execution time Memory
643798 2022-09-23T03:57:40 Z kausarme Xylophone (JOI18_xylophone) C++14
100 / 100
 109 ms 336 KB 
#include "xylophone.h"

void solve(int N) {
    int A[N];
    A[0] = 0;
    int D[N - 1]; // berisi selisih A[i] dengan A[i-1]
    int T[N - 2]; //  erisi selisih A[i] dengan A[i-1]
    for(int i = 1; i < N; i++) {
        D[i - 1] = query(i, i + 1);
    }
    for(int i = 2; i < N; i++) {
        T[i - 2] = query(i - 1, i + 1);
    }
    A[1] = D[0];
    bool up = true; // cek menaik atau tidak
    for(int i = 2; i < N; i++) {
        if(D[i - 2] + D[i - 1] != T[i - 2]) {
            up = !up;
        }
        A[i] = A[i - 1] + D[i - 1] * (up ? 1 : - 1);
    }

    int maks = 0, mins = 0;
    int maksPos = 0, minsPos = 0;


    // cek posisi 1 dan N
    for(int i = 1; i < N; i++) {
        if(A[i] > maks) {
            maks = A[i];
            maksPos = i;
        }
        if(A[i] < mins) {
            mins = A[i];
            minsPos = i;
        }
    }
    if(minsPos < maksPos) {
        for(int i = 0; i < N; i++) {
            A[i] = A[i] - mins + 1;
        }
    } else {
        for(int i = 0; i < N; i++) {
            A[i] =  maks - A[i] + 1;
        }
    }

    // Answer
    for(int i = 0; i < N; i++) {
        answer(i+1,A[i]);
    }
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 3 ms 208 KB Output is correct
5 Correct 3 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 3 ms 208 KB Output is correct
9 Correct 2 ms 208 KB Output is correct
10 Correct 4 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 1 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 3 ms 208 KB Output is correct
5 Correct 3 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 3 ms 208 KB Output is correct
9 Correct 2 ms 208 KB Output is correct
10 Correct 4 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 10 ms 208 KB Output is correct
18 Correct 17 ms 208 KB Output is correct
19 Correct 22 ms 208 KB Output is correct
20 Correct 17 ms 208 KB Output is correct
21 Correct 15 ms 208 KB Output is correct
22 Correct 20 ms 208 KB Output is correct
23 Correct 16 ms 208 KB Output is correct
24 Correct 15 ms 208 KB Output is correct
25 Correct 17 ms 208 KB Output is correct
26 Correct 18 ms 208 KB Output is correct
27 Correct 14 ms 208 KB Output is correct
28 Correct 9 ms 292 KB Output is correct
29 Correct 14 ms 280 KB Output is correct
30 Correct 18 ms 208 KB Output is correct

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 3 ms 208 KB Output is correct
5 Correct 3 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 3 ms 208 KB Output is correct
9 Correct 2 ms 208 KB Output is correct
10 Correct 4 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 10 ms 208 KB Output is correct
18 Correct 17 ms 208 KB Output is correct
19 Correct 22 ms 208 KB Output is correct
20 Correct 17 ms 208 KB Output is correct
21 Correct 15 ms 208 KB Output is correct
22 Correct 20 ms 208 KB Output is correct
23 Correct 16 ms 208 KB Output is correct
24 Correct 15 ms 208 KB Output is correct
25 Correct 17 ms 208 KB Output is correct
26 Correct 18 ms 208 KB Output is correct
27 Correct 14 ms 208 KB Output is correct
28 Correct 9 ms 292 KB Output is correct
29 Correct 14 ms 280 KB Output is correct
30 Correct 18 ms 208 KB Output is correct
31 Correct 16 ms 296 KB Output is correct
32 Correct 71 ms 296 KB Output is correct
33 Correct 71 ms 316 KB Output is correct
34 Correct 71 ms 336 KB Output is correct
35 Correct 109 ms 336 KB Output is correct
36 Correct 81 ms 336 KB Output is correct
37 Correct 81 ms 336 KB Output is correct
38 Correct 87 ms 336 KB Output is correct
39 Correct 94 ms 328 KB Output is correct
40 Correct 91 ms 316 KB Output is correct
41 Correct 94 ms 336 KB Output is correct
42 Correct 65 ms 336 KB Output is correct
43 Correct 93 ms 336 KB Output is correct
44 Correct 90 ms 336 KB Output is correct
45 Correct 105 ms 336 KB Output is correct
46 Correct 77 ms 336 KB Output is correct
47 Correct 84 ms 320 KB Output is correct
48 Correct 89 ms 316 KB Output is correct
49 Correct 83 ms 336 KB Output is correct
50 Correct 89 ms 336 KB Output is correct
51 Correct 36 ms 328 KB Output is correct
52 Correct 86 ms 316 KB Output is correct
53 Correct 93 ms 316 KB Output is correct
54 Correct 64 ms 336 KB Output is correct
55 Correct 76 ms 328 KB Output is correct
56 Correct 77 ms 336 KB Output is correct
57 Correct 96 ms 336 KB Output is correct
58 Correct 86 ms 316 KB Output is correct
59 Correct 80 ms 336 KB Output is correct
60 Correct 92 ms 336 KB Output is correct