oj.uz

Submission #910155

# Submission time Handle Problem Language Result Execution time Memory
910155 2024-01-18T00:30:30 Z vjudge1 Building 4 (JOI20_building4) C++17
100 / 100
 259 ms 44752 KB 
#include <bits/stdc++.h>
using namespace std; 
const int nx=5e5+5;
int n, a[2*nx], b[2*nx], dp[2][2*nx][2], c, x; 
int main(){
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n;
    for (int i=1; i<=2*n; i++) cin>>a[i];
    for (int i=1; i<=2*n; i++) cin>>b[i];
    dp[0][1][0]=dp[0][1][1]=1;
    for (int i=2; i<=2*n; i++){
        dp[0][i][0]=dp[1][i][0]=1e9;
        dp[0][i][1]=dp[1][i][1]=-1e9;
        if (a[i]>=a[i-1]) dp[0][i][0]=min(dp[0][i][0], dp[0][i-1][0]+1), dp[0][i][1]=max(dp[0][i][1], dp[0][i-1][1]+1);
        if (a[i]>=b[i-1]) dp[0][i][0]=min(dp[0][i][0], dp[1][i-1][0]+1), dp[0][i][1]=max(dp[0][i][1], dp[1][i-1][1]+1);
        if (b[i]>=a[i-1]) dp[1][i][0]=min(dp[1][i][0], dp[0][i-1][0]), dp[1][i][1]=max(dp[1][i][1], dp[0][i-1][1]);
        if (b[i]>=b[i-1]) dp[1][i][0]=min(dp[1][i][0], dp[1][i-1][0]), dp[1][i][1]=max(dp[1][i][1], dp[1][i-1][1]);
    }
    vector<bool> ans;
    if (dp[0][2*n][0]<=n&&n<=dp[0][2*n][1]) x=n-1, c=0, ans.push_back(0);
    else if (dp[1][2*n][0]<=n&&n<=dp[1][2*n][1]) x=n, c=1, ans.push_back(1);
    else return cout<<-1, 0;
    for (int i=2*n-1; i>=1; i--){
        if (dp[0][i][0]<=x&&x<=dp[0][i][1]&&a[i]<=(c?b[i+1]:a[i+1])) --x, c=0, ans.push_back(0);
        else ans.push_back(1), c=1;
    }
    for (int i=2*n-1; i>=0; i--) cout<<(ans[i]?'B':'A');
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6492 KB Output is correct
2 Correct 2 ms 6488 KB Output is correct
3 Correct 2 ms 6492 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 3 ms 6492 KB Output is correct
6 Correct 3 ms 6492 KB Output is correct
7 Correct 3 ms 6492 KB Output is correct
8 Correct 2 ms 6492 KB Output is correct
9 Correct 2 ms 6492 KB Output is correct
10 Correct 3 ms 6492 KB Output is correct
11 Correct 3 ms 6492 KB Output is correct
12 Correct 3 ms 6492 KB Output is correct
13 Correct 3 ms 6744 KB Output is correct
14 Correct 3 ms 6616 KB Output is correct
15 Correct 3 ms 6676 KB Output is correct
16 Correct 3 ms 6492 KB Output is correct
17 Correct 3 ms 6492 KB Output is correct
18 Correct 4 ms 6492 KB Output is correct
19 Correct 2 ms 6696 KB Output is correct
20 Correct 2 ms 6624 KB Output is correct
21 Correct 2 ms 6656 KB Output is correct
22 Correct 2 ms 6492 KB Output is correct
23 Correct 3 ms 6488 KB Output is correct
24 Correct 3 ms 6488 KB Output is correct
25 Correct 2 ms 6492 KB Output is correct
26 Correct 2 ms 6492 KB Output is correct
27 Correct 2 ms 6492 KB Output is correct
28 Correct 3 ms 6492 KB Output is correct
29 Correct 2 ms 6492 KB Output is correct
30 Correct 3 ms 6492 KB Output is correct
31 Correct 3 ms 6496 KB Output is correct
32 Correct 2 ms 6488 KB Output is correct
33 Correct 2 ms 6492 KB Output is correct

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6492 KB Output is correct
2 Correct 2 ms 6488 KB Output is correct
3 Correct 2 ms 6492 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 3 ms 6492 KB Output is correct
6 Correct 3 ms 6492 KB Output is correct
7 Correct 3 ms 6492 KB Output is correct
8 Correct 2 ms 6492 KB Output is correct
9 Correct 2 ms 6492 KB Output is correct
10 Correct 3 ms 6492 KB Output is correct
11 Correct 3 ms 6492 KB Output is correct
12 Correct 3 ms 6492 KB Output is correct
13 Correct 3 ms 6744 KB Output is correct
14 Correct 3 ms 6616 KB Output is correct
15 Correct 3 ms 6676 KB Output is correct
16 Correct 3 ms 6492 KB Output is correct
17 Correct 3 ms 6492 KB Output is correct
18 Correct 4 ms 6492 KB Output is correct
19 Correct 2 ms 6696 KB Output is correct
20 Correct 2 ms 6624 KB Output is correct
21 Correct 2 ms 6656 KB Output is correct
22 Correct 2 ms 6492 KB Output is correct
23 Correct 3 ms 6488 KB Output is correct
24 Correct 3 ms 6488 KB Output is correct
25 Correct 2 ms 6492 KB Output is correct
26 Correct 2 ms 6492 KB Output is correct
27 Correct 2 ms 6492 KB Output is correct
28 Correct 3 ms 6492 KB Output is correct
29 Correct 2 ms 6492 KB Output is correct
30 Correct 3 ms 6492 KB Output is correct
31 Correct 3 ms 6496 KB Output is correct
32 Correct 2 ms 6488 KB Output is correct
33 Correct 2 ms 6492 KB Output is correct
34 Correct 176 ms 42816 KB Output is correct
35 Correct 177 ms 42580 KB Output is correct
36 Correct 181 ms 42200 KB Output is correct
37 Correct 187 ms 42808 KB Output is correct
38 Correct 181 ms 42680 KB Output is correct
39 Correct 178 ms 41812 KB Output is correct
40 Correct 185 ms 44076 KB Output is correct
41 Correct 238 ms 42436 KB Output is correct
42 Correct 187 ms 43600 KB Output is correct
43 Correct 259 ms 44472 KB Output is correct
44 Correct 194 ms 44368 KB Output is correct
45 Correct 209 ms 44480 KB Output is correct
46 Correct 185 ms 44492 KB Output is correct
47 Correct 180 ms 43700 KB Output is correct
48 Correct 183 ms 43344 KB Output is correct
49 Correct 189 ms 44472 KB Output is correct
50 Correct 196 ms 43476 KB Output is correct
51 Correct 191 ms 43712 KB Output is correct
52 Correct 140 ms 32564 KB Output is correct
53 Correct 159 ms 32596 KB Output is correct
54 Correct 137 ms 32680 KB Output is correct
55 Correct 126 ms 32416 KB Output is correct
56 Correct 195 ms 44752 KB Output is correct
57 Correct 165 ms 39460 KB Output is correct
58 Correct 193 ms 39724 KB Output is correct
59 Correct 174 ms 39612 KB Output is correct
60 Correct 165 ms 38716 KB Output is correct
61 Correct 154 ms 40120 KB Output is correct
62 Correct 250 ms 39744 KB Output is correct
63 Correct 161 ms 39984 KB Output is correct
64 Correct 152 ms 39464 KB Output is correct
65 Correct 158 ms 40008 KB Output is correct