oj.uz

Submission #711620

# Submission time Handle Problem Language Result Execution time Memory
711620 2023-03-17T10:00:18 Z Cyanmond Xylophone (JOI18_xylophone) C++17
100 / 100
 111 ms 408 KB 
#include "xylophone.h"
#include <bits/stdc++.h>

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

void solve(int N) {
	std::vector<int> ans(N);
    ans[0] = 0;
    ans[1] = ask(0, 1);
    for (int i = 2; i < N; ++i) {
        int v1 = ask(i - 2, i), v2 = ask(i - 1, i);
        if (ans[i - 2] < ans[i - 1]) {
            if (v1 == ans[i - 1] - ans[i - 2]) {
                ans[i] = ans[i - 1] - v2;
            } else if (v1 == v2) {
                ans[i] = ans[i - 1] - v2;
            } else {
                ans[i] = ans[i - 1] + v2;
            }
        } else {
            if (v1 == ans[i - 2] - ans[i - 1]) {
                ans[i] = ans[i - 1] + v2;
            } else if (v1 == v2) {
                ans[i] = ans[i - 1] + v2;
            } else {
                ans[i] = ans[i - 1] - v2;
            }
        }
    }
    int minId = (int)(std::min_element(ans.begin(), ans.end()) - ans.begin());
    int maxId = (int)(std::max_element(ans.begin(), ans.end()) - ans.begin());
    if (minId > maxId) {
        for (auto &e : ans) e = -e;
        std::swap(minId, maxId);
    }
    const int v = ans[minId];
    for (auto &e : ans) e -= v;
    for (int i = 0; i < N; ++i) {
        answer(i + 1, ans[i] + 1);
    }
}

Subtask #1
11.0 / 11.0

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

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 292 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 2 ms 208 KB Output is correct
4 Correct 3 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 3 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 2 ms 208 KB Output is correct
13 Correct 3 ms 208 KB Output is correct
14 Correct 3 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 7 ms 208 KB Output is correct
18 Correct 18 ms 208 KB Output is correct
19 Correct 13 ms 284 KB Output is correct
20 Correct 28 ms 208 KB Output is correct
21 Correct 17 ms 284 KB Output is correct
22 Correct 18 ms 296 KB Output is correct
23 Correct 17 ms 208 KB Output is correct
24 Correct 15 ms 208 KB Output is correct
25 Correct 29 ms 208 KB Output is correct
26 Correct 18 ms 280 KB Output is correct
27 Correct 20 ms 208 KB Output is correct
28 Correct 19 ms 208 KB Output is correct
29 Correct 16 ms 208 KB Output is correct
30 Correct 16 ms 284 KB Output is correct
31 Correct 45 ms 284 KB Output is correct
32 Correct 66 ms 288 KB Output is correct
33 Correct 65 ms 208 KB Output is correct
34 Correct 91 ms 328 KB Output is correct
35 Correct 85 ms 408 KB Output is correct
36 Correct 57 ms 304 KB Output is correct
37 Correct 88 ms 300 KB Output is correct
38 Correct 40 ms 308 KB Output is correct
39 Correct 99 ms 304 KB Output is correct
40 Correct 44 ms 300 KB Output is correct
41 Correct 92 ms 312 KB Output is correct
42 Correct 84 ms 308 KB Output is correct
43 Correct 103 ms 300 KB Output is correct
44 Correct 86 ms 312 KB Output is correct
45 Correct 79 ms 312 KB Output is correct
46 Correct 68 ms 312 KB Output is correct
47 Correct 107 ms 300 KB Output is correct
48 Correct 73 ms 308 KB Output is correct
49 Correct 94 ms 304 KB Output is correct
50 Correct 88 ms 312 KB Output is correct
51 Correct 111 ms 296 KB Output is correct
52 Correct 80 ms 296 KB Output is correct
53 Correct 88 ms 300 KB Output is correct
54 Correct 91 ms 300 KB Output is correct
55 Correct 96 ms 300 KB Output is correct
56 Correct 92 ms 300 KB Output is correct
57 Correct 79 ms 304 KB Output is correct
58 Correct 73 ms 300 KB Output is correct
59 Correct 74 ms 300 KB Output is correct
60 Correct 104 ms 296 KB Output is correct