oj.uz

답안 #596828

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
596828 2022-07-15T07:16:16 Z czhang2718 건물 4 (JOI20_building4) C++17
100 / 100
 248 ms 27188 KB 
#include "bits/stdc++.h"
using namespace std;

const int N=1e6;
int n;
int a[N], b[N];
int dp[N][2][2];

int main(){
    cin.tie(0)->sync_with_stdio(0);

    cin >> n;
    for(int i=0; i<2*n; i++){
        cin >> a[i];
    }
    for(int i=0; i<2*n; i++){
        cin >> b[i];
    }

    // dp[i][A/B][min/max]
    dp[0][0][0]=dp[0][0][1]=1;
    dp[0][1][0]=dp[0][1][1]=0;

    for(int i=1; i<2*n; i++){
        dp[i][0][0]=dp[i][1][0]=1e9;
        dp[i][0][1]=dp[i][1][1]=-1e9;

        dp[i][0][0]=min(a[i-1]<=a[i]?dp[i-1][0][0]+1:1e9, b[i-1]<=a[i]?dp[i-1][1][0]+1:1e9);
        dp[i][0][1]=max(a[i-1]<=a[i]?dp[i-1][0][1]+1:-1e9, b[i-1]<=a[i]?dp[i-1][1][1]+1:-1e9);

        dp[i][1][0]=min(a[i-1]<=b[i]?dp[i-1][0][0]:1e9, b[i-1]<=b[i]?dp[i-1][1][0]:1e9);
        dp[i][1][1]=max(a[i-1]<=b[i]?dp[i-1][0][1]:-1e9, b[i-1]<=b[i]?dp[i-1][1][1]:-1e9);

        // cout << dp[i][0][0] << " " << dp[i][0][1] << " " << dp[i][1][0] << " " << dp[i][1][1] << "\n";
    }

    if((dp[2*n-1][0][0]<=n && dp[2*n-1][0][1]>=n) || (dp[2*n-1][1][0]<=n && dp[2*n-1][1][1]>=n)){
        int k=n;
        string ans(" ", 2*n);
        // cout << ans.size() << "\n";
        int lst=1e9;
        for(int i=2*n-1; i>=1; i--){
            // cout << "k " << k << " lst " << lst << "\n";
            if(a[i]<=lst && dp[i][0][0]<=k && dp[i][0][1]>=k){
                ans[i]='A';
                lst=a[i];
                k--;
            }
            else ans[i]='B', lst=b[i];
        }
        if(k) ans[0]='A';
        else ans[0]='B';
        cout << ans;
    }
    else cout << -1;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 2 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 2 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 420 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 2 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 408 KB Output is correct
20 Correct 2 ms 468 KB Output is correct
21 Correct 1 ms 476 KB Output is correct
22 Correct 2 ms 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 1 ms 380 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 376 KB Output is correct
31 Correct 1 ms 572 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 472 KB Output is correct

Subtask #2
89.0 / 89.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 2 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 2 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 420 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 2 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 408 KB Output is correct
20 Correct 2 ms 468 KB Output is correct
21 Correct 1 ms 476 KB Output is correct
22 Correct 2 ms 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 1 ms 380 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 376 KB Output is correct
31 Correct 1 ms 572 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 472 KB Output is correct
34 Correct 236 ms 24672 KB Output is correct
35 Correct 242 ms 25124 KB Output is correct
36 Correct 233 ms 24624 KB Output is correct
37 Correct 213 ms 25316 KB Output is correct
38 Correct 202 ms 25316 KB Output is correct
39 Correct 218 ms 25740 KB Output is correct
40 Correct 226 ms 26920 KB Output is correct
41 Correct 194 ms 25800 KB Output is correct
42 Correct 234 ms 26244 KB Output is correct
43 Correct 248 ms 27040 KB Output is correct
44 Correct 240 ms 27060 KB Output is correct
45 Correct 242 ms 27104 KB Output is correct
46 Correct 227 ms 27036 KB Output is correct
47 Correct 207 ms 26960 KB Output is correct
48 Correct 211 ms 27016 KB Output is correct
49 Correct 208 ms 27084 KB Output is correct
50 Correct 235 ms 26976 KB Output is correct
51 Correct 241 ms 26928 KB Output is correct
52 Correct 194 ms 26952 KB Output is correct
53 Correct 170 ms 26924 KB Output is correct
54 Correct 173 ms 26940 KB Output is correct
55 Correct 153 ms 26968 KB Output is correct
56 Correct 231 ms 27012 KB Output is correct
57 Correct 195 ms 27188 KB Output is correct
58 Correct 208 ms 27104 KB Output is correct
59 Correct 195 ms 27104 KB Output is correct
60 Correct 174 ms 25648 KB Output is correct
61 Correct 188 ms 26916 KB Output is correct
62 Correct 195 ms 26608 KB Output is correct
63 Correct 188 ms 27024 KB Output is correct
64 Correct 182 ms 26092 KB Output is correct
65 Correct 195 ms 27052 KB Output is correct