oj.uz

답안 #764229

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
764229 2023-06-23T09:03:23 Z PoonYaPat 건물 4 (JOI20_building4) C++14
100 / 100
 233 ms 45456 KB 
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;

const int inf=1e9;
int n,a[1000001],b[1000001];
pii dp[1000001][2];

pii merge(pii a, pii b) {return pii(min(a.first,b.first),max(a.second,b.second));}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(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[0][0]=pii(0,0);
    dp[0][1]=pii(1,1);
    for (int i=1; i<2*n; ++i) {
        dp[i][0]=pii(inf,-inf);
        if (a[i]>=a[i-1]) dp[i][0]=merge(dp[i][0],dp[i-1][0]);
        if (a[i]>=b[i-1]) dp[i][0]=merge(dp[i][0],dp[i-1][1]);

        dp[i][1]=pii(inf,-inf);
        if (b[i]>=a[i-1]) dp[i][1]=merge(dp[i][1],dp[i-1][0]);
        if (b[i]>=b[i-1]) dp[i][1]=merge(dp[i][1],dp[i-1][1]);
        dp[i][1]=pii(dp[i][1].first+1,dp[i][1].second+1);
    }

    if (dp[2*n-1][0].first<=n && n<=dp[2*n-1][0].second) {
        string ans="A";
        int cnt=n, last=a[2*n-1];

        for (int i=2*n-2; i>=0; --i) {
            if (cnt==0) ans+='A';
            else {
                if (a[i]<=last && dp[i][0].first<=cnt && cnt<=dp[i][0].second) ans+='A', last=a[i];
                else ans+='B', --cnt, last=b[i];
            }
        }
        reverse(ans.begin(),ans.end());
        cout<<ans;
        return 0;
    }

    if (dp[2*n-1][1].first<=n && n<=dp[2*n-1][1].second) {
        string ans="B";
        int cnt=n-1, last=b[2*n-1];

        for (int i=2*n-2; i>=0; --i) {
            if (cnt==0) ans+='A';
            else {
                if (a[i]<=last && dp[i][0].first<=cnt && cnt<=dp[i][0].second) ans+='A', last=a[i];
                else ans+='B', --cnt, last=b[i];
            }
        }
        reverse(ans.begin(),ans.end());
        cout<<ans;
        return 0;
    }

    cout<<-1;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 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 328 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 1 ms 372 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 468 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 1 ms 476 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 2 ms 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 380 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 472 KB Output is correct
25 Correct 2 ms 384 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 468 KB Output is correct
29 Correct 2 ms 388 KB Output is correct
30 Correct 1 ms 472 KB Output is correct
31 Correct 2 ms 392 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 2 ms 468 KB Output is correct

Subtask #2
89.0 / 89.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 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 328 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 1 ms 372 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 468 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 1 ms 476 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 2 ms 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 380 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 472 KB Output is correct
25 Correct 2 ms 384 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 468 KB Output is correct
29 Correct 2 ms 388 KB Output is correct
30 Correct 1 ms 472 KB Output is correct
31 Correct 2 ms 392 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 2 ms 468 KB Output is correct
34 Correct 168 ms 42352 KB Output is correct
35 Correct 162 ms 41940 KB Output is correct
36 Correct 159 ms 41328 KB Output is correct
37 Correct 161 ms 42176 KB Output is correct
38 Correct 156 ms 42132 KB Output is correct
39 Correct 176 ms 41344 KB Output is correct
40 Correct 187 ms 44748 KB Output is correct
41 Correct 156 ms 42304 KB Output is correct
42 Correct 177 ms 43844 KB Output is correct
43 Correct 178 ms 45256 KB Output is correct
44 Correct 190 ms 45192 KB Output is correct
45 Correct 204 ms 45212 KB Output is correct
46 Correct 172 ms 45272 KB Output is correct
47 Correct 168 ms 44356 KB Output is correct
48 Correct 185 ms 44100 KB Output is correct
49 Correct 176 ms 44944 KB Output is correct
50 Correct 173 ms 44380 KB Output is correct
51 Correct 233 ms 44392 KB Output is correct
52 Correct 128 ms 33528 KB Output is correct
53 Correct 159 ms 33604 KB Output is correct
54 Correct 111 ms 33464 KB Output is correct
55 Correct 112 ms 33168 KB Output is correct
56 Correct 167 ms 45456 KB Output is correct
57 Correct 165 ms 40200 KB Output is correct
58 Correct 162 ms 40416 KB Output is correct
59 Correct 191 ms 40416 KB Output is correct
60 Correct 137 ms 38452 KB Output is correct
61 Correct 158 ms 40908 KB Output is correct
62 Correct 144 ms 40332 KB Output is correct
63 Correct 145 ms 40900 KB Output is correct
64 Correct 167 ms 39500 KB Output is correct
65 Correct 178 ms 40888 KB Output is correct