oj.uz

답안 #227445

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
227445 2020-04-27T12:58:35 Z muhammad_hokimiyon Xylophone (JOI18_xylophone) C++14
47 / 100
 103 ms 512 KB 
#include "xylophone.h"
#include <bits/stdc++.h>

const int NN = 5e3 + 7;

int b[NN];

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;
    int l = i , r = n;
    while( l < r ){
        int m = (l + r) / 2;
        if( query( m + 1 , n ) != n - 1 )r = m;
        else l = m + 1;
    }
    i = l;
    b[i] = 1;
    if( i != 1 )b[i - 1] = query( i - 1 , i ) + 1;
    b[i + 1] = query( i , i + 1 ) + 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 <= 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] );
    }
}

Compilation message

xylophone.cpp: In function 'void solve(int)':
xylophone.cpp:23:17: warning: unused variable 'j' [-Wunused-variable]
     int i = 1 , j = n;
                 ^

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 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 7 ms 384 KB Output is correct
5 Correct 7 ms 256 KB Output is correct
6 Correct 8 ms 384 KB Output is correct
7 Correct 8 ms 384 KB Output is correct
8 Correct 7 ms 256 KB Output is correct
9 Correct 7 ms 256 KB Output is correct
10 Correct 7 ms 384 KB Output is correct
11 Correct 7 ms 384 KB Output is correct
12 Correct 6 ms 256 KB Output is correct
13 Correct 7 ms 384 KB Output is correct
14 Correct 6 ms 384 KB Output is correct
15 Correct 7 ms 384 KB Output is correct

Subtask #2
36.0 / 36.0

# 결과 실행 시간 메모리 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 7 ms 384 KB Output is correct
5 Correct 7 ms 256 KB Output is correct
6 Correct 8 ms 384 KB Output is correct
7 Correct 8 ms 384 KB Output is correct
8 Correct 7 ms 256 KB Output is correct
9 Correct 7 ms 256 KB Output is correct
10 Correct 7 ms 384 KB Output is correct
11 Correct 7 ms 384 KB Output is correct
12 Correct 6 ms 256 KB Output is correct
13 Correct 7 ms 384 KB Output is correct
14 Correct 6 ms 384 KB Output is correct
15 Correct 7 ms 384 KB Output is correct
16 Correct 9 ms 384 KB Output is correct
17 Correct 16 ms 512 KB Output is correct
18 Correct 26 ms 384 KB Output is correct
19 Correct 20 ms 380 KB Output is correct
20 Correct 25 ms 256 KB Output is correct
21 Correct 20 ms 384 KB Output is correct
22 Correct 26 ms 256 KB Output is correct
23 Correct 25 ms 384 KB Output is correct
24 Correct 27 ms 384 KB Output is correct
25 Correct 22 ms 256 KB Output is correct
26 Correct 27 ms 384 KB Output is correct
27 Correct 22 ms 384 KB Output is correct
28 Correct 18 ms 372 KB Output is correct
29 Correct 27 ms 256 KB Output is correct
30 Correct 23 ms 256 KB Output is correct

Subtask #3
0 / 53.0

# 결과 실행 시간 메모리 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 7 ms 384 KB Output is correct
5 Correct 7 ms 256 KB Output is correct
6 Correct 8 ms 384 KB Output is correct
7 Correct 8 ms 384 KB Output is correct
8 Correct 7 ms 256 KB Output is correct
9 Correct 7 ms 256 KB Output is correct
10 Correct 7 ms 384 KB Output is correct
11 Correct 7 ms 384 KB Output is correct
12 Correct 6 ms 256 KB Output is correct
13 Correct 7 ms 384 KB Output is correct
14 Correct 6 ms 384 KB Output is correct
15 Correct 7 ms 384 KB Output is correct
16 Correct 9 ms 384 KB Output is correct
17 Correct 16 ms 512 KB Output is correct
18 Correct 26 ms 384 KB Output is correct
19 Correct 20 ms 380 KB Output is correct
20 Correct 25 ms 256 KB Output is correct
21 Correct 20 ms 384 KB Output is correct
22 Correct 26 ms 256 KB Output is correct
23 Correct 25 ms 384 KB Output is correct
24 Correct 27 ms 384 KB Output is correct
25 Correct 22 ms 256 KB Output is correct
26 Correct 27 ms 384 KB Output is correct
27 Correct 22 ms 384 KB Output is correct
28 Correct 18 ms 372 KB Output is correct
29 Correct 27 ms 256 KB Output is correct
30 Correct 23 ms 256 KB Output is correct
31 Correct 45 ms 384 KB Output is correct
32 Correct 55 ms 384 KB Output is correct
33 Correct 73 ms 380 KB Output is correct
34 Incorrect 103 ms 384 KB Wrong Answer [2]
35 Halted 0 ms 0 KB -