oj.uz

Submission #730002

# Submission time Handle Problem Language Result Execution time Memory
730002 2023-04-25T04:19:52 Z nguyentunglam Xylophone (JOI18_xylophone) C++17
100 / 100
 113 ms 572 KB 
#include<bits/stdc++.h>
using namespace std;
#include "xylophone.h"
static int A[5000];
const int N = 1e5 + 10;
int a[N], b[N], c[N], d[N], cnt[N];
int n;

void Find(int e[]) {
    for(int i = 3; i <= n; i++) {
        e[i] = e[i - 1] + a[i];
        if (max({e[i - 2], e[i - 1], e[i]}) - min({e[i - 2], e[i - 1], e[i]}) != b[i])
            e[i] = e[i - 1] - a[i];
    }
    int p = 0;
    for(int i = 1; i <= n; i++) p = max(p, 1 - e[i]);
    for(int i = 1; i <= n; i++) e[i] += p;
}

void solve(int _n) {
    n = _n;
    for(int i = 2; i <= n; i++) a[i] = query(i - 1, i);

    for(int i = 3; i <= n; i++) b[i] = query(i - 2, i);

    c[2] = a[2];
    d[2] = -a[2];
    Find(c); Find(d);
    int mx = 0, mn = 0;
    bool ok = 1;
    for(int i = 1; i <= n; i++) {
        if (c[i] == 1) mn = i;
        if (c[i] == n) mx = i;
        if (1 <= c[i] && c[i] <= n) cnt[c[i]]++;
        else ok = 0;
        if (cnt[c[i]] > 1) ok = 0;
    }

    if (ok && mn < mx && query(mn, mx) == n - 1) for(int i = 1; i <= n; i++) answer(i, c[i]);
    else for(int i = 1; i <= n; i++) answer(i, d[i]);
}

Compilation message

xylophone.cpp:4:12: warning: 'A' defined but not used [-Wunused-variable]
    4 | static int A[5000];
      |            ^

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 1 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 3 ms 208 KB Output is correct
10 Correct 2 ms 312 KB Output is correct
11 Correct 2 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 3 ms 208 KB Output is correct
15 Correct 3 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 1 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 3 ms 208 KB Output is correct
10 Correct 2 ms 312 KB Output is correct
11 Correct 2 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 3 ms 208 KB Output is correct
15 Correct 3 ms 208 KB Output is correct
16 Correct 4 ms 320 KB Output is correct
17 Correct 9 ms 320 KB Output is correct
18 Correct 7 ms 308 KB Output is correct
19 Correct 21 ms 296 KB Output is correct
20 Correct 15 ms 304 KB Output is correct
21 Correct 19 ms 208 KB Output is correct
22 Correct 19 ms 308 KB Output is correct
23 Correct 17 ms 320 KB Output is correct
24 Correct 15 ms 324 KB Output is correct
25 Correct 17 ms 304 KB Output is correct
26 Correct 20 ms 304 KB Output is correct
27 Correct 18 ms 308 KB Output is correct
28 Correct 19 ms 316 KB Output is correct
29 Correct 16 ms 208 KB Output is correct
30 Correct 13 ms 316 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 1 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 3 ms 208 KB Output is correct
10 Correct 2 ms 312 KB Output is correct
11 Correct 2 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 3 ms 208 KB Output is correct
15 Correct 3 ms 208 KB Output is correct
16 Correct 4 ms 320 KB Output is correct
17 Correct 9 ms 320 KB Output is correct
18 Correct 7 ms 308 KB Output is correct
19 Correct 21 ms 296 KB Output is correct
20 Correct 15 ms 304 KB Output is correct
21 Correct 19 ms 208 KB Output is correct
22 Correct 19 ms 308 KB Output is correct
23 Correct 17 ms 320 KB Output is correct
24 Correct 15 ms 324 KB Output is correct
25 Correct 17 ms 304 KB Output is correct
26 Correct 20 ms 304 KB Output is correct
27 Correct 18 ms 308 KB Output is correct
28 Correct 19 ms 316 KB Output is correct
29 Correct 16 ms 208 KB Output is correct
30 Correct 13 ms 316 KB Output is correct
31 Correct 20 ms 312 KB Output is correct
32 Correct 53 ms 436 KB Output is correct
33 Correct 71 ms 428 KB Output is correct
34 Correct 75 ms 320 KB Output is correct
35 Correct 93 ms 328 KB Output is correct
36 Correct 75 ms 320 KB Output is correct
37 Correct 85 ms 312 KB Output is correct
38 Correct 66 ms 344 KB Output is correct
39 Correct 71 ms 332 KB Output is correct
40 Correct 94 ms 444 KB Output is correct
41 Correct 100 ms 436 KB Output is correct
42 Correct 85 ms 304 KB Output is correct
43 Correct 74 ms 428 KB Output is correct
44 Correct 85 ms 328 KB Output is correct
45 Correct 97 ms 320 KB Output is correct
46 Correct 94 ms 328 KB Output is correct
47 Correct 69 ms 432 KB Output is correct
48 Correct 113 ms 344 KB Output is correct
49 Correct 80 ms 336 KB Output is correct
50 Correct 80 ms 312 KB Output is correct
51 Correct 67 ms 436 KB Output is correct
52 Correct 93 ms 572 KB Output is correct
53 Correct 69 ms 448 KB Output is correct
54 Correct 83 ms 320 KB Output is correct
55 Correct 82 ms 440 KB Output is correct
56 Correct 70 ms 332 KB Output is correct
57 Correct 54 ms 436 KB Output is correct
58 Correct 79 ms 464 KB Output is correct
59 Correct 84 ms 432 KB Output is correct
60 Correct 67 ms 312 KB Output is correct