제출 #213503

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
213503		vincent97198	건물 4 (JOI20_building4)	C++14	100 / 100	318 ms	26092 KiB

building4

#include <bits/stdc++.h>
#define ll long long
#define N 500005

using namespace std;

struct item{
  int MIN=1e9,MAX=-1e9;
};

int n,A[N*2],B[N*2];
item dp[2*N][2];

void update(item &now,item &pre,int val)
{
    now.MIN=min(now.MIN,pre.MIN+val);
    now.MAX=max(now.MAX,pre.MAX+val);
}

bool check(item now,int val)
{
    return now.MAX>=val && now.MIN<=val;
}

void init()
{
    cin >> n;
    for(int i=0;i<2*n;++i)
        cin >> A[i];
    for(int i=0;i<2*n;++i)
        cin >> B[i];
}

void solve()
{
    dp[0][0]=item{1,1},dp[0][1]=item{0,0};
    for ( int i = 0; i < 2 * n - 1; ++i ) {
        for ( int j = 0; j < 2; ++j ) {
            if ( j == 0 && A[i + 1] >= A[i] )
                update( dp[i + 1][0], dp[i][j], 1 );
            if ( j == 1 && A[i + 1] >= B[i] )
                update( dp[i + 1][0], dp[i][j], 1 );
            if ( j == 0 && B[i + 1] >= A[i] )
                update( dp[i + 1][1], dp[i][j], 0 );
            if ( j == 1 && B[i + 1] >= B[i] )
                update( dp[i + 1][1], dp[i][j], 0 );
        }
    }

    if ( !check( dp[2 * n - 1][0], n ) && !check( dp[2 * n - 1][1], n ) ) {
        cout << -1 << endl;
        return ;
    }

    string s;
    bool pre;
    int num = n;
    A[2 * n] = B[2 * n] = 1e9;
    for ( int i = 2 * n - 1; i >= 0; --i ) {
        if ( check( dp[i][0], num ) && A[i] <= (pre ? B[i + 1] : A[i + 1]) ) {
            s += "A";
            --num;
            pre = false;
        }
        else {
            s += "B";
            pre = true;
        }
    }

    reverse( s.begin(), s.end() );

    cout << s << endl;
}

int main()
{
    ios_base::sync_with_stdio( false );
    cin.tie( nullptr );
    cout.tie( nullptr );

    init();
    solve();

    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

building4.cpp: In function 'void solve()':
building4.cpp:60:53: warning: 'pre' may be used uninitialized in this function [-Wmaybe-uninitialized]
         if ( check( dp[i][0], num ) && A[i] <= (pre ? B[i + 1] : A[i + 1]) ) {
                                                ~~~~~^~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 11 / 11
• Subtask 2: 89 / 89