oj.uz

Submission #155141

# Submission time Handle Problem Language Result Execution time Memory
155141 2019-09-26T16:24:23 Z karma Xylophone (JOI18_xylophone) C++14
100 / 100
 120 ms 504 KB 
#include "xylophone.h"
#include<bits/stdc++.h>

const int N = 6006;
int a[N], d[2][N], mx, mn, up;

void solve(int n) {
     for(int i = 1; i < n; ++i) {
        d[0][i - 1] = query(i, i + 1);
        if(i > 1) d[1][i - 2] = query(i - 1, i + 1);
     }
     a[0] = mn = mx = 0, a[1] = d[0][0], up = 1;
     if(n > 1) {
        if(a[mx] < a[1]) mx = 1;
        if(a[mn] > a[1]) mn = 1;
     }
     for(int i = 2; i < n; ++i) {
        if(d[0][i - 1] + d[0][i - 2] != d[1][i - 2]) up *= (-1);
        a[i] = a[i - 1] + up * d[0][i - 1];
        if(a[mx] < a[i]) mx = i;
        if(a[mn] > a[i]) mn = i;
     }
     if(mn < mx) {
        mn = a[mn];
        for(int i = 0; i < n; ++i) answer(i + 1, a[i] - mn + 1);
     } else {
        mx = a[mx];
        for(int i = 0; i < n; ++i) answer(i + 1, mx - a[i] + 1);
     }
}

Subtask #1
11.0 / 11.0

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

Subtask #2
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 296 KB Output is correct
2 Correct 2 ms 248 KB Output is correct
3 Correct 3 ms 248 KB Output is correct
4 Correct 4 ms 296 KB Output is correct
5 Correct 4 ms 376 KB Output is correct
6 Correct 4 ms 248 KB Output is correct
7 Correct 4 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 4 ms 376 KB Output is correct
11 Correct 4 ms 376 KB Output is correct
12 Correct 4 ms 376 KB Output is correct
13 Correct 5 ms 380 KB Output is correct
14 Correct 4 ms 376 KB Output is correct
15 Correct 4 ms 248 KB Output is correct
16 Correct 4 ms 320 KB Output is correct
17 Correct 15 ms 328 KB Output is correct
18 Correct 18 ms 376 KB Output is correct
19 Correct 18 ms 248 KB Output is correct
20 Correct 23 ms 376 KB Output is correct
21 Correct 23 ms 400 KB Output is correct
22 Correct 21 ms 248 KB Output is correct
23 Correct 23 ms 320 KB Output is correct
24 Correct 23 ms 332 KB Output is correct
25 Correct 25 ms 380 KB Output is correct
26 Correct 22 ms 376 KB Output is correct
27 Correct 20 ms 324 KB Output is correct
28 Correct 24 ms 400 KB Output is correct
29 Correct 25 ms 376 KB Output is correct
30 Correct 17 ms 404 KB Output is correct

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 296 KB Output is correct
2 Correct 2 ms 248 KB Output is correct
3 Correct 3 ms 248 KB Output is correct
4 Correct 4 ms 296 KB Output is correct
5 Correct 4 ms 376 KB Output is correct
6 Correct 4 ms 248 KB Output is correct
7 Correct 4 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 4 ms 376 KB Output is correct
11 Correct 4 ms 376 KB Output is correct
12 Correct 4 ms 376 KB Output is correct
13 Correct 5 ms 380 KB Output is correct
14 Correct 4 ms 376 KB Output is correct
15 Correct 4 ms 248 KB Output is correct
16 Correct 4 ms 320 KB Output is correct
17 Correct 15 ms 328 KB Output is correct
18 Correct 18 ms 376 KB Output is correct
19 Correct 18 ms 248 KB Output is correct
20 Correct 23 ms 376 KB Output is correct
21 Correct 23 ms 400 KB Output is correct
22 Correct 21 ms 248 KB Output is correct
23 Correct 23 ms 320 KB Output is correct
24 Correct 23 ms 332 KB Output is correct
25 Correct 25 ms 380 KB Output is correct
26 Correct 22 ms 376 KB Output is correct
27 Correct 20 ms 324 KB Output is correct
28 Correct 24 ms 400 KB Output is correct
29 Correct 25 ms 376 KB Output is correct
30 Correct 17 ms 404 KB Output is correct
31 Correct 30 ms 376 KB Output is correct
32 Correct 40 ms 404 KB Output is correct
33 Correct 87 ms 340 KB Output is correct
34 Correct 55 ms 396 KB Output is correct
35 Correct 116 ms 336 KB Output is correct
36 Correct 86 ms 480 KB Output is correct
37 Correct 92 ms 384 KB Output is correct
38 Correct 54 ms 320 KB Output is correct
39 Correct 75 ms 376 KB Output is correct
40 Correct 71 ms 364 KB Output is correct
41 Correct 61 ms 344 KB Output is correct
42 Correct 69 ms 476 KB Output is correct
43 Correct 120 ms 340 KB Output is correct
44 Correct 54 ms 400 KB Output is correct
45 Correct 103 ms 376 KB Output is correct
46 Correct 64 ms 344 KB Output is correct
47 Correct 55 ms 312 KB Output is correct
48 Correct 54 ms 396 KB Output is correct
49 Correct 106 ms 376 KB Output is correct
50 Correct 97 ms 440 KB Output is correct
51 Correct 76 ms 332 KB Output is correct
52 Correct 94 ms 408 KB Output is correct
53 Correct 84 ms 376 KB Output is correct
54 Correct 110 ms 456 KB Output is correct
55 Correct 98 ms 376 KB Output is correct
56 Correct 98 ms 384 KB Output is correct
57 Correct 74 ms 392 KB Output is correct
58 Correct 79 ms 504 KB Output is correct
59 Correct 103 ms 408 KB Output is correct
60 Correct 101 ms 424 KB Output is correct