oj.uz

Submission #719926

# Submission time Handle Problem Language Result Execution time Memory
719926 2023-04-07T04:44:02 Z walterw Building 4 (JOI20_building4) C++17
100 / 100
 264 ms 68836 KB 
#include "bits/stdc++.h"

using namespace std;

void abc() {cout << endl;}
template <typename T, typename ...U> void abc(T a, U ...b) {
    cout << a << ' ', abc(b...);
}
template <typename T> void printv(T l, T r) {
    while (l != r) cout << *l << " \n"[++l == r];
}
template <typename A, typename B> istream& operator >> (istream& o, pair<A, B> &a) {
    return o >> a.first >> a.second;
}
template <typename A, typename B> ostream& operator << (ostream& o, pair<A, B> a) {
    return o << '(' << a.first << ", " << a.second << ')';
}
template <typename T> ostream& operator << (ostream& o, vector<T> a) {
    bool is = false;
    for (T i : a) {o << (is ? ' ' : '{'), is = true, o << i;}
    return o << '}';
}

#ifdef local
#define test(args...) abc("[" + string(#args) + "]", args)
#else
#define test(args...) void(0)
#endif

using ll = long long;

ll dp[1000005][2][2];
ll a[1000005], b[1000005];

string ans = "";

void retrieve(int pos, int col, int aleft) {
    if (pos == 1) {
        if (col == 0) ans += "A";
        else ans += "B";
        return;
    }

    if (col == 0) {
        ans += "A";

        if (a[pos - 1] <= a[pos] && dp[pos - 1][0][0] <= (aleft - 1) && (aleft - 1) <= dp[pos - 1][0][1]) {
            retrieve(pos - 1, 0, aleft - 1);
        } else {
            retrieve(pos - 1, 1, aleft - 1);
        }
    } else {
        ans += "B";

        if (a[pos - 1] <= b[pos] && dp[pos - 1][0][0] <= (aleft) && (aleft) <= dp[pos - 1][0][1]) {
            retrieve(pos - 1, 0, aleft);
        } else {
            retrieve(pos - 1, 1, aleft);
        }
    }
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
//    freopen("", "r", stdin);
//    freopen("", "w", stdout);
    int n; 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 = 1; i <= 2 * n; i++) {
        dp[i][0][0] = dp[i][1][0] = 1e16;
        dp[i][0][1] = dp[i][1][1] = -1;
    }
    dp[1][0][0] = 1;
    dp[1][0][1] = 1;
    dp[1][1][0] = 0;
    dp[1][1][1] = 0;

    for (int i = 2; i <= 2 * n; i++) {
        if (a[i - 1] <= a[i]) {
            dp[i][0][0] = min(dp[i][0][0], dp[i - 1][0][0] + 1);
            dp[i][0][1] = max(dp[i][0][1], dp[i - 1][0][1] + 1);
        }

        if (b[i - 1] <= a[i]) {
            dp[i][0][0] = min(dp[i][0][0], dp[i - 1][1][0] + 1);
            dp[i][0][1] = max(dp[i][0][1], dp[i - 1][1][1] + 1);
        }

        if (a[i-1] <= b[i]) {
            dp[i][1][0] = min(dp[i][1][0], dp[i-1][0][0]);
            dp[i][1][1] = max(dp[i][1][1], dp[i-1][0][1]);
        }

        if (b[i-1] <= b[i]) {
            dp[i][1][0] = min(dp[i][1][0], dp[i-1][1][0]);
            dp[i][1][1] = max(dp[i][1][1], dp[i-1][1][1]);
        }
    }

    if ((dp[2 * n][0][0] <= n && dp[2 * n][0][1] >= n)) {


        retrieve(2 * n, 0, n);
        reverse(ans.begin(), ans.end());
        cout << ans;
    } else if ((dp[2 * n][1][0] <= n && dp[2 * n][1][1] >= n)) {
        retrieve(2 * n, 1, n);
        reverse(ans.begin(), ans.end());
        cout << ans;
    } else {
        cout << -1;
    }

}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 552 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 1 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 468 KB Output is correct
21 Correct 1 ms 472 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 2 ms 596 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 1 ms 596 KB Output is correct
30 Correct 2 ms 468 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 472 KB Output is correct
33 Correct 1 ms 468 KB Output is correct

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 552 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 1 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 468 KB Output is correct
21 Correct 1 ms 472 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 2 ms 596 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 1 ms 596 KB Output is correct
30 Correct 2 ms 468 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 472 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 217 ms 65508 KB Output is correct
35 Correct 216 ms 63632 KB Output is correct
36 Correct 233 ms 62632 KB Output is correct
37 Correct 228 ms 63904 KB Output is correct
38 Correct 202 ms 63916 KB Output is correct
39 Correct 213 ms 63228 KB Output is correct
40 Correct 234 ms 68028 KB Output is correct
41 Correct 216 ms 64628 KB Output is correct
42 Correct 255 ms 66364 KB Output is correct
43 Correct 230 ms 68644 KB Output is correct
44 Correct 244 ms 68796 KB Output is correct
45 Correct 231 ms 68684 KB Output is correct
46 Correct 215 ms 68676 KB Output is correct
47 Correct 227 ms 67784 KB Output is correct
48 Correct 216 ms 67576 KB Output is correct
49 Correct 215 ms 68348 KB Output is correct
50 Correct 255 ms 67856 KB Output is correct
51 Correct 227 ms 67772 KB Output is correct
52 Correct 157 ms 56928 KB Output is correct
53 Correct 171 ms 57000 KB Output is correct
54 Correct 147 ms 56988 KB Output is correct
55 Correct 150 ms 56648 KB Output is correct
56 Correct 245 ms 68836 KB Output is correct
57 Correct 189 ms 63600 KB Output is correct
58 Correct 201 ms 63888 KB Output is correct
59 Correct 203 ms 63860 KB Output is correct
60 Correct 183 ms 60552 KB Output is correct
61 Correct 264 ms 64340 KB Output is correct
62 Correct 203 ms 63456 KB Output is correct
63 Correct 214 ms 64556 KB Output is correct
64 Correct 188 ms 62108 KB Output is correct
65 Correct 192 ms 64384 KB Output is correct