oj.uz

Submission #870623

# Submission time Handle Problem Language Result Execution time Memory
870623 2023-11-08T14:42:05 Z 12345678 Building 4 (JOI20_building4) C++17
100 / 100
 202 ms 44728 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]);
        //cout<<i<<' '<<dp[0][i][0]<<' '<<dp[0][i][1]<<' '<<dp[1][i][0]<<' '<<dp[1][i][1]<<'\n';
    }
    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 1 ms 6488 KB Output is correct
2 Correct 1 ms 6488 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 1 ms 6488 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 2 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 2 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 2 ms 6492 KB Output is correct
12 Correct 2 ms 6492 KB Output is correct
13 Correct 2 ms 6492 KB Output is correct
14 Correct 2 ms 6492 KB Output is correct
15 Correct 2 ms 6492 KB Output is correct
16 Correct 2 ms 6488 KB Output is correct
17 Correct 2 ms 6624 KB Output is correct
18 Correct 2 ms 6492 KB Output is correct
19 Correct 2 ms 6492 KB Output is correct
20 Correct 2 ms 6492 KB Output is correct
21 Correct 1 ms 6492 KB Output is correct
22 Correct 1 ms 6488 KB Output is correct
23 Correct 1 ms 6492 KB Output is correct
24 Correct 1 ms 6492 KB Output is correct
25 Correct 1 ms 6568 KB Output is correct
26 Correct 1 ms 6492 KB Output is correct
27 Correct 1 ms 6620 KB Output is correct
28 Correct 1 ms 6492 KB Output is correct
29 Correct 1 ms 6492 KB Output is correct
30 Correct 1 ms 6492 KB Output is correct
31 Correct 1 ms 6492 KB Output is correct
32 Correct 1 ms 6492 KB Output is correct
33 Correct 1 ms 6492 KB Output is correct

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6488 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 1 ms 6488 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 2 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 2 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 2 ms 6492 KB Output is correct
12 Correct 2 ms 6492 KB Output is correct
13 Correct 2 ms 6492 KB Output is correct
14 Correct 2 ms 6492 KB Output is correct
15 Correct 2 ms 6492 KB Output is correct
16 Correct 2 ms 6488 KB Output is correct
17 Correct 2 ms 6624 KB Output is correct
18 Correct 2 ms 6492 KB Output is correct
19 Correct 2 ms 6492 KB Output is correct
20 Correct 2 ms 6492 KB Output is correct
21 Correct 1 ms 6492 KB Output is correct
22 Correct 1 ms 6488 KB Output is correct
23 Correct 1 ms 6492 KB Output is correct
24 Correct 1 ms 6492 KB Output is correct
25 Correct 1 ms 6568 KB Output is correct
26 Correct 1 ms 6492 KB Output is correct
27 Correct 1 ms 6620 KB Output is correct
28 Correct 1 ms 6492 KB Output is correct
29 Correct 1 ms 6492 KB Output is correct
30 Correct 1 ms 6492 KB Output is correct
31 Correct 1 ms 6492 KB Output is correct
32 Correct 1 ms 6492 KB Output is correct
33 Correct 1 ms 6492 KB Output is correct
34 Correct 154 ms 23636 KB Output is correct
35 Correct 167 ms 24920 KB Output is correct
36 Correct 171 ms 42236 KB Output is correct
37 Correct 178 ms 42836 KB Output is correct
38 Correct 172 ms 42788 KB Output is correct
39 Correct 164 ms 41812 KB Output is correct
40 Correct 184 ms 44092 KB Output is correct
41 Correct 163 ms 42612 KB Output is correct
42 Correct 175 ms 43476 KB Output is correct
43 Correct 188 ms 44452 KB Output is correct
44 Correct 189 ms 44372 KB Output is correct
45 Correct 202 ms 44460 KB Output is correct
46 Correct 180 ms 44728 KB Output is correct
47 Correct 173 ms 43604 KB Output is correct
48 Correct 170 ms 43344 KB Output is correct
49 Correct 185 ms 44380 KB Output is correct
50 Correct 186 ms 43712 KB Output is correct
51 Correct 196 ms 43564 KB Output is correct
52 Correct 134 ms 32800 KB Output is correct
53 Correct 143 ms 32696 KB Output is correct
54 Correct 122 ms 32700 KB Output is correct
55 Correct 131 ms 32336 KB Output is correct
56 Correct 174 ms 44628 KB Output is correct
57 Correct 163 ms 39508 KB Output is correct
58 Correct 153 ms 39616 KB Output is correct
59 Correct 151 ms 39512 KB Output is correct
60 Correct 161 ms 38996 KB Output is correct
61 Correct 154 ms 40016 KB Output is correct
62 Correct 162 ms 39736 KB Output is correct
63 Correct 179 ms 40092 KB Output is correct
64 Correct 152 ms 39508 KB Output is correct
65 Correct 155 ms 40016 KB Output is correct