oj.uz

Submission #702854

# Submission time Handle Problem Language Result Execution time Memory
702854 2023-02-25T09:04:46 Z ecxx Xylophone (JOI18_xylophone) C++17
100 / 100
 114 ms 380 KB 
#include <bits/stdc++.h>
#include "xylophone.h"

using namespace std;

void solve(int N) {
    vector<int> pairwise(N);
    vector<int> triplet(N-1);

    for (int i = 0; i < N-1; i++) pairwise[i]=query(i+1,i+2);
    for (int i = 0; i < N-2; i++) triplet[i]=query(i+1,i+3);

    vector<int> ans(N, 0);

    ans[1] = pairwise[0];

    for (int i = 2; i < N; i++) {
        if (triplet[i-2] == pairwise[i-2] + pairwise[i-1]) {
            if (ans[i-2] < ans[i-1]) {
                ans[i] = ans[i-1] + pairwise[i-1];
            } else {
                ans[i] = ans[i-1] - pairwise[i-1];
            }
        } else {
            if (ans[i-2] < ans[i-1]) {
                ans[i] = ans[i-1] - pairwise[i-1];
            } else {
                ans[i] = ans[i-1] + pairwise[i-1];
            }
        }
    }

    int mn=10000, mx=-10000;
    int mnpos=-1, mxpos=-1;

    for (int i = 0; i < N; i++) {
        if (mn>ans[i]) {mnpos=i; mn = ans[i];}
        if (mx<ans[i]) {mxpos=i; mx = ans[i];}
    }

    for (int i = 0; i < N; i++) ans[i] -= (mn-1);

    if (mnpos > mxpos) {
        for (int i = 0; i < N; i++) {
            ans[i] = N+1 - ans[i];
        }
    }

    for (int i = 0; i < N; i++) answer(i+1, ans[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 1 ms 208 KB Output is correct
5 Correct 2 ms 216 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 1 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 3 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

# 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 1 ms 208 KB Output is correct
5 Correct 2 ms 216 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 1 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 3 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 3 ms 208 KB Output is correct
17 Correct 11 ms 208 KB Output is correct
18 Correct 13 ms 208 KB Output is correct
19 Correct 21 ms 292 KB Output is correct
20 Correct 16 ms 208 KB Output is correct
21 Correct 15 ms 208 KB Output is correct
22 Correct 17 ms 208 KB Output is correct
23 Correct 17 ms 208 KB Output is correct
24 Correct 20 ms 208 KB Output is correct
25 Correct 20 ms 296 KB Output is correct
26 Correct 15 ms 208 KB Output is correct
27 Correct 19 ms 208 KB Output is correct
28 Correct 18 ms 208 KB Output is correct
29 Correct 15 ms 284 KB Output is correct
30 Correct 8 ms 308 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 1 ms 208 KB Output is correct
5 Correct 2 ms 216 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 1 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 3 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 3 ms 208 KB Output is correct
17 Correct 11 ms 208 KB Output is correct
18 Correct 13 ms 208 KB Output is correct
19 Correct 21 ms 292 KB Output is correct
20 Correct 16 ms 208 KB Output is correct
21 Correct 15 ms 208 KB Output is correct
22 Correct 17 ms 208 KB Output is correct
23 Correct 17 ms 208 KB Output is correct
24 Correct 20 ms 208 KB Output is correct
25 Correct 20 ms 296 KB Output is correct
26 Correct 15 ms 208 KB Output is correct
27 Correct 19 ms 208 KB Output is correct
28 Correct 18 ms 208 KB Output is correct
29 Correct 15 ms 284 KB Output is correct
30 Correct 8 ms 308 KB Output is correct
31 Correct 43 ms 296 KB Output is correct
32 Correct 46 ms 300 KB Output is correct
33 Correct 64 ms 328 KB Output is correct
34 Correct 57 ms 336 KB Output is correct
35 Correct 66 ms 380 KB Output is correct
36 Correct 97 ms 336 KB Output is correct
37 Correct 100 ms 336 KB Output is correct
38 Correct 93 ms 336 KB Output is correct
39 Correct 73 ms 336 KB Output is correct
40 Correct 79 ms 336 KB Output is correct
41 Correct 87 ms 336 KB Output is correct
42 Correct 91 ms 336 KB Output is correct
43 Correct 42 ms 336 KB Output is correct
44 Correct 73 ms 328 KB Output is correct
45 Correct 71 ms 316 KB Output is correct
46 Correct 83 ms 336 KB Output is correct
47 Correct 81 ms 316 KB Output is correct
48 Correct 114 ms 336 KB Output is correct
49 Correct 84 ms 336 KB Output is correct
50 Correct 95 ms 336 KB Output is correct
51 Correct 95 ms 336 KB Output is correct
52 Correct 90 ms 336 KB Output is correct
53 Correct 99 ms 336 KB Output is correct
54 Correct 68 ms 336 KB Output is correct
55 Correct 99 ms 336 KB Output is correct
56 Correct 94 ms 336 KB Output is correct
57 Correct 70 ms 336 KB Output is correct
58 Correct 88 ms 336 KB Output is correct
59 Correct 92 ms 336 KB Output is correct
60 Correct 90 ms 328 KB Output is correct