oj.uz

Submission #209542

# Submission time Handle Problem Language Result Execution time Memory
209542 2020-03-14T13:42:25 Z DodgeBallMan Xylophone (JOI18_xylophone) C++14
100 / 100
 101 ms 448 KB 
#include <bits/stdc++.h>
#include "xylophone.h"

using namespace std;

const int N = 5e3 + 10;
int a[N], df[N], st[N], mul = 1, mn, mx, pmn, pmx;

void solve( int n ) {
    for( int i = 1 ; i < n ; i++ ) df[i+1] = query( i, i + 1 );
    for( int i = 2 ; i < n ; i++ ) {
        int dif = query( i-1, i+1 );
        if( dif == df[i] + df[i+1] ) st[i] = 1;
        else st[i] = -1;
    }
    pmx = 1, pmn = 1;
    for( int i = 2 ; i <= n ; i++ ) {
        a[i] = a[i-1] + ( mul * df[i] );
        mul *= st[i];
        if( a[i] > mx ) mx = a[i], pmx = i;
        if( a[i] < mn ) mn = a[i], pmn = i;
    }
    if( pmn > pmx ) {
        for( int i = 1 ; i <= n ; i++) a[i] *= -1;
        swap( mn, mx );
        mn *= -1, mx *= -1;
    }
    for( int i = 1 ; i <= n ; i++ ) answer( i, a[i] + -1*mn + 1 );
}

Subtask #1
11.0 / 11.0

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

Subtask #2
36.0 / 36.0

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

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 248 KB Output is correct
2 Correct 5 ms 248 KB Output is correct
3 Correct 6 ms 376 KB Output is correct
4 Correct 7 ms 376 KB Output is correct
5 Correct 7 ms 248 KB Output is correct
6 Correct 7 ms 376 KB Output is correct
7 Correct 6 ms 248 KB Output is correct
8 Correct 6 ms 244 KB Output is correct
9 Correct 6 ms 376 KB Output is correct
10 Correct 6 ms 248 KB Output is correct
11 Correct 7 ms 376 KB Output is correct
12 Correct 8 ms 248 KB Output is correct
13 Correct 7 ms 252 KB Output is correct
14 Correct 6 ms 248 KB Output is correct
15 Correct 7 ms 248 KB Output is correct
16 Correct 8 ms 248 KB Output is correct
17 Correct 14 ms 332 KB Output is correct
18 Correct 19 ms 376 KB Output is correct
19 Correct 24 ms 248 KB Output is correct
20 Correct 24 ms 248 KB Output is correct
21 Correct 23 ms 248 KB Output is correct
22 Correct 25 ms 332 KB Output is correct
23 Correct 24 ms 248 KB Output is correct
24 Correct 24 ms 248 KB Output is correct
25 Correct 23 ms 248 KB Output is correct
26 Correct 27 ms 248 KB Output is correct
27 Correct 25 ms 248 KB Output is correct
28 Correct 23 ms 320 KB Output is correct
29 Correct 23 ms 248 KB Output is correct
30 Correct 24 ms 376 KB Output is correct
31 Correct 44 ms 252 KB Output is correct
32 Correct 57 ms 376 KB Output is correct
33 Correct 82 ms 340 KB Output is correct
34 Correct 94 ms 376 KB Output is correct
35 Correct 75 ms 448 KB Output is correct
36 Correct 97 ms 376 KB Output is correct
37 Correct 88 ms 376 KB Output is correct
38 Correct 82 ms 376 KB Output is correct
39 Correct 86 ms 376 KB Output is correct
40 Correct 94 ms 376 KB Output is correct
41 Correct 90 ms 376 KB Output is correct
42 Correct 88 ms 376 KB Output is correct
43 Correct 90 ms 376 KB Output is correct
44 Correct 94 ms 376 KB Output is correct
45 Correct 94 ms 376 KB Output is correct
46 Correct 87 ms 376 KB Output is correct
47 Correct 90 ms 328 KB Output is correct
48 Correct 95 ms 336 KB Output is correct
49 Correct 86 ms 324 KB Output is correct
50 Correct 96 ms 336 KB Output is correct
51 Correct 89 ms 376 KB Output is correct
52 Correct 96 ms 376 KB Output is correct
53 Correct 91 ms 376 KB Output is correct
54 Correct 82 ms 376 KB Output is correct
55 Correct 95 ms 336 KB Output is correct
56 Correct 101 ms 380 KB Output is correct
57 Correct 94 ms 376 KB Output is correct
58 Correct 93 ms 376 KB Output is correct
59 Correct 95 ms 368 KB Output is correct
60 Correct 88 ms 376 KB Output is correct