oj.uz

Submission #805489

# Submission time Handle Problem Language Result Execution time Memory
805489 2023-08-03T17:04:47 Z vjudge1 Xylophone (JOI18_xylophone) C++17
100 / 100
 98 ms 320 KB 
#include "xylophone.h"

#include <bits/stdc++.h>
using namespace std;

static int A[5000];

int ask(int l, int r) { return query(l + 1, r + 1); }

void solve(int N) {
        A[0] = 0;
        A[1] = ask(0, 1);
        int inc = 1;
        int d = A[1];
        for (int i = 2; i < N; i++) {
                int x = ask(i - 2, i);
                int y = ask(i - 1, i);
                if (x == d) {
                        A[i] = A[i - 1] - inc * y;
                        inc = -inc;
                } else if (x == y) {
                        A[i] = A[i - 1] - inc * y;
                        inc = -inc;
                } else if (d + y == x) {
                        A[i] = A[i - 1] + inc * y;
                } else {
                        A[i] = -1;
                }
                d = y;
        }
        int mn = min_element(A, A + N) - A;
        int mx = max_element(A, A + N) - A;
        if (mn > mx) {
                for (int i = 0; i < N; i++) A[i] = -A[i];
        }
        int offset = *min_element(A, A + N) - 1;
        for (int i = 0; i < N; i++) answer(i + 1, A[i] - offset);
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 280 KB Output is correct
2 Correct 1 ms 300 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 1 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 280 KB Output is correct
2 Correct 1 ms 300 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 1 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 6 ms 208 KB Output is correct
17 Correct 9 ms 208 KB Output is correct
18 Correct 6 ms 304 KB Output is correct
19 Correct 21 ms 208 KB Output is correct
20 Correct 24 ms 292 KB Output is correct
21 Correct 21 ms 288 KB Output is correct
22 Correct 9 ms 312 KB Output is correct
23 Correct 15 ms 300 KB Output is correct
24 Correct 16 ms 300 KB Output is correct
25 Correct 7 ms 312 KB Output is correct
26 Correct 16 ms 292 KB Output is correct
27 Correct 11 ms 308 KB Output is correct
28 Correct 18 ms 280 KB Output is correct
29 Correct 18 ms 304 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 280 KB Output is correct
2 Correct 1 ms 300 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 1 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 6 ms 208 KB Output is correct
17 Correct 9 ms 208 KB Output is correct
18 Correct 6 ms 304 KB Output is correct
19 Correct 21 ms 208 KB Output is correct
20 Correct 24 ms 292 KB Output is correct
21 Correct 21 ms 288 KB Output is correct
22 Correct 9 ms 312 KB Output is correct
23 Correct 15 ms 300 KB Output is correct
24 Correct 16 ms 300 KB Output is correct
25 Correct 7 ms 312 KB Output is correct
26 Correct 16 ms 292 KB Output is correct
27 Correct 11 ms 308 KB Output is correct
28 Correct 18 ms 280 KB Output is correct
29 Correct 18 ms 304 KB Output is correct
30 Correct 18 ms 208 KB Output is correct
31 Correct 38 ms 300 KB Output is correct
32 Correct 59 ms 300 KB Output is correct
33 Correct 64 ms 292 KB Output is correct
34 Correct 83 ms 304 KB Output is correct
35 Correct 66 ms 280 KB Output is correct
36 Correct 36 ms 292 KB Output is correct
37 Correct 82 ms 296 KB Output is correct
38 Correct 87 ms 300 KB Output is correct
39 Correct 38 ms 292 KB Output is correct
40 Correct 79 ms 296 KB Output is correct
41 Correct 64 ms 304 KB Output is correct
42 Correct 80 ms 300 KB Output is correct
43 Correct 64 ms 296 KB Output is correct
44 Correct 91 ms 300 KB Output is correct
45 Correct 82 ms 300 KB Output is correct
46 Correct 56 ms 300 KB Output is correct
47 Correct 65 ms 288 KB Output is correct
48 Correct 33 ms 304 KB Output is correct
49 Correct 34 ms 300 KB Output is correct
50 Correct 93 ms 284 KB Output is correct
51 Correct 86 ms 320 KB Output is correct
52 Correct 76 ms 300 KB Output is correct
53 Correct 92 ms 300 KB Output is correct
54 Correct 82 ms 296 KB Output is correct
55 Correct 64 ms 300 KB Output is correct
56 Correct 41 ms 296 KB Output is correct
57 Correct 91 ms 300 KB Output is correct
58 Correct 39 ms 296 KB Output is correct
59 Correct 98 ms 296 KB Output is correct
60 Correct 53 ms 304 KB Output is correct