oj.uz

Submission #704721

# Submission time Handle Problem Language Result Execution time Memory
704721 2023-03-02T18:59:29 Z bebra Xylophone (JOI18_xylophone) C++17
100 / 100
 114 ms 440 KB 
#include "xylophone.h"
#include <bits/stdc++.h>
using namespace std;


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


void solve(int n) {
    vector<int> d1(n - 1);
    for (int i = 0; i < n - 1; ++i) {
        d1[i] = my_query(i, i + 1);
    }
    vector<int> d2(n - 2);
    for (int i = 0; i < n - 2; ++i) {
        d2[i] = my_query(i, i + 2);
    }
    vector<int> a(n);
    // relative[i] == 0:
    //      a[i] < a[i + 1]
    // relative[i] == 1:
    //      a[i] > a[i + 1]
    vector<int> relative(n - 1);
    for (int i = 0; i < n - 2; ++i) {
        if (d1[i] + d1[i + 1] == d2[i]) {
            relative[i + 1] = relative[i];
        } else {
            relative[i + 1] = 1 - relative[i];
        }
    }

    for (int i = 0; i < n - 1; ++i) {
        if (relative[i] == 0) {
            a[i + 1] = a[i] + d1[i];
        } else {
            a[i + 1] = a[i] - d1[i];
        }
    }

    int min_pos = 0;
    int max_pos = 0;
    for (int i = 0; i < n; ++i) {
        if (a[i] < a[min_pos]) {
            min_pos = i;
        }
        if (a[i] > a[max_pos]) {
            max_pos = i;
        }
    }
    if (min_pos > max_pos) {
        for (int i = 0; i < n - 1; ++i) {
            if (relative[i] == 0) {
                a[i + 1] = a[i] - d1[i];
            } else {
                a[i + 1] = a[i] + d1[i];
            }
        }
    }

    int mn = *min_element(a.begin(), a.end());
    if (mn <= 0) {
        for (auto& x : a) {
            x += abs(mn) + 1;
        }
    }

    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 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 4 ms 208 KB Output is correct
9 Correct 2 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 3 ms 208 KB Output is correct
12 Correct 3 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 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 4 ms 208 KB Output is correct
9 Correct 2 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 3 ms 208 KB Output is correct
12 Correct 3 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 3 ms 300 KB Output is correct
17 Correct 8 ms 300 KB Output is correct
18 Correct 14 ms 308 KB Output is correct
19 Correct 17 ms 300 KB Output is correct
20 Correct 14 ms 208 KB Output is correct
21 Correct 26 ms 304 KB Output is correct
22 Correct 17 ms 296 KB Output is correct
23 Correct 16 ms 208 KB Output is correct
24 Correct 18 ms 304 KB Output is correct
25 Correct 16 ms 300 KB Output is correct
26 Correct 15 ms 208 KB Output is correct
27 Correct 18 ms 288 KB Output is correct
28 Correct 15 ms 208 KB Output is correct
29 Correct 12 ms 300 KB Output is correct
30 Correct 12 ms 304 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 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 4 ms 208 KB Output is correct
9 Correct 2 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 3 ms 208 KB Output is correct
12 Correct 3 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 3 ms 300 KB Output is correct
17 Correct 8 ms 300 KB Output is correct
18 Correct 14 ms 308 KB Output is correct
19 Correct 17 ms 300 KB Output is correct
20 Correct 14 ms 208 KB Output is correct
21 Correct 26 ms 304 KB Output is correct
22 Correct 17 ms 296 KB Output is correct
23 Correct 16 ms 208 KB Output is correct
24 Correct 18 ms 304 KB Output is correct
25 Correct 16 ms 300 KB Output is correct
26 Correct 15 ms 208 KB Output is correct
27 Correct 18 ms 288 KB Output is correct
28 Correct 15 ms 208 KB Output is correct
29 Correct 12 ms 300 KB Output is correct
30 Correct 12 ms 304 KB Output is correct
31 Correct 38 ms 300 KB Output is correct
32 Correct 40 ms 300 KB Output is correct
33 Correct 83 ms 300 KB Output is correct
34 Correct 60 ms 440 KB Output is correct
35 Correct 114 ms 304 KB Output is correct
36 Correct 39 ms 384 KB Output is correct
37 Correct 78 ms 320 KB Output is correct
38 Correct 102 ms 300 KB Output is correct
39 Correct 47 ms 296 KB Output is correct
40 Correct 73 ms 316 KB Output is correct
41 Correct 83 ms 320 KB Output is correct
42 Correct 82 ms 320 KB Output is correct
43 Correct 99 ms 316 KB Output is correct
44 Correct 90 ms 320 KB Output is correct
45 Correct 77 ms 296 KB Output is correct
46 Correct 61 ms 296 KB Output is correct
47 Correct 41 ms 328 KB Output is correct
48 Correct 88 ms 324 KB Output is correct
49 Correct 78 ms 316 KB Output is correct
50 Correct 86 ms 440 KB Output is correct
51 Correct 94 ms 296 KB Output is correct
52 Correct 71 ms 320 KB Output is correct
53 Correct 87 ms 320 KB Output is correct
54 Correct 70 ms 328 KB Output is correct
55 Correct 70 ms 320 KB Output is correct
56 Correct 74 ms 296 KB Output is correct
57 Correct 103 ms 296 KB Output is correct
58 Correct 87 ms 328 KB Output is correct
59 Correct 80 ms 324 KB Output is correct
60 Correct 61 ms 332 KB Output is correct