oj.uz

Submission #763053

# Submission time Handle Problem Language Result Execution time Memory
763053 2023-06-22T02:50:25 Z adaawf Xylophone (JOI18_xylophone) C++14
100 / 100
 87 ms 532 KB 
#include "xylophone.h"
#include <iostream>
#include <vector>
using namespace std;
int a[5005], b[5005], c[5005], dd[5005];
void solve(int n) {
    if (n == 2) {
        answer(1, 1);
        answer(2, 2);
        return;
    }
    for (int i = 1; i <= n - 1; i++) {
        b[i] = query(i, i + 1);
    }
    for (int i = 1; i <= n - 2; i++) {
        c[i] = query(i, i + 2);
        if (c[i] == b[i] + b[i + 1]) dd[i] = 0;
        else dd[i] = 1;
    }
    int d = 0, mi = 0, ma = 0, g = 0, h = 0, flag = 0, f = 0;
    for (int i = 1; i < n; i++) {
        if (flag == 1) d += b[i];
        else d -= b[i];
        if (ma < d) {
            ma = d;
            g = i;
        }
        if (mi > d) {
            mi = d;
            h = i;
        }
        if (flag != dd[i]) flag = 1;
        else flag = 0;
    }
    if (g <= h) f = 1;
    mi = d = 0;
    for (int i = 1; i < n; i++) {
        if (f == 1) d += b[i];
        else d -= b[i];
        mi = min(mi, d);
        if (f != dd[i]) f = 1;
        else f = 0;
        a[i + 1] = d;
    }
    for (int i = 1; i <= n; i++) {
        a[i] += 1 - mi;
    }
    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 2 ms 304 KB Output is correct
5 Correct 2 ms 208 KB Output is correct
6 Correct 2 ms 308 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 2 ms 208 KB Output is correct
9 Correct 2 ms 208 KB Output is correct
10 Correct 2 ms 308 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 2 ms 308 KB Output is correct
13 Correct 2 ms 208 KB Output is correct
14 Correct 2 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 304 KB Output is correct
5 Correct 2 ms 208 KB Output is correct
6 Correct 2 ms 308 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 2 ms 208 KB Output is correct
9 Correct 2 ms 208 KB Output is correct
10 Correct 2 ms 308 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 2 ms 308 KB Output is correct
13 Correct 2 ms 208 KB Output is correct
14 Correct 2 ms 208 KB Output is correct
15 Correct 3 ms 208 KB Output is correct
16 Correct 4 ms 316 KB Output is correct
17 Correct 9 ms 308 KB Output is correct
18 Correct 9 ms 208 KB Output is correct
19 Correct 7 ms 332 KB Output is correct
20 Correct 19 ms 300 KB Output is correct
21 Correct 15 ms 304 KB Output is correct
22 Correct 12 ms 208 KB Output is correct
23 Correct 15 ms 304 KB Output is correct
24 Correct 13 ms 316 KB Output is correct
25 Correct 17 ms 208 KB Output is correct
26 Correct 17 ms 312 KB Output is correct
27 Correct 17 ms 312 KB Output is correct
28 Correct 9 ms 312 KB Output is correct
29 Correct 18 ms 316 KB Output is correct
30 Correct 18 ms 308 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 304 KB Output is correct
5 Correct 2 ms 208 KB Output is correct
6 Correct 2 ms 308 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 2 ms 208 KB Output is correct
9 Correct 2 ms 208 KB Output is correct
10 Correct 2 ms 308 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 2 ms 308 KB Output is correct
13 Correct 2 ms 208 KB Output is correct
14 Correct 2 ms 208 KB Output is correct
15 Correct 3 ms 208 KB Output is correct
16 Correct 4 ms 316 KB Output is correct
17 Correct 9 ms 308 KB Output is correct
18 Correct 9 ms 208 KB Output is correct
19 Correct 7 ms 332 KB Output is correct
20 Correct 19 ms 300 KB Output is correct
21 Correct 15 ms 304 KB Output is correct
22 Correct 12 ms 208 KB Output is correct
23 Correct 15 ms 304 KB Output is correct
24 Correct 13 ms 316 KB Output is correct
25 Correct 17 ms 208 KB Output is correct
26 Correct 17 ms 312 KB Output is correct
27 Correct 17 ms 312 KB Output is correct
28 Correct 9 ms 312 KB Output is correct
29 Correct 18 ms 316 KB Output is correct
30 Correct 18 ms 308 KB Output is correct
31 Correct 36 ms 312 KB Output is correct
32 Correct 28 ms 316 KB Output is correct
33 Correct 57 ms 328 KB Output is correct
34 Correct 81 ms 344 KB Output is correct
35 Correct 83 ms 296 KB Output is correct
36 Correct 68 ms 344 KB Output is correct
37 Correct 39 ms 312 KB Output is correct
38 Correct 84 ms 308 KB Output is correct
39 Correct 81 ms 316 KB Output is correct
40 Correct 79 ms 316 KB Output is correct
41 Correct 87 ms 300 KB Output is correct
42 Correct 75 ms 456 KB Output is correct
43 Correct 80 ms 348 KB Output is correct
44 Correct 60 ms 312 KB Output is correct
45 Correct 70 ms 336 KB Output is correct
46 Correct 85 ms 356 KB Output is correct
47 Correct 78 ms 352 KB Output is correct
48 Correct 76 ms 316 KB Output is correct
49 Correct 81 ms 312 KB Output is correct
50 Correct 83 ms 328 KB Output is correct
51 Correct 74 ms 324 KB Output is correct
52 Correct 61 ms 328 KB Output is correct
53 Correct 82 ms 348 KB Output is correct
54 Correct 53 ms 312 KB Output is correct
55 Correct 68 ms 328 KB Output is correct
56 Correct 87 ms 312 KB Output is correct
57 Correct 73 ms 304 KB Output is correct
58 Correct 84 ms 296 KB Output is correct
59 Correct 79 ms 296 KB Output is correct
60 Correct 58 ms 532 KB Output is correct