oj.uz

Submission #227441

# Submission time Handle Problem Language Result Execution time Memory
227441 2020-04-27T12:33:19 Z muhammad_hokimiyon Xylophone (JOI18_xylophone) C++14
47 / 100
 125 ms 436 KB 
#include "xylophone.h"
#include <bits/stdc++.h>

const int N = 5e3 + 7;

int b[N];

int get( int x , int y , int x1 , int y1 )
{
    if( x1 > y1 ){
        if( y == x1 - y1 )return x1 - x;
        if( x == y )return x1 - x;
        return x1 + x;
    }else{
        if( y == x + y1 - x1 )return x1 - x;
        if( y == y1 - x1 )return x1 + x;
        return x1 + x;
    }
}

void solve(int N)
{
    int i = 1 , j = N;
    for( ; i + 1 <= j - 1; i++,j-- ){
        if( query( i + 1 , j - 1 ) != N - 1 ){
            while( query( i + 1 , j ) == N - 1 )i += 1;
            while( query( i , j - 1 ) == N - 1 )j -= 1;
            break;
        }
    }
    b[i] = 1;
    b[j] = N;
    if( i != 1 )b[i - 1] = query( i - 1 , i ) + 1;
    if( i + 1 < j )b[i + 1] = query( i , i + 1 ) + 1;
    if( j - 1 > i + 1 )b[j - 1] = N - query( j - 1 , j );
    if( j != N )b[j + 1] = N - query( j , j + 1 );
    for( int h = i - 2; h >= 1; h-- ){
        int x = query( h , h + 1 );
        int y = query( h , h + 2 );
        b[h] = get( x , y , b[h + 1] , b[h + 2] );
    }
    for( int h = i + 2; h <= j - 2; h++ ){
        int x = query( h - 1 , h );
        int y = query( h - 2 , h );
        b[h] = get( x , y , b[h - 1] , b[h - 2] );
    }
    for( int h = j + 2; h <= N; h++ ){
        int x = query( h - 1 , h );
        int y = query( h - 2 , h );
        b[h] = get( x , y , b[h - 1] , b[h - 2] );
    }
    for( int h = 1; h <= N; h++ ){
        answer( h , b[h] );
    }
}

Subtask #1
11.0 / 11.0

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

Subtask #2
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 6 ms 384 KB Output is correct
4 Correct 9 ms 384 KB Output is correct
5 Correct 8 ms 256 KB Output is correct
6 Correct 8 ms 384 KB Output is correct
7 Correct 8 ms 256 KB Output is correct
8 Correct 8 ms 256 KB Output is correct
9 Correct 7 ms 384 KB Output is correct
10 Correct 8 ms 384 KB Output is correct
11 Correct 8 ms 384 KB Output is correct
12 Correct 8 ms 256 KB Output is correct
13 Correct 7 ms 256 KB Output is correct
14 Correct 7 ms 256 KB Output is correct
15 Correct 9 ms 256 KB Output is correct
16 Correct 9 ms 384 KB Output is correct
17 Correct 21 ms 256 KB Output is correct
18 Correct 29 ms 376 KB Output is correct
19 Correct 33 ms 256 KB Output is correct
20 Correct 27 ms 384 KB Output is correct
21 Correct 29 ms 376 KB Output is correct
22 Correct 26 ms 256 KB Output is correct
23 Correct 33 ms 256 KB Output is correct
24 Correct 30 ms 376 KB Output is correct
25 Correct 43 ms 436 KB Output is correct
26 Correct 35 ms 384 KB Output is correct
27 Correct 38 ms 376 KB Output is correct
28 Correct 39 ms 256 KB Output is correct
29 Correct 33 ms 384 KB Output is correct
30 Correct 22 ms 256 KB Output is correct

Subtask #3
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 6 ms 384 KB Output is correct
4 Correct 9 ms 384 KB Output is correct
5 Correct 8 ms 256 KB Output is correct
6 Correct 8 ms 384 KB Output is correct
7 Correct 8 ms 256 KB Output is correct
8 Correct 8 ms 256 KB Output is correct
9 Correct 7 ms 384 KB Output is correct
10 Correct 8 ms 384 KB Output is correct
11 Correct 8 ms 384 KB Output is correct
12 Correct 8 ms 256 KB Output is correct
13 Correct 7 ms 256 KB Output is correct
14 Correct 7 ms 256 KB Output is correct
15 Correct 9 ms 256 KB Output is correct
16 Correct 9 ms 384 KB Output is correct
17 Correct 21 ms 256 KB Output is correct
18 Correct 29 ms 376 KB Output is correct
19 Correct 33 ms 256 KB Output is correct
20 Correct 27 ms 384 KB Output is correct
21 Correct 29 ms 376 KB Output is correct
22 Correct 26 ms 256 KB Output is correct
23 Correct 33 ms 256 KB Output is correct
24 Correct 30 ms 376 KB Output is correct
25 Correct 43 ms 436 KB Output is correct
26 Correct 35 ms 384 KB Output is correct
27 Correct 38 ms 376 KB Output is correct
28 Correct 39 ms 256 KB Output is correct
29 Correct 33 ms 384 KB Output is correct
30 Correct 22 ms 256 KB Output is correct
31 Correct 69 ms 384 KB Output is correct
32 Correct 99 ms 372 KB Output is correct
33 Incorrect 125 ms 384 KB Wrong Answer [2]
34 Halted 0 ms 0 KB -