oj.uz

Submission #209541

# Submission time Handle Problem Language Result Execution time Memory
209541 2020-03-14T13:41:15 Z DodgeBallMan Xylophone (JOI18_xylophone) C++14
100 / 100
 99 ms 380 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 answer( int pos, int va ) { printf("pos : %d va : %d\n",pos,va); }

/*int query( int i, int j ) {
    int c;
    printf("%d %d\n",i,j);
    scanf("%d",&c);
    return c;
}*/

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;
    }
    /*for( int i = 2 ; i <= n ; i++ ) printf("%d ",df[i]);
    printf("\n");
    for( int i = 2 ; i < n ; i++ ) printf("%d ",st[i]);
    printf("\n");
    printf("%d %d pos : %d %d\n",mn,mx,pmn,pmx);*/
    if( pmn > pmx ) {
        for( int i = 1 ; i <= n ; i++) a[i] *= -1;
        swap( mn, mx );
        mn *= -1, mx *= -1;
    }
    //printf("%d %d pos : %d %d\n",mn,mx,pmn,pmx);
    for( int i = 1 ; i <= n ; i++ ) answer( i, a[i] + -1*mn + 1 );
}

/*int main() {
    int n;
    scanf("%d",&n);
    solve( n );
}*/

Subtask #1
11.0 / 11.0

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

Subtask #2
36.0 / 36.0

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

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 320 KB Output is correct
3 Correct 6 ms 248 KB Output is correct
4 Correct 6 ms 248 KB Output is correct
5 Correct 6 ms 248 KB Output is correct
6 Correct 7 ms 376 KB Output is correct
7 Correct 5 ms 248 KB Output is correct
8 Correct 6 ms 248 KB Output is correct
9 Correct 6 ms 252 KB Output is correct
10 Correct 6 ms 248 KB Output is correct
11 Correct 6 ms 248 KB Output is correct
12 Correct 7 ms 296 KB Output is correct
13 Correct 7 ms 376 KB Output is correct
14 Correct 6 ms 248 KB Output is correct
15 Correct 6 ms 376 KB Output is correct
16 Correct 9 ms 376 KB Output is correct
17 Correct 14 ms 248 KB Output is correct
18 Correct 23 ms 332 KB Output is correct
19 Correct 26 ms 328 KB Output is correct
20 Correct 24 ms 332 KB Output is correct
21 Correct 25 ms 376 KB Output is correct
22 Correct 23 ms 248 KB Output is correct
23 Correct 23 ms 248 KB Output is correct
24 Correct 24 ms 376 KB Output is correct
25 Correct 21 ms 248 KB Output is correct
26 Correct 24 ms 248 KB Output is correct
27 Correct 23 ms 248 KB Output is correct
28 Correct 24 ms 376 KB Output is correct
29 Correct 19 ms 248 KB Output is correct
30 Correct 24 ms 380 KB Output is correct
31 Correct 35 ms 248 KB Output is correct
32 Correct 59 ms 376 KB Output is correct
33 Correct 83 ms 332 KB Output is correct
34 Correct 95 ms 376 KB Output is correct
35 Correct 83 ms 376 KB Output is correct
36 Correct 92 ms 376 KB Output is correct
37 Correct 84 ms 376 KB Output is correct
38 Correct 94 ms 376 KB Output is correct
39 Correct 78 ms 376 KB Output is correct
40 Correct 86 ms 376 KB Output is correct
41 Correct 70 ms 320 KB Output is correct
42 Correct 99 ms 332 KB Output is correct
43 Correct 88 ms 376 KB Output is correct
44 Correct 87 ms 376 KB Output is correct
45 Correct 88 ms 376 KB Output is correct
46 Correct 92 ms 376 KB Output is correct
47 Correct 90 ms 376 KB Output is correct
48 Correct 90 ms 376 KB Output is correct
49 Correct 81 ms 376 KB Output is correct
50 Correct 79 ms 376 KB Output is correct
51 Correct 84 ms 376 KB Output is correct
52 Correct 99 ms 376 KB Output is correct
53 Correct 92 ms 376 KB Output is correct
54 Correct 80 ms 376 KB Output is correct
55 Correct 80 ms 376 KB Output is correct
56 Correct 62 ms 324 KB Output is correct
57 Correct 92 ms 376 KB Output is correct
58 Correct 82 ms 376 KB Output is correct
59 Correct 94 ms 376 KB Output is correct
60 Correct 83 ms 376 KB Output is correct