oj.uz

Submission #211624

# Submission time Handle Problem Language Result Execution time Memory
211624 2020-03-20T20:46:41 Z kuroni Building 4 (JOI20_building4) C++17
100 / 100
 322 ms 28140 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
using namespace std;

const int N = 500005;

int n, a[2 * N][2];
bool chk[2 * N][2];
string ans;
pair<int, int> r[2 * N][2];

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> n;
    for (int it = 0; it < 2; it++) {
        for (int i = 1; i <= 2 * n; i++) {
            cin >> a[i][it];
        }
    }
    chk[0][0] = true;
    for (int i = 1; i <= 2 * n; i++) {
        for (int it = 0; it < 2; it++) {
            for (int j = 0; j < 2; j++) {
                if (chk[i - 1][j] && a[i - 1][j] <= a[i][it]) {
                    if (!chk[i][it]) {
                        chk[i][it] = true;
                        r[i][it] = {r[i - 1][j].fi + it, r[i - 1][j].se + it};
                    } else {
                        r[i][it].fi = min(r[i][it].fi, r[i - 1][j].fi + it);
                        r[i][it].se = max(r[i][it].se, r[i - 1][j].se + it);
                    }
                }
            }
        }
    }
    for (int it = 0; it < 2; it++) {
        if (chk[2 * n][it] && r[2 * n][it].fi <= n && n <= r[2 * n][it].se) {
            for (int i = 2 * n, cur = n; i >= 1; i--) {
                ans.push_back('A' + it);
                cur -= it;
                for (int j = 0; j < 2; j++) {
                    if (chk[i - 1][j] && a[i - 1][j] <= a[i][it] && r[i - 1][j].fi <= cur && cur <= r[i - 1][j].se) {
                        it = j;
                        break;
                    }
                }
            }
            reverse(ans.begin(), ans.end());
            return cout << ans, 0;
        }
    }
    cout << -1;
}

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 4 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 6 ms 384 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 6 ms 384 KB Output is correct
11 Correct 6 ms 384 KB Output is correct
12 Correct 6 ms 512 KB Output is correct
13 Correct 6 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 5 ms 512 KB Output is correct
18 Correct 6 ms 512 KB Output is correct
19 Correct 7 ms 512 KB Output is correct
20 Correct 5 ms 512 KB Output is correct
21 Correct 5 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 5 ms 512 KB Output is correct
25 Correct 5 ms 512 KB Output is correct
26 Correct 5 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 5 ms 512 KB Output is correct
30 Correct 5 ms 512 KB Output is correct
31 Correct 5 ms 512 KB Output is correct
32 Correct 5 ms 384 KB Output is correct
33 Correct 5 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 4 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 6 ms 384 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 6 ms 384 KB Output is correct
11 Correct 6 ms 384 KB Output is correct
12 Correct 6 ms 512 KB Output is correct
13 Correct 6 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 5 ms 512 KB Output is correct
18 Correct 6 ms 512 KB Output is correct
19 Correct 7 ms 512 KB Output is correct
20 Correct 5 ms 512 KB Output is correct
21 Correct 5 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 5 ms 512 KB Output is correct
25 Correct 5 ms 512 KB Output is correct
26 Correct 5 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 5 ms 512 KB Output is correct
30 Correct 5 ms 512 KB Output is correct
31 Correct 5 ms 512 KB Output is correct
32 Correct 5 ms 384 KB Output is correct
33 Correct 5 ms 512 KB Output is correct
34 Correct 272 ms 8056 KB Output is correct
35 Correct 279 ms 25904 KB Output is correct
36 Correct 280 ms 25520 KB Output is correct
37 Correct 281 ms 26032 KB Output is correct
38 Correct 283 ms 26032 KB Output is correct
39 Correct 289 ms 26160 KB Output is correct
40 Correct 291 ms 27756 KB Output is correct
41 Correct 268 ms 26672 KB Output is correct
42 Correct 295 ms 27056 KB Output is correct
43 Correct 322 ms 27884 KB Output is correct
44 Correct 320 ms 27884 KB Output is correct
45 Correct 307 ms 27888 KB Output is correct
46 Correct 306 ms 28012 KB Output is correct
47 Correct 295 ms 28012 KB Output is correct
48 Correct 280 ms 27884 KB Output is correct
49 Correct 288 ms 27888 KB Output is correct
50 Correct 301 ms 27884 KB Output is correct
51 Correct 293 ms 27884 KB Output is correct
52 Correct 185 ms 27860 KB Output is correct
53 Correct 183 ms 27908 KB Output is correct
54 Correct 166 ms 27884 KB Output is correct
55 Correct 189 ms 28012 KB Output is correct
56 Correct 295 ms 27884 KB Output is correct
57 Correct 263 ms 27760 KB Output is correct
58 Correct 253 ms 27884 KB Output is correct
59 Correct 258 ms 28012 KB Output is correct
60 Correct 252 ms 26160 KB Output is correct
61 Correct 272 ms 27884 KB Output is correct
62 Correct 253 ms 27568 KB Output is correct
63 Correct 277 ms 28140 KB Output is correct
64 Correct 249 ms 26928 KB Output is correct
65 Correct 274 ms 27884 KB Output is correct