답안 #703087

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
703087 2023-02-26T02:39:05 Z Darren0724 건물 4 (JOI20_building4) C++17
100 / 100
268 ms 34132 KB
#include<bits/stdc++.h>
using namespace std;
#define all(x) x.begin(),x.end()
const int INF=1e9;
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n;cin>>n;
    int m=n*2;
    vector<int> a(m+1),b(m+1);
    for(int i=1;i<=m;i++){
        cin>>a[i];
    }
    for(int i=1;i<=m;i++){
        cin>>b[i];
    }
    vector<vector<int>> dp(4,vector<int>(m+1));
    for(int i=1;i<=m;i++){
        dp[0][i]=dp[2][i]=INF;
        dp[1][i]=dp[3][i]=-INF;
    }
    for(int i=1;i<=m;i++){
        if(a[i]>=a[i-1]){
            dp[0][i]=min(dp[0][i],dp[0][i-1]+1);
            dp[1][i]=max(dp[1][i],dp[1][i-1]+1);
        }
        if(a[i]>=b[i-1]){
            dp[0][i]=min(dp[0][i],dp[2][i-1]+1);
            dp[1][i]=max(dp[1][i],dp[3][i-1]+1);
        }
        if(b[i]>=a[i-1]){
            dp[2][i]=min(dp[2][i],dp[0][i-1]);
            dp[3][i]=max(dp[3][i],dp[1][i-1]);
        }
        if(b[i]>=b[i-1]){
            dp[2][i]=min(dp[2][i],dp[2][i-1]);
            dp[3][i]=max(dp[3][i],dp[3][i-1]);
        }
    }
    int idx=-1;
    if(n>=dp[0][m]&&n<=dp[1][m]){
        idx=0;
    }
    if(n>=dp[2][m]&&n<=dp[3][m]){
        idx=1;
    }
    if(idx==-1){
        cout<<-1<<endl;
        return 0;
    }
    vector<char> ans(m+1);
    int need=n;
    for(int i=m;i>0;i--){
        if(idx==0){
            need--;
            ans[i]='A';
            if(a[i]>=a[i-1]&&dp[0][i-1]<=need&&dp[1][i-1]>=need){
                idx=0;
            }
            else{
                idx=1;
            }
        }
        else{
            ans[i]='B';
            if(b[i]>=a[i-1]&&dp[0][i-1]<=need&&dp[1][i-1]>=need){
                idx=0;
            }
            else{
                idx=1;
            }
        }
    }
    for(int i=1;i<=m;i++){
        cout<<ans[i];
    }


    return 0;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 320 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 456 KB Output is correct
9 Correct 2 ms 404 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 2 ms 456 KB Output is correct
13 Correct 2 ms 468 KB Output is correct
14 Correct 2 ms 508 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 2 ms 456 KB Output is correct
20 Correct 2 ms 468 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 2 ms 432 KB Output is correct
25 Correct 2 ms 456 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 2 ms 340 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 2 ms 460 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 320 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 456 KB Output is correct
9 Correct 2 ms 404 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 2 ms 456 KB Output is correct
13 Correct 2 ms 468 KB Output is correct
14 Correct 2 ms 508 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 2 ms 456 KB Output is correct
20 Correct 2 ms 468 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 2 ms 432 KB Output is correct
25 Correct 2 ms 456 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 2 ms 340 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 2 ms 460 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 226 ms 30044 KB Output is correct
35 Correct 234 ms 31204 KB Output is correct
36 Correct 223 ms 30740 KB Output is correct
37 Correct 224 ms 31272 KB Output is correct
38 Correct 221 ms 31284 KB Output is correct
39 Correct 218 ms 32044 KB Output is correct
40 Correct 248 ms 31156 KB Output is correct
41 Correct 227 ms 31788 KB Output is correct
42 Correct 239 ms 32384 KB Output is correct
43 Correct 244 ms 30400 KB Output is correct
44 Correct 242 ms 30468 KB Output is correct
45 Correct 239 ms 30500 KB Output is correct
46 Correct 268 ms 30360 KB Output is correct
47 Correct 261 ms 33132 KB Output is correct
48 Correct 239 ms 33240 KB Output is correct
49 Correct 251 ms 30344 KB Output is correct
50 Correct 253 ms 33160 KB Output is correct
51 Correct 238 ms 33336 KB Output is correct
52 Correct 179 ms 34132 KB Output is correct
53 Correct 162 ms 33996 KB Output is correct
54 Correct 173 ms 34036 KB Output is correct
55 Correct 164 ms 33992 KB Output is correct
56 Correct 244 ms 30508 KB Output is correct
57 Correct 198 ms 33236 KB Output is correct
58 Correct 212 ms 33368 KB Output is correct
59 Correct 211 ms 33356 KB Output is correct
60 Correct 187 ms 31552 KB Output is correct
61 Correct 198 ms 33356 KB Output is correct
62 Correct 192 ms 32924 KB Output is correct
63 Correct 199 ms 33396 KB Output is correct
64 Correct 199 ms 32368 KB Output is correct
65 Correct 204 ms 33452 KB Output is correct