oj.uz

Submission #903806

# Submission time Handle Problem Language Result Execution time Memory
903806 2024-01-11T11:29:15 Z vjudge1 Xylophone (JOI18_xylophone) C++17
100 / 100
 54 ms 1636 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 0 ms 344 KB Output is correct
2 Correct 0 ms 440 KB Output is correct
3 Correct 1 ms 444 KB Output is correct
4 Correct 1 ms 704 KB Output is correct
5 Correct 1 ms 448 KB Output is correct
6 Correct 2 ms 964 KB Output is correct
7 Correct 1 ms 716 KB Output is correct
8 Correct 1 ms 696 KB Output is correct
9 Correct 1 ms 696 KB Output is correct
10 Correct 1 ms 696 KB Output is correct
11 Correct 1 ms 444 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 1 ms 696 KB Output is correct
15 Correct 1 ms 696 KB Output is correct

Subtask #2
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 440 KB Output is correct
3 Correct 1 ms 444 KB Output is correct
4 Correct 1 ms 704 KB Output is correct
5 Correct 1 ms 448 KB Output is correct
6 Correct 2 ms 964 KB Output is correct
7 Correct 1 ms 716 KB Output is correct
8 Correct 1 ms 696 KB Output is correct
9 Correct 1 ms 696 KB Output is correct
10 Correct 1 ms 696 KB Output is correct
11 Correct 1 ms 444 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 1 ms 696 KB Output is correct
15 Correct 1 ms 696 KB Output is correct
16 Correct 2 ms 696 KB Output is correct
17 Correct 5 ms 704 KB Output is correct
18 Correct 8 ms 960 KB Output is correct
19 Correct 9 ms 708 KB Output is correct
20 Correct 11 ms 712 KB Output is correct
21 Correct 11 ms 720 KB Output is correct
22 Correct 9 ms 716 KB Output is correct
23 Correct 8 ms 1224 KB Output is correct
24 Correct 9 ms 720 KB Output is correct
25 Correct 10 ms 720 KB Output is correct
26 Correct 11 ms 716 KB Output is correct
27 Correct 9 ms 976 KB Output is correct
28 Correct 11 ms 708 KB Output is correct
29 Correct 11 ms 712 KB Output is correct
30 Correct 9 ms 972 KB Output is correct

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 440 KB Output is correct
3 Correct 1 ms 444 KB Output is correct
4 Correct 1 ms 704 KB Output is correct
5 Correct 1 ms 448 KB Output is correct
6 Correct 2 ms 964 KB Output is correct
7 Correct 1 ms 716 KB Output is correct
8 Correct 1 ms 696 KB Output is correct
9 Correct 1 ms 696 KB Output is correct
10 Correct 1 ms 696 KB Output is correct
11 Correct 1 ms 444 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 1 ms 696 KB Output is correct
15 Correct 1 ms 696 KB Output is correct
16 Correct 2 ms 696 KB Output is correct
17 Correct 5 ms 704 KB Output is correct
18 Correct 8 ms 960 KB Output is correct
19 Correct 9 ms 708 KB Output is correct
20 Correct 11 ms 712 KB Output is correct
21 Correct 11 ms 720 KB Output is correct
22 Correct 9 ms 716 KB Output is correct
23 Correct 8 ms 1224 KB Output is correct
24 Correct 9 ms 720 KB Output is correct
25 Correct 10 ms 720 KB Output is correct
26 Correct 11 ms 716 KB Output is correct
27 Correct 9 ms 976 KB Output is correct
28 Correct 11 ms 708 KB Output is correct
29 Correct 11 ms 712 KB Output is correct
30 Correct 9 ms 972 KB Output is correct
31 Correct 18 ms 1228 KB Output is correct
32 Correct 29 ms 720 KB Output is correct
33 Correct 50 ms 708 KB Output is correct
34 Correct 45 ms 716 KB Output is correct
35 Correct 43 ms 992 KB Output is correct
36 Correct 49 ms 992 KB Output is correct
37 Correct 44 ms 1232 KB Output is correct
38 Correct 43 ms 1636 KB Output is correct
39 Correct 46 ms 952 KB Output is correct
40 Correct 42 ms 964 KB Output is correct
41 Correct 44 ms 960 KB Output is correct
42 Correct 51 ms 724 KB Output is correct
43 Correct 44 ms 480 KB Output is correct
44 Correct 45 ms 1228 KB Output is correct
45 Correct 43 ms 956 KB Output is correct
46 Correct 42 ms 1464 KB Output is correct
47 Correct 47 ms 936 KB Output is correct
48 Correct 48 ms 968 KB Output is correct
49 Correct 54 ms 1224 KB Output is correct
50 Correct 50 ms 712 KB Output is correct
51 Correct 47 ms 956 KB Output is correct
52 Correct 45 ms 1208 KB Output is correct
53 Correct 47 ms 1196 KB Output is correct
54 Correct 50 ms 1212 KB Output is correct
55 Correct 45 ms 744 KB Output is correct
56 Correct 47 ms 964 KB Output is correct
57 Correct 47 ms 704 KB Output is correct
58 Correct 43 ms 964 KB Output is correct
59 Correct 44 ms 956 KB Output is correct
60 Correct 52 ms 696 KB Output is correct