oj.uz

Submission #505148

# Submission time Handle Problem Language Result Execution time Memory
505148 2022-01-10T18:03:37 Z tengiz05 Xylophone (JOI18_xylophone) C++17
100 / 100
 122 ms 540 KB 
#include "xylophone.h"
#include <bits/stdc++.h>

static int a[5005];

void solve(int n) {
    a[2] = query(1, 2);
    for (int i = 3; i <= n; i++) {
        int x = query(i - 1, i);
        int y = query(i - 2, i);
        
        if (x + abs(a[i - 2] - a[i - 1]) == y) {
            if (a[i - 2] > a[i - 1]) {
                a[i] = a[i - 1] - x;
            } else {
                a[i] = a[i - 1] + x;
            }
        } else {
            if (a[i - 2] > a[i - 1]) {
                a[i] = a[i - 1] + x;
            } else {
                a[i] = a[i - 1] - x;
            }
        }
    }
    
    if (std::min_element(a + 1, a + n + 1) > std::max_element(a + 1, a + n + 1)) {
        for (int i = 1; i <= n; i++) {
            a[i] = -a[i];
        }
    }
    
    int x = *std::min_element(a + 1, a + n + 1);
    for (int i = 1; i <= n; i++) {
        answer(i, a[i] - x + 1);
    }
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 2 ms 200 KB Output is correct
5 Correct 2 ms 200 KB Output is correct
6 Correct 2 ms 200 KB Output is correct
7 Correct 2 ms 200 KB Output is correct
8 Correct 2 ms 200 KB Output is correct
9 Correct 2 ms 200 KB Output is correct
10 Correct 2 ms 200 KB Output is correct
11 Correct 2 ms 200 KB Output is correct
12 Correct 3 ms 200 KB Output is correct
13 Correct 2 ms 200 KB Output is correct
14 Correct 3 ms 200 KB Output is correct
15 Correct 2 ms 200 KB Output is correct

Subtask #2
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 2 ms 200 KB Output is correct
5 Correct 2 ms 200 KB Output is correct
6 Correct 2 ms 200 KB Output is correct
7 Correct 2 ms 200 KB Output is correct
8 Correct 2 ms 200 KB Output is correct
9 Correct 2 ms 200 KB Output is correct
10 Correct 2 ms 200 KB Output is correct
11 Correct 2 ms 200 KB Output is correct
12 Correct 3 ms 200 KB Output is correct
13 Correct 2 ms 200 KB Output is correct
14 Correct 3 ms 200 KB Output is correct
15 Correct 2 ms 200 KB Output is correct
16 Correct 5 ms 200 KB Output is correct
17 Correct 8 ms 200 KB Output is correct
18 Correct 11 ms 200 KB Output is correct
19 Correct 18 ms 200 KB Output is correct
20 Correct 8 ms 296 KB Output is correct
21 Correct 14 ms 288 KB Output is correct
22 Correct 20 ms 352 KB Output is correct
23 Correct 16 ms 280 KB Output is correct
24 Correct 12 ms 200 KB Output is correct
25 Correct 22 ms 288 KB Output is correct
26 Correct 20 ms 280 KB Output is correct
27 Correct 13 ms 200 KB Output is correct
28 Correct 20 ms 280 KB Output is correct
29 Correct 20 ms 200 KB Output is correct
30 Correct 20 ms 276 KB Output is correct

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 2 ms 200 KB Output is correct
5 Correct 2 ms 200 KB Output is correct
6 Correct 2 ms 200 KB Output is correct
7 Correct 2 ms 200 KB Output is correct
8 Correct 2 ms 200 KB Output is correct
9 Correct 2 ms 200 KB Output is correct
10 Correct 2 ms 200 KB Output is correct
11 Correct 2 ms 200 KB Output is correct
12 Correct 3 ms 200 KB Output is correct
13 Correct 2 ms 200 KB Output is correct
14 Correct 3 ms 200 KB Output is correct
15 Correct 2 ms 200 KB Output is correct
16 Correct 5 ms 200 KB Output is correct
17 Correct 8 ms 200 KB Output is correct
18 Correct 11 ms 200 KB Output is correct
19 Correct 18 ms 200 KB Output is correct
20 Correct 8 ms 296 KB Output is correct
21 Correct 14 ms 288 KB Output is correct
22 Correct 20 ms 352 KB Output is correct
23 Correct 16 ms 280 KB Output is correct
24 Correct 12 ms 200 KB Output is correct
25 Correct 22 ms 288 KB Output is correct
26 Correct 20 ms 280 KB Output is correct
27 Correct 13 ms 200 KB Output is correct
28 Correct 20 ms 280 KB Output is correct
29 Correct 20 ms 200 KB Output is correct
30 Correct 20 ms 276 KB Output is correct
31 Correct 42 ms 280 KB Output is correct
32 Correct 63 ms 288 KB Output is correct
33 Correct 92 ms 280 KB Output is correct
34 Correct 99 ms 292 KB Output is correct
35 Correct 103 ms 284 KB Output is correct
36 Correct 99 ms 288 KB Output is correct
37 Correct 72 ms 408 KB Output is correct
38 Correct 98 ms 280 KB Output is correct
39 Correct 81 ms 420 KB Output is correct
40 Correct 96 ms 420 KB Output is correct
41 Correct 107 ms 288 KB Output is correct
42 Correct 96 ms 288 KB Output is correct
43 Correct 87 ms 540 KB Output is correct
44 Correct 87 ms 296 KB Output is correct
45 Correct 72 ms 292 KB Output is correct
46 Correct 86 ms 304 KB Output is correct
47 Correct 99 ms 320 KB Output is correct
48 Correct 98 ms 280 KB Output is correct
49 Correct 122 ms 276 KB Output is correct
50 Correct 92 ms 284 KB Output is correct
51 Correct 74 ms 296 KB Output is correct
52 Correct 81 ms 284 KB Output is correct
53 Correct 94 ms 408 KB Output is correct
54 Correct 90 ms 284 KB Output is correct
55 Correct 77 ms 288 KB Output is correct
56 Correct 81 ms 288 KB Output is correct
57 Correct 102 ms 276 KB Output is correct
58 Correct 59 ms 284 KB Output is correct
59 Correct 54 ms 300 KB Output is correct
60 Correct 70 ms 408 KB Output is correct