oj.uz

Submission #211800

# Submission time Handle Problem Language Result Execution time Memory
211800 2020-03-21T10:16:55 Z grt Building 4 (JOI20_building4) C++17
100 / 100
 336 ms 31596 KB 
#include <bits/stdc++.h>
#define ST first
#define ND second
#define PB push_back
#define _ ios_base::sync_with_stdio(0); cin.tie(0);

using namespace std;

using ll = long long;
using vi = vector<int>;
using pi = pair<int,int>;

const int nax = 1000*1000+10,INF=1e9+10;
int n;
int a[nax], b[nax];
pi dp[nax][2];

int main() {_
    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] = dp[0][0] = {0,0};
    for(int i=1; i<=2*n; i++) {
        dp[i][0] = dp[i][1] = {INF,-INF};
        if(a[i]>=a[i-1]) {
            dp[i][0] = {min(dp[i][0].ST,dp[i-1][0].ST+1),max(dp[i][0].ND,dp[i-1][0].ND+1)};
        }
        if(a[i]>=b[i-1]) {
            dp[i][0] = {min(dp[i][0].ST,dp[i-1][1].ST+1),max(dp[i][0].ND,dp[i-1][1].ND+1)};
        }
        if(b[i]>=b[i-1]) {
            dp[i][1] = {min(dp[i][1].ST,dp[i-1][1].ST),max(dp[i][1].ND,dp[i-1][1].ND)};
        }
        if(b[i]>=a[i-1]) {
            dp[i][1] = {min(dp[i][1].ST,dp[i-1][0].ST),max(dp[i][1].ND,dp[i-1][0].ND)};
        }
    }
    int x = 2*n, y = n, last = INF;
    bool ok = 1;
    string ans = "";
    while(x>0) {
        if(dp[x][0].ST<=y&&y<=dp[x][0].ND&&a[x]<=last) {
            last = a[x];
            x--;
            y--;
            ans+="A";
        } else if(dp[x][1].ST<=y&&y<=dp[x][1].ND&&b[x]<=last) {
            last = b[x];
            x--;
            ans+="B";
        } else {
            ok = 0;
            break;
        }
    }
    if(!ok) {
        cout<<"-1";
        return 0;
    }
    reverse(ans.begin(),ans.end());
    cout<<ans;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 6 ms 512 KB Output is correct
6 Correct 6 ms 512 KB Output is correct
7 Correct 6 ms 512 KB Output is correct
8 Correct 6 ms 512 KB Output is correct
9 Correct 6 ms 512 KB Output is correct
10 Correct 6 ms 512 KB Output is correct
11 Correct 6 ms 512 KB Output is correct
12 Correct 6 ms 512 KB Output is correct
13 Correct 7 ms 512 KB Output is correct
14 Correct 6 ms 512 KB Output is correct
15 Correct 6 ms 512 KB Output is correct
16 Correct 6 ms 512 KB Output is correct
17 Correct 6 ms 512 KB Output is correct
18 Correct 6 ms 512 KB Output is correct
19 Correct 6 ms 512 KB Output is correct
20 Correct 5 ms 512 KB Output is correct
21 Correct 6 ms 512 KB Output is correct
22 Correct 5 ms 512 KB Output is correct
23 Correct 5 ms 512 KB Output is correct
24 Correct 6 ms 512 KB Output is correct
25 Correct 6 ms 512 KB Output is correct
26 Correct 6 ms 512 KB Output is correct
27 Correct 5 ms 512 KB Output is correct
28 Correct 5 ms 512 KB Output is correct
29 Correct 6 ms 512 KB Output is correct
30 Correct 6 ms 512 KB Output is correct
31 Correct 5 ms 512 KB Output is correct
32 Correct 5 ms 512 KB Output is correct
33 Correct 1 ms 512 KB Output is correct
34 Correct 303 ms 23688 KB Output is correct
35 Correct 312 ms 26032 KB Output is correct
36 Correct 280 ms 24624 KB Output is correct
37 Correct 292 ms 29616 KB Output is correct
38 Correct 292 ms 29592 KB Output is correct
39 Correct 273 ms 28080 KB Output is correct
40 Correct 315 ms 25940 KB Output is correct
41 Correct 304 ms 25904 KB Output is correct
42 Correct 311 ms 25264 KB Output is correct
43 Correct 336 ms 31340 KB Output is correct
44 Correct 335 ms 31596 KB Output is correct
45 Correct 326 ms 31232 KB Output is correct
46 Correct 303 ms 31340 KB Output is correct
47 Correct 294 ms 26988 KB Output is correct
48 Correct 311 ms 26368 KB Output is correct
49 Correct 318 ms 31340 KB Output is correct
50 Correct 303 ms 26216 KB Output is correct
51 Correct 317 ms 26088 KB Output is correct
52 Correct 200 ms 29036 KB Output is correct
53 Correct 198 ms 29036 KB Output is correct
54 Correct 182 ms 28780 KB Output is correct
55 Correct 192 ms 29036 KB Output is correct
56 Correct 319 ms 30700 KB Output is correct
57 Correct 267 ms 27116 KB Output is correct
58 Correct 265 ms 27372 KB Output is correct
59 Correct 283 ms 27244 KB Output is correct
60 Correct 269 ms 25652 KB Output is correct
61 Correct 269 ms 27244 KB Output is correct
62 Correct 272 ms 26736 KB Output is correct
63 Correct 281 ms 27116 KB Output is correct
64 Correct 267 ms 26032 KB Output is correct
65 Correct 288 ms 27116 KB Output is correct