oj.uz

Submission #211618

# Submission time Handle Problem Language Result Execution time Memory
211618 2020-03-20T20:30:53 Z diegogrc Building 4 (JOI20_building4) C++17
100 / 100
 816 ms 95688 KB 
//  Copyright © 2020 Diego Garcia Rodriguez del Campo. All rights reserved.
#include<bits/stdc++.h>
#define INF 1e9
#define MAX 1000005
#define optimiza_io cin.tie(0); ios_base::sync_with_stdio(0);
using namespace std;
typedef long long i64;

int N;
int a[MAX][2];
int dpmn[MAX][2];
int dpmx[MAX][2];

struct node {
    int vl, i, j;
    bool operator < ( const node & a ) const {
        if( vl == a.vl )
            return i > a.i;
        return vl > a.vl;
    }
};

vector < node > q;

void solve( int i , int j , int r ) {
    cout << ( j ? 'B' : 'A' );
    if( i == N )
        return;
    // Ir a la A
    if( a[i][j] <= a[i + 1][0] && 
        dpmn[i + 1][0] <= r &&
        dpmx[i + 1][0] >= r )
        solve( i + 1 , 0 , r - 1 );
    else
        solve( i + 1 , 1 , r );
    
}

int main()
{
    optimiza_io
    cin >> N;
    N *= 2;
    for( int j = 0; j < 2; j ++ )
        for( int i = 1; i <= N; i ++ ) { 
            cin >> a[i][j];
            dpmx[i][j] = -INF;
            dpmn[i][j] = INF;
            q.push_back( { a[i][j] , i , j } );
        }
    
    sort( q.begin() , q.end() );
    for( auto x : q ) {
        if( x.i == N ) {
            dpmn[x.i][x.j] = dpmx[x.i][x.j] = ! x.j;
            continue;
        }
        
        dpmn[x.i][x.j] = min( dpmn[x.i + 1][0] , dpmn[x.i + 1][1] ) + ( ! x.j );
        dpmx[x.i][x.j] = max( dpmx[x.i + 1][0] , dpmx[x.i + 1][1] ) + ( ! x.j );
    }
    
    /* for( int j = 0; j < 2; j ++ )
        for( int i = 1; i <= N; i ++ )
            cout << dpmn[i][j] << " \n"[i == N];
    
    cout << "\n\n";
            
    for( int j = 0; j < 2; j ++ )
        for( int i = 1; i <= N; i ++ )
            cout << dpmx[i][j] << " \n"[i == N];
    */
            

    
    if( dpmn[1][0] <= N/2 && dpmx[1][0] >= N/2 )
        solve( 1 , 0 , N/2 - 1 );
    else if( dpmn[1][1] <= N/2 && dpmx[1][1] >= N/2 )
        solve( 1 , 1 , N/2 );
    else 
        cout << "-1\n";
    return 0;
}

// CHECAR LIMITES

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 6 ms 640 KB Output is correct
6 Correct 6 ms 768 KB Output is correct
7 Correct 6 ms 768 KB Output is correct
8 Correct 6 ms 768 KB Output is correct
9 Correct 6 ms 768 KB Output is correct
10 Correct 7 ms 768 KB Output is correct
11 Correct 7 ms 768 KB Output is correct
12 Correct 7 ms 768 KB Output is correct
13 Correct 7 ms 896 KB Output is correct
14 Correct 7 ms 768 KB Output is correct
15 Correct 6 ms 768 KB Output is correct
16 Correct 7 ms 640 KB Output is correct
17 Correct 7 ms 768 KB Output is correct
18 Correct 7 ms 896 KB Output is correct
19 Correct 7 ms 768 KB Output is correct
20 Correct 8 ms 768 KB Output is correct
21 Correct 6 ms 768 KB Output is correct
22 Correct 6 ms 768 KB Output is correct
23 Correct 6 ms 768 KB Output is correct
24 Correct 7 ms 768 KB Output is correct
25 Correct 6 ms 768 KB Output is correct
26 Correct 6 ms 768 KB Output is correct
27 Correct 6 ms 768 KB Output is correct
28 Correct 6 ms 768 KB Output is correct
29 Correct 6 ms 768 KB Output is correct
30 Correct 6 ms 768 KB Output is correct
31 Correct 6 ms 768 KB Output is correct
32 Correct 6 ms 768 KB Output is correct
33 Correct 6 ms 768 KB Output is correct

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 6 ms 640 KB Output is correct
6 Correct 6 ms 768 KB Output is correct
7 Correct 6 ms 768 KB Output is correct
8 Correct 6 ms 768 KB Output is correct
9 Correct 6 ms 768 KB Output is correct
10 Correct 7 ms 768 KB Output is correct
11 Correct 7 ms 768 KB Output is correct
12 Correct 7 ms 768 KB Output is correct
13 Correct 7 ms 896 KB Output is correct
14 Correct 7 ms 768 KB Output is correct
15 Correct 6 ms 768 KB Output is correct
16 Correct 7 ms 640 KB Output is correct
17 Correct 7 ms 768 KB Output is correct
18 Correct 7 ms 896 KB Output is correct
19 Correct 7 ms 768 KB Output is correct
20 Correct 8 ms 768 KB Output is correct
21 Correct 6 ms 768 KB Output is correct
22 Correct 6 ms 768 KB Output is correct
23 Correct 6 ms 768 KB Output is correct
24 Correct 7 ms 768 KB Output is correct
25 Correct 6 ms 768 KB Output is correct
26 Correct 6 ms 768 KB Output is correct
27 Correct 6 ms 768 KB Output is correct
28 Correct 6 ms 768 KB Output is correct
29 Correct 6 ms 768 KB Output is correct
30 Correct 6 ms 768 KB Output is correct
31 Correct 6 ms 768 KB Output is correct
32 Correct 6 ms 768 KB Output is correct
33 Correct 6 ms 768 KB Output is correct
34 Correct 591 ms 48264 KB Output is correct
35 Correct 612 ms 88636 KB Output is correct
36 Correct 596 ms 87084 KB Output is correct
37 Correct 612 ms 89020 KB Output is correct
38 Correct 645 ms 88876 KB Output is correct
39 Correct 641 ms 89260 KB Output is correct
40 Correct 542 ms 94892 KB Output is correct
41 Correct 744 ms 90796 KB Output is correct
42 Correct 508 ms 92712 KB Output is correct
43 Correct 658 ms 95548 KB Output is correct
44 Correct 659 ms 95404 KB Output is correct
45 Correct 660 ms 95404 KB Output is correct
46 Correct 725 ms 95624 KB Output is correct
47 Correct 531 ms 95404 KB Output is correct
48 Correct 682 ms 95408 KB Output is correct
49 Correct 546 ms 95404 KB Output is correct
50 Correct 636 ms 95528 KB Output is correct
51 Correct 626 ms 95552 KB Output is correct
52 Correct 555 ms 95364 KB Output is correct
53 Correct 540 ms 95404 KB Output is correct
54 Correct 679 ms 95404 KB Output is correct
55 Correct 455 ms 95404 KB Output is correct
56 Correct 816 ms 95688 KB Output is correct
57 Correct 501 ms 94896 KB Output is correct
58 Correct 486 ms 95468 KB Output is correct
59 Correct 404 ms 95408 KB Output is correct
60 Correct 476 ms 89644 KB Output is correct
61 Correct 526 ms 95404 KB Output is correct
62 Correct 538 ms 93996 KB Output is correct
63 Correct 514 ms 95408 KB Output is correct
64 Correct 506 ms 92204 KB Output is correct
65 Correct 545 ms 95532 KB Output is correct