oj.uz

Submission #260707

# Submission time Handle Problem Language Result Execution time Memory
260707 2020-08-10T18:49:52 Z arbor Xylophone (JOI18_xylophone) C++14
100 / 100
 140 ms 532 KB 
#include <bits/stdc++.h>
#include "xylophone.h"

#define all(x) x.begin(), x.end()
using namespace std;
using ll = long long;
using pii = pair<int, int>;
const int MN = 1e5 + 5;

void solve(int n) {
    vector<int> d(n + 1), up(n + 1), a(n + 1);
    for (int i = 1; i <= n - 1; i++) {
        d[i] = query(i, i + 1);
    }
    a[1] = 0, a[2] = d[1];
    up[1] = 1;
    for (int i = 1; i <= n - 2; i++) {
        int j = i + 1;
        int q = query(i, i + 2);
        if (d[i] + d[i + 1] == q) up[j] = up[i];
        else up[j] = !up[i];
    }
    for (int i = 2; i <= n - 1; i++) {
        if (up[i]) a[i + 1] = a[i] + d[i];
        else a[i + 1] = a[i] - d[i];
    }
    int mn = min_element(a.begin() + 1, a.end()) - a.begin();
    int mx = max_element(a.begin() + 1, a.end()) - a.begin();
    if (mn > mx) for (int i = 1; i <= n; i++) a[i] = -a[i];
    int m = *min_element(a.begin() + 1, a.end());
    for (int i = 1; i <= n; i++) {
        a[i] = a[i] - m + 1;
        answer(i, a[i]);
    }
}

Subtask #1
11.0 / 11.0

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

Subtask #2
36.0 / 36.0

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

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 4 ms 256 KB Output is correct
6 Correct 3 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 4 ms 256 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 4 ms 256 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 4 ms 256 KB Output is correct
16 Correct 4 ms 256 KB Output is correct
17 Correct 9 ms 256 KB Output is correct
18 Correct 24 ms 384 KB Output is correct
19 Correct 18 ms 384 KB Output is correct
20 Correct 30 ms 384 KB Output is correct
21 Correct 16 ms 376 KB Output is correct
22 Correct 19 ms 376 KB Output is correct
23 Correct 16 ms 376 KB Output is correct
24 Correct 16 ms 376 KB Output is correct
25 Correct 18 ms 384 KB Output is correct
26 Correct 17 ms 384 KB Output is correct
27 Correct 17 ms 376 KB Output is correct
28 Correct 16 ms 384 KB Output is correct
29 Correct 16 ms 384 KB Output is correct
30 Correct 20 ms 384 KB Output is correct
31 Correct 37 ms 384 KB Output is correct
32 Correct 55 ms 532 KB Output is correct
33 Correct 71 ms 384 KB Output is correct
34 Correct 88 ms 384 KB Output is correct
35 Correct 85 ms 504 KB Output is correct
36 Correct 140 ms 428 KB Output is correct
37 Correct 67 ms 432 KB Output is correct
38 Correct 115 ms 432 KB Output is correct
39 Correct 140 ms 428 KB Output is correct
40 Correct 99 ms 384 KB Output is correct
41 Correct 94 ms 384 KB Output is correct
42 Correct 114 ms 384 KB Output is correct
43 Correct 105 ms 504 KB Output is correct
44 Correct 78 ms 424 KB Output is correct
45 Correct 76 ms 504 KB Output is correct
46 Correct 92 ms 508 KB Output is correct
47 Correct 128 ms 384 KB Output is correct
48 Correct 97 ms 384 KB Output is correct
49 Correct 94 ms 384 KB Output is correct
50 Correct 140 ms 384 KB Output is correct
51 Correct 105 ms 504 KB Output is correct
52 Correct 83 ms 384 KB Output is correct
53 Correct 117 ms 384 KB Output is correct
54 Correct 91 ms 504 KB Output is correct
55 Correct 89 ms 384 KB Output is correct
56 Correct 100 ms 504 KB Output is correct
57 Correct 91 ms 384 KB Output is correct
58 Correct 82 ms 384 KB Output is correct
59 Correct 86 ms 504 KB Output is correct
60 Correct 82 ms 504 KB Output is correct