oj.uz

Submission #582736

# Submission time Handle Problem Language Result Execution time Memory
582736 2022-06-24T11:08:37 Z elkernos Building 4 (JOI20_building4) C++17
100 / 100
 305 ms 84280 KB 
#include <bits/stdc++.h>

using namespace std;

int main()
{
    cin.tie(nullptr)->sync_with_stdio(0);
    int n;
    cin >> n;
    vector<int> a(2 * n), b(2 * n);
    for(int &i : a) {
        cin >> i;
    }
    for(int &i : b) {
        cin >> i;
    }
    const int oo = 1e9;
    vector<vector<pair<int, int>>> dp(2 * n, vector<pair<int, int>>(2, {oo, -oo}));
    dp[0][0] = {1, 1};
    dp[0][1] = {0, 0};
    auto merge = [&](pair<int, int> &one, pair<int, int> &two, int offset) {
        one = {min(one.first, two.first + offset), max(one.second, two.second + offset)};
    };
    for(int i = 0; i < 2 * n - 1; i++) {
        if(a[i] <= a[i + 1]) merge(dp[i + 1][0], dp[i][0], 1);
        if(a[i] <= b[i + 1]) merge(dp[i + 1][1], dp[i][0], 0);
        if(b[i] <= a[i + 1]) merge(dp[i + 1][0], dp[i][1], 1);
        if(b[i] <= b[i + 1]) merge(dp[i + 1][1], dp[i][1], 0);
    }
    int used = n, nxt = oo;
    string ans(2 * n, '?');
    for(int i = 2 * n - 1; i >= 0; i--) {
        if(dp[i][0].first <= used && used <= dp[i][0].second && a[i] <= nxt) {
            ans[i] = 'A';
            used--;
            nxt = a[i];
        }
        else if(dp[i][1].first <= used && used <= dp[i][1].second && b[i] <= nxt) {
            ans[i] = 'B';
            nxt = b[i];
        }
        else {
            cout << "-1" << '\n';
            exit(0);
        }
    }
    cout << ans << '\n';
}

Subtask #1
11.0 / 11.0

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

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 2 ms 596 KB Output is correct
7 Correct 2 ms 584 KB Output is correct
8 Correct 2 ms 596 KB Output is correct
9 Correct 2 ms 596 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 2 ms 596 KB Output is correct
12 Correct 2 ms 596 KB Output is correct
13 Correct 2 ms 596 KB Output is correct
14 Correct 2 ms 560 KB Output is correct
15 Correct 2 ms 596 KB Output is correct
16 Correct 2 ms 596 KB Output is correct
17 Correct 2 ms 596 KB Output is correct
18 Correct 2 ms 596 KB Output is correct
19 Correct 2 ms 596 KB Output is correct
20 Correct 1 ms 596 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 1 ms 596 KB Output is correct
23 Correct 1 ms 596 KB Output is correct
24 Correct 2 ms 596 KB Output is correct
25 Correct 3 ms 596 KB Output is correct
26 Correct 2 ms 596 KB Output is correct
27 Correct 2 ms 596 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 2 ms 596 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 524 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 1 ms 596 KB Output is correct
34 Correct 262 ms 81844 KB Output is correct
35 Correct 273 ms 78120 KB Output is correct
36 Correct 268 ms 76956 KB Output is correct
37 Correct 274 ms 78412 KB Output is correct
38 Correct 236 ms 78376 KB Output is correct
39 Correct 261 ms 77716 KB Output is correct
40 Correct 290 ms 83488 KB Output is correct
41 Correct 273 ms 79444 KB Output is correct
42 Correct 288 ms 81336 KB Output is correct
43 Correct 290 ms 84096 KB Output is correct
44 Correct 284 ms 84096 KB Output is correct
45 Correct 298 ms 83984 KB Output is correct
46 Correct 293 ms 84036 KB Output is correct
47 Correct 305 ms 83152 KB Output is correct
48 Correct 284 ms 82964 KB Output is correct
49 Correct 271 ms 83612 KB Output is correct
50 Correct 274 ms 83184 KB Output is correct
51 Correct 274 ms 83188 KB Output is correct
52 Correct 204 ms 72464 KB Output is correct
53 Correct 196 ms 72448 KB Output is correct
54 Correct 190 ms 72556 KB Output is correct
55 Correct 191 ms 72272 KB Output is correct
56 Correct 271 ms 84280 KB Output is correct
57 Correct 232 ms 79032 KB Output is correct
58 Correct 229 ms 79396 KB Output is correct
59 Correct 232 ms 79384 KB Output is correct
60 Correct 230 ms 75040 KB Output is correct
61 Correct 233 ms 79924 KB Output is correct
62 Correct 239 ms 78912 KB Output is correct
63 Correct 235 ms 79876 KB Output is correct
64 Correct 231 ms 77224 KB Output is correct
65 Correct 242 ms 79992 KB Output is correct