oj.uz

Submission #633814

# Submission time Handle Problem Language Result Execution time Memory
633814 2022-08-23T09:25:56 Z Saeed_247 Xylophone (JOI18_xylophone) C++14
100 / 100
 89 ms 436 KB 
#include "xylophone.h"
#include <bits/stdc++.h>
using namespace std;

static int A[5010];
int pos[5050];

void solve(int n) {
    int lo = 1, hi = n;
    while (hi - lo > 1) {
        int mid = (lo + hi) / 2;
        if (query(mid, n) == n - 1) {
            lo = mid;
        }
        else {
            hi = mid;
        }
    }
    A[lo] = 1;
    pos[1] = lo;
    if (lo > 1) {
        A[lo - 1] = query(lo - 1, lo) + 1;
        pos[A[lo - 1]] = lo - 1;
    }
    A[lo + 1] = query(lo, lo + 1) + 1;
    pos[A[lo + 1]] = lo + 1;
    for (int i = lo - 2; i >= 1; i--) {
        int diff = query(i, i + 1);
        bool a = (pos[min(A[i + 1] + diff, n + 1)] == 0), b = (pos[max(A[i + 1] - diff, 0)] == 0);
        if (a && b) {
            int x = query(i, i + 2);
            if (max({A[i + 1] + diff, A[i + 1], A[i + 2]}) - min({A[i + 1] + diff, A[i + 1], A[i + 2]}) == x) {
                A[i] = A[i + 1] + diff;
            }
            else {
                A[i] = A[i + 1] - diff;
            }
        }
        else if (a) A[i] = A[i + 1] + diff;
        else A[i] = A[i + 1] - diff;
        pos[A[i]] = i;
    }
    for (int i = lo + 2; i <= n; i++) {
        int diff = query(i - 1, i);
        bool a = (pos[min(A[i - 1] + diff, n + 1)] == 0), b = (pos[max(A[i - 1] - diff, 0)] == 0);
        if (a && b) {
            int x = query(i - 2, i);
            if (max({A[i - 1] + diff, A[i - 1], A[i - 2]}) - min({A[i - 1] + diff, A[i - 1], A[i - 2]}) == x) {
                A[i] = A[i - 1] + diff;
            }
            else {
                A[i] = A[i - 1] - diff;
            }
        }
        else if (a) A[i] = A[i - 1] + diff;
        else A[i] = A[i - 1] - diff;
        pos[A[i]] = i;
    }
    for (int i = 1; i <= n; i++) {
        answer(i, 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 1 ms 304 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 1 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 2 ms 304 KB Output is correct
12 Correct 2 ms 208 KB Output is correct
13 Correct 2 ms 208 KB Output is correct
14 Correct 1 ms 300 KB Output is correct
15 Correct 1 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 1 ms 304 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 1 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 2 ms 304 KB Output is correct
12 Correct 2 ms 208 KB Output is correct
13 Correct 2 ms 208 KB Output is correct
14 Correct 1 ms 300 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 4 ms 300 KB Output is correct
17 Correct 7 ms 208 KB Output is correct
18 Correct 13 ms 292 KB Output is correct
19 Correct 7 ms 308 KB Output is correct
20 Correct 16 ms 208 KB Output is correct
21 Correct 15 ms 208 KB Output is correct
22 Correct 17 ms 208 KB Output is correct
23 Correct 8 ms 316 KB Output is correct
24 Correct 16 ms 208 KB Output is correct
25 Correct 11 ms 208 KB Output is correct
26 Correct 11 ms 208 KB Output is correct
27 Correct 10 ms 208 KB Output is correct
28 Correct 17 ms 304 KB Output is correct
29 Correct 14 ms 300 KB Output is correct
30 Correct 16 ms 208 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 1 ms 304 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 1 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 2 ms 304 KB Output is correct
12 Correct 2 ms 208 KB Output is correct
13 Correct 2 ms 208 KB Output is correct
14 Correct 1 ms 300 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 4 ms 300 KB Output is correct
17 Correct 7 ms 208 KB Output is correct
18 Correct 13 ms 292 KB Output is correct
19 Correct 7 ms 308 KB Output is correct
20 Correct 16 ms 208 KB Output is correct
21 Correct 15 ms 208 KB Output is correct
22 Correct 17 ms 208 KB Output is correct
23 Correct 8 ms 316 KB Output is correct
24 Correct 16 ms 208 KB Output is correct
25 Correct 11 ms 208 KB Output is correct
26 Correct 11 ms 208 KB Output is correct
27 Correct 10 ms 208 KB Output is correct
28 Correct 17 ms 304 KB Output is correct
29 Correct 14 ms 300 KB Output is correct
30 Correct 16 ms 208 KB Output is correct
31 Correct 37 ms 296 KB Output is correct
32 Correct 26 ms 320 KB Output is correct
33 Correct 57 ms 320 KB Output is correct
34 Correct 88 ms 308 KB Output is correct
35 Correct 65 ms 320 KB Output is correct
36 Correct 26 ms 436 KB Output is correct
37 Correct 64 ms 328 KB Output is correct
38 Correct 80 ms 300 KB Output is correct
39 Correct 71 ms 328 KB Output is correct
40 Correct 89 ms 336 KB Output is correct
41 Correct 88 ms 320 KB Output is correct
42 Correct 40 ms 328 KB Output is correct
43 Correct 68 ms 316 KB Output is correct
44 Correct 49 ms 420 KB Output is correct
45 Correct 59 ms 304 KB Output is correct
46 Correct 66 ms 436 KB Output is correct
47 Correct 66 ms 320 KB Output is correct
48 Correct 46 ms 364 KB Output is correct
49 Correct 74 ms 332 KB Output is correct
50 Correct 54 ms 316 KB Output is correct
51 Correct 86 ms 308 KB Output is correct
52 Correct 76 ms 316 KB Output is correct
53 Correct 37 ms 324 KB Output is correct
54 Correct 51 ms 316 KB Output is correct
55 Correct 66 ms 328 KB Output is correct
56 Correct 67 ms 332 KB Output is correct
57 Correct 43 ms 308 KB Output is correct
58 Correct 76 ms 324 KB Output is correct
59 Correct 46 ms 336 KB Output is correct
60 Correct 49 ms 308 KB Output is correct