oj.uz

Submission #359324

# Submission time Handle Problem Language Result Execution time Memory
359324 2021-01-26T18:25:26 Z valerikk Building 4 (JOI20_building4) C++17
100 / 100
 282 ms 45664 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 1e6 + 7, INF = 1e9 + 10;

int n, a[N][2];
int mn[N][2], mx[N][2];

int main() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
#endif
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> n;
    a[0][0] = a[0][1] = 0;
    for (int i = 0; i < 2; i++) {
        for (int j = 1; j <= 2 * n; j++) cin >> a[j][i];
    }
    for (int i = 1; i <= 2 * n; i++) {
        for (int j = 0; j < 2; j++) {
            mn[i][j] = INF;
            mx[i][j] = -INF;
        }
    }
    for (int i = 0; i < 2; i++) mn[0][i] = mx[0][i] = 0;
    for (int i = 1; i <= 2 * n; i++) {
        for (int j = 0; j < 2; j++) {
            for (int k = 0; k < 2; k++) {
                if (a[i - 1][k] <= a[i][j]) {
                    if (mn[i - 1][k] != INF) mn[i][j] = min(mn[i][j], mn[i - 1][k] + j);
                    if (mx[i - 1][k] != -INF) mx[i][j] = max(mx[i][j], mx[i - 1][k] + j);
                }
            }
        }
    }
    int j = -1;
    for (int i = 0; i < 2; i++) {
        if (mn[2 * n][i] <= n && n <= mx[2 * n][i]) {
            j = i;
            break;
        }
    }
    if (j == -1) {
        cout << -1;
        return 0;
    }
    string ans = "";
    int cur = n;
    for (int i = 2 * n; i > 0; i--) {
        cur -= j;
        ans.push_back('A' + j);
        int jj = -1;
        for (int k = 0; k < 2; k++) {
            if (mn[i - 1][k] <= cur && cur <= mx[i - 1][k] && a[i - 1][k] <= a[i][j]) {
                jj = k;
                break;
            }
        }
        j = jj;
    }
    reverse(ans.begin(), ans.end());
    cout << ans << endl;
    return 0;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 2 ms 492 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 2 ms 492 KB Output is correct
13 Correct 2 ms 492 KB Output is correct
14 Correct 2 ms 492 KB Output is correct
15 Correct 2 ms 492 KB Output is correct
16 Correct 1 ms 492 KB Output is correct
17 Correct 2 ms 492 KB Output is correct
18 Correct 2 ms 492 KB Output is correct
19 Correct 2 ms 492 KB Output is correct
20 Correct 1 ms 492 KB Output is correct
21 Correct 1 ms 492 KB Output is correct
22 Correct 1 ms 492 KB Output is correct
23 Correct 1 ms 492 KB Output is correct
24 Correct 2 ms 492 KB Output is correct
25 Correct 1 ms 512 KB Output is correct
26 Correct 1 ms 492 KB Output is correct
27 Correct 1 ms 492 KB Output is correct
28 Correct 1 ms 492 KB Output is correct
29 Correct 1 ms 492 KB Output is correct
30 Correct 1 ms 492 KB Output is correct
31 Correct 1 ms 492 KB Output is correct
32 Correct 1 ms 492 KB Output is correct
33 Correct 1 ms 492 KB Output is correct
34 Correct 262 ms 41324 KB Output is correct
35 Correct 262 ms 42020 KB Output is correct
36 Correct 253 ms 41508 KB Output is correct
37 Correct 263 ms 42276 KB Output is correct
38 Correct 243 ms 42276 KB Output is correct
39 Correct 241 ms 41412 KB Output is correct
40 Correct 258 ms 44768 KB Output is correct
41 Correct 248 ms 42404 KB Output is correct
42 Correct 267 ms 43940 KB Output is correct
43 Correct 277 ms 45232 KB Output is correct
44 Correct 282 ms 45536 KB Output is correct
45 Correct 279 ms 45280 KB Output is correct
46 Correct 269 ms 45536 KB Output is correct
47 Correct 261 ms 44768 KB Output is correct
48 Correct 263 ms 44232 KB Output is correct
49 Correct 264 ms 45024 KB Output is correct
50 Correct 276 ms 44496 KB Output is correct
51 Correct 274 ms 44636 KB Output is correct
52 Correct 198 ms 33632 KB Output is correct
53 Correct 199 ms 33672 KB Output is correct
54 Correct 185 ms 33632 KB Output is correct
55 Correct 184 ms 33248 KB Output is correct
56 Correct 267 ms 45664 KB Output is correct
57 Correct 238 ms 40416 KB Output is correct
58 Correct 228 ms 40672 KB Output is correct
59 Correct 246 ms 40672 KB Output is correct
60 Correct 215 ms 38564 KB Output is correct
61 Correct 232 ms 41056 KB Output is correct
62 Correct 243 ms 40376 KB Output is correct
63 Correct 257 ms 41056 KB Output is correct
64 Correct 224 ms 39716 KB Output is correct
65 Correct 234 ms 41004 KB Output is correct