oj.uz

답안 #227439

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

using namespace std;

const int NN = 5e3 + 7;

int b[NN];

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 );
        int x1 = b[h + 1];
        int y1 = b[h + 2];
        if( x1 > y1 ){
        if( y == x1 - y1 )b[h] = x1 - x;
        else if( x == y )b[h] = x1 - x;
        else b[h] = x1 + x;
            }else{
                if( y == x + y1 - x1 )b[h] = x1 - x;
                else if( y == y1 - x1 )b[h] = x1 + x;
                else b[h] = x1 + x;
        }
    }
    for( int h = i + 2; h <= j - 2; h++ ){
        int x = query( h - 1 , h );
        int y = query( h - 2 , h );
        int x1 = b[h - 1];
        int y1 = b[h - 2];
        if( x1 > y1 ){
        if( y == x1 - y1 )b[h] = x1 - x;
        else if( x == y )b[h] = x1 - x;
        else b[h] = x1 + x;
            }else{
                if( y == x + y1 - x1 )b[h] = x1 - x;
                else if( y == y1 - x1 )b[h] = x1 + x;
                else b[h] = x1 + x;
        }
    }
    for( int h = j + 2; h <= n; h++ ){
        int x = query( h - 1 , h );
        int y = query( h - 2 , h );
        int x1 = b[h - 1];
        int y1 = b[h - 2];
        if( x1 > y1 ){
        if( y == x1 - y1 )b[h] = x1 - x;
        else if( x == y )b[h] = x1 - x;
        else b[h] = x1 + x;
            }else{
                if( y == x + y1 - x1 )b[h] = x1 - x;
                else if( y == y1 - x1 )b[h] = x1 + x;
                else b[h] = x1 + x;
        }
    }
    for( int h = 1; h <= n; h++ ){
        answer( h , b[h] );
    }
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 384 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 7 ms 256 KB Output is correct
5 Correct 7 ms 384 KB Output is correct
6 Correct 6 ms 256 KB Output is correct
7 Correct 8 ms 256 KB Output is correct
8 Correct 7 ms 256 KB Output is correct
9 Correct 6 ms 256 KB Output is correct
10 Correct 9 ms 384 KB Output is correct
11 Correct 7 ms 256 KB Output is correct
12 Correct 6 ms 256 KB Output is correct
13 Correct 5 ms 256 KB Output is correct
14 Correct 8 ms 384 KB Output is correct
15 Correct 7 ms 256 KB Output is correct

Subtask #2
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 384 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 7 ms 256 KB Output is correct
5 Correct 7 ms 384 KB Output is correct
6 Correct 6 ms 256 KB Output is correct
7 Correct 8 ms 256 KB Output is correct
8 Correct 7 ms 256 KB Output is correct
9 Correct 6 ms 256 KB Output is correct
10 Correct 9 ms 384 KB Output is correct
11 Correct 7 ms 256 KB Output is correct
12 Correct 6 ms 256 KB Output is correct
13 Correct 5 ms 256 KB Output is correct
14 Correct 8 ms 384 KB Output is correct
15 Correct 7 ms 256 KB Output is correct
16 Correct 11 ms 384 KB Output is correct
17 Correct 19 ms 384 KB Output is correct
18 Correct 21 ms 256 KB Output is correct
19 Correct 15 ms 376 KB Output is correct
20 Correct 33 ms 256 KB Output is correct
21 Correct 29 ms 504 KB Output is correct
22 Correct 25 ms 256 KB Output is correct
23 Correct 30 ms 384 KB Output is correct
24 Correct 41 ms 256 KB Output is correct
25 Correct 46 ms 256 KB Output is correct
26 Correct 26 ms 376 KB Output is correct
27 Correct 39 ms 384 KB Output is correct
28 Correct 28 ms 380 KB Output is correct
29 Correct 32 ms 376 KB Output is correct
30 Correct 32 ms 256 KB Output is correct

Subtask #3
0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 384 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 7 ms 256 KB Output is correct
5 Correct 7 ms 384 KB Output is correct
6 Correct 6 ms 256 KB Output is correct
7 Correct 8 ms 256 KB Output is correct
8 Correct 7 ms 256 KB Output is correct
9 Correct 6 ms 256 KB Output is correct
10 Correct 9 ms 384 KB Output is correct
11 Correct 7 ms 256 KB Output is correct
12 Correct 6 ms 256 KB Output is correct
13 Correct 5 ms 256 KB Output is correct
14 Correct 8 ms 384 KB Output is correct
15 Correct 7 ms 256 KB Output is correct
16 Correct 11 ms 384 KB Output is correct
17 Correct 19 ms 384 KB Output is correct
18 Correct 21 ms 256 KB Output is correct
19 Correct 15 ms 376 KB Output is correct
20 Correct 33 ms 256 KB Output is correct
21 Correct 29 ms 504 KB Output is correct
22 Correct 25 ms 256 KB Output is correct
23 Correct 30 ms 384 KB Output is correct
24 Correct 41 ms 256 KB Output is correct
25 Correct 46 ms 256 KB Output is correct
26 Correct 26 ms 376 KB Output is correct
27 Correct 39 ms 384 KB Output is correct
28 Correct 28 ms 380 KB Output is correct
29 Correct 32 ms 376 KB Output is correct
30 Correct 32 ms 256 KB Output is correct
31 Correct 65 ms 384 KB Output is correct
32 Correct 67 ms 376 KB Output is correct
33 Incorrect 85 ms 376 KB Wrong Answer [2]
34 Halted 0 ms 0 KB -