# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
31986 | 2017-09-20T20:57:51 Z | chonka | 중앙값 배열 (balkan11_medians) | C++ | 29 ms | 4552 KB |
#include<iostream> #include<stdio.h> using namespace std ; #define MAXN 200007 int n ; int a[ MAXN ] ; int ans[ MAXN ] ; int type[ MAXN ] ; bool used[ MAXN ] ; void input ( ) { scanf ( "%d" , &n ) ; int i ; for ( i = 1 ; i <= n ; i ++ ) { scanf ( "%d" , &a[ i ] ) ; } } void solve ( ) { int i ; for ( i = 1 ; i <= n ; i ++ ) { if ( used[ a[ i ] ] == false ) { ans[ 2 * i - 1 ] = a[ i ] ; } used[ a[ i ] ] = true ; if ( i != 1 ) { if ( a[ i ] > a[ i - 1 ] ) { type[ 2 * i - 1 ] = 1 ; type[ 2 * i - 2 ] = 1 ; } else { type[ 2 * i - 1 ] = -1 ; type[ 2 * i - 2 ] = -1 ; } } } int l , r; l = 1 ; r = 2 * n - 1 ; for ( i = 1 ; i <= 2 * n - 1 ; i ++ ) { if ( ans[ i ] != 0 ) { printf ( "%d" , ans[ i ] ) ; } else { if ( type[ i ] == -1 ) { while ( used[ l ] == true ) { l ++ ; } used[ l ] = true ; printf ( "%d" , l ) ; } else { while ( used[ r ] == true ) { r -- ; } used[ r ] = true ; printf ( "%d" , r ) ; } } if ( i == 2 * n - 1 ) { printf ( "\n" ) ; } else { printf ( " " ) ; } } } int main ( ) { input ( ) ; solve ( ) ; return 0 ; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 4552 KB | Output isn't correct |
2 | Incorrect | 0 ms | 4552 KB | Output isn't correct |
3 | Correct | 0 ms | 4552 KB | Output is correct |
4 | Incorrect | 0 ms | 4552 KB | Output isn't correct |
5 | Incorrect | 0 ms | 4552 KB | Output isn't correct |
6 | Correct | 0 ms | 4552 KB | Output is correct |
7 | Incorrect | 0 ms | 4552 KB | Output isn't correct |
8 | Incorrect | 0 ms | 4552 KB | Output isn't correct |
9 | Incorrect | 0 ms | 4552 KB | Output isn't correct |
10 | Incorrect | 0 ms | 4552 KB | Output isn't correct |
11 | Incorrect | 0 ms | 4552 KB | Output isn't correct |
12 | Incorrect | 0 ms | 4552 KB | Output isn't correct |
13 | Incorrect | 0 ms | 4552 KB | Output isn't correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 4552 KB | Output isn't correct |
2 | Incorrect | 0 ms | 4552 KB | Output isn't correct |
3 | Incorrect | 3 ms | 4552 KB | Output isn't correct |
4 | Incorrect | 6 ms | 4552 KB | Output isn't correct |
5 | Incorrect | 9 ms | 4552 KB | Output isn't correct |
6 | Incorrect | 29 ms | 4552 KB | Output isn't correct |
7 | Incorrect | 29 ms | 4552 KB | Output isn't correct |