oj.uz

Submission #211611

# Submission time Handle Problem Language Result Execution time Memory
211611 2020-03-20T20:06:49 Z silxikys Building 4 (JOI20_building4) C++14
100 / 100
 1243 ms 104468 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

const int maxn = 500005;
int n, a[2*maxn], b[2*maxn];
pair<int,int> dp[2*maxn][2];

pair<int,int> merge(pair<int,int> a, pair<int,int> b) {
    if (a.first == -1) return b;
    if (b.first == -1) return a;
    return {min(a.first,b.first),max(a.second,b.second)};
}

string res;

void recon(int i, int j, int k) {
    if (i == 0) {
        reverse(res.begin(),res.end());
        cout << res << '\n';
        exit(0);
    }
    res += j ? 'B' : 'A';
    if (j == 0) {
        --k;
        if (a[i] >= a[i-1] && dp[i-1][0].first <= k && k <= dp[i-1][0].second) {
            recon(i-1,0,k);
        }
        else {
            recon(i-1,1,k);
        }
    }
    else {
        if (b[i] >= a[i-1] && dp[i-1][0].first <= k && k <= dp[i-1][0].second) {
            recon(i-1,0,k);
        }
        else {
            recon(i-1,1,k);
        }
    }
}

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];
    }
    for (int i = 0; i < 2*maxn; i++) {
        for (int j = 0; j < 2; j++) {
            dp[i][j] = {-1,-1};
        }
    }
    dp[0][0] = dp[1][0] = {0,0};
    for (int i = 1;  i <= 2*n; i++) {
        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]);
        if (dp[i][0].first != -1) {
            ++dp[i][0].first; ++dp[i][0].second;
        }
        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]);
        //printf("[%d][0]: (%d, %d)\n",i,dp[i][0].first,dp[i][0].second);
        //printf("[%d][1]: (%d, %d)\n",i,dp[i][1].first,dp[i][1].second);
    }
    if (dp[2*n][0].first <= n && n <= dp[2*n][0].second) {
        recon(2*n,0,n);
    }
    else if (dp[2*n][1].first <= n && n <= dp[2*n][1].second) {
        recon(2*n,1,n);
    }
    else {
        cout << -1 << '\n';
    }
}

Subtask #1
11.0 / 11.0

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

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 16000 KB Output is correct
2 Correct 12 ms 16000 KB Output is correct
3 Correct 12 ms 16000 KB Output is correct
4 Correct 14 ms 16000 KB Output is correct
5 Correct 17 ms 16000 KB Output is correct
6 Correct 18 ms 16384 KB Output is correct
7 Correct 17 ms 16256 KB Output is correct
8 Correct 16 ms 16256 KB Output is correct
9 Correct 16 ms 16256 KB Output is correct
10 Correct 16 ms 16256 KB Output is correct
11 Correct 16 ms 16256 KB Output is correct
12 Correct 18 ms 16384 KB Output is correct
13 Correct 18 ms 16384 KB Output is correct
14 Correct 17 ms 16384 KB Output is correct
15 Correct 17 ms 16384 KB Output is correct
16 Correct 17 ms 16000 KB Output is correct
17 Correct 19 ms 16256 KB Output is correct
18 Correct 18 ms 16384 KB Output is correct
19 Correct 17 ms 16384 KB Output is correct
20 Correct 15 ms 16384 KB Output is correct
21 Correct 15 ms 16384 KB Output is correct
22 Correct 16 ms 16384 KB Output is correct
23 Correct 15 ms 16384 KB Output is correct
24 Correct 19 ms 16384 KB Output is correct
25 Correct 15 ms 16384 KB Output is correct
26 Correct 15 ms 16384 KB Output is correct
27 Correct 15 ms 16384 KB Output is correct
28 Correct 15 ms 16256 KB Output is correct
29 Correct 15 ms 16384 KB Output is correct
30 Correct 16 ms 16384 KB Output is correct
31 Correct 16 ms 16384 KB Output is correct
32 Correct 15 ms 16256 KB Output is correct
33 Correct 16 ms 16384 KB Output is correct
34 Correct 1179 ms 23644 KB Output is correct
35 Correct 1141 ms 97976 KB Output is correct
36 Correct 1147 ms 96564 KB Output is correct
37 Correct 1153 ms 98096 KB Output is correct
38 Correct 1139 ms 98124 KB Output is correct
39 Correct 1127 ms 98548 KB Output is correct
40 Correct 1207 ms 103912 KB Output is correct
41 Correct 1121 ms 99756 KB Output is correct
42 Correct 1188 ms 101424 KB Output is correct
43 Correct 1243 ms 104380 KB Output is correct
44 Correct 1235 ms 104172 KB Output is correct
45 Correct 1234 ms 104336 KB Output is correct
46 Correct 1220 ms 104168 KB Output is correct
47 Correct 1195 ms 104172 KB Output is correct
48 Correct 1185 ms 104468 KB Output is correct
49 Correct 1212 ms 104156 KB Output is correct
50 Correct 1208 ms 104176 KB Output is correct
51 Correct 1196 ms 104172 KB Output is correct
52 Correct 676 ms 104220 KB Output is correct
53 Correct 678 ms 104192 KB Output is correct
54 Correct 666 ms 104172 KB Output is correct
55 Correct 668 ms 104172 KB Output is correct
56 Correct 1231 ms 104228 KB Output is correct
57 Correct 996 ms 103756 KB Output is correct
58 Correct 1010 ms 104340 KB Output is correct
59 Correct 997 ms 104296 KB Output is correct
60 Correct 963 ms 98992 KB Output is correct
61 Correct 1024 ms 104464 KB Output is correct
62 Correct 1022 ms 103072 KB Output is correct
63 Correct 1041 ms 104288 KB Output is correct
64 Correct 1004 ms 101292 KB Output is correct
65 Correct 1028 ms 104392 KB Output is correct