oj.uz

Submission #249820

# Submission time Handle Problem Language Result Execution time Memory
249820 2020-07-15T21:22:12 Z Tc14 Building 4 (JOI20_building4) C++17
100 / 100
 391 ms 37112 KB 
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ve vector
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9 + 10;

int main() {

    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n, r, v;
    ve<int> A, B;
    ve<pii> Ap, Bp;
    ve<char> Sol;

    cin >> n;
    A = ve<int>(2 * n);
    B = ve<int>(2 * n);
    Ap = ve<pii>(2 * n, { INF, -INF });
    Bp = ve<pii>(2 * n, { INF, -INF });
    Sol = ve<char>(2 * n);

    for (int i = 0; i < 2 * n; i++) cin >> A[i];
    for (int i = 0; i < 2 * n; i++) cin >> B[i];

    Ap[0] = {1, 1};
    Bp[0] = {0, 0};

    for (int i = 1; i < 2 * n; i++) {

        if (A[i - 1] <= A[i]) {
            Ap[i] = {min(Ap[i].first, Ap[i - 1].first), max(Ap[i].second, Ap[i - 1].second)};
        }
        if (B[i - 1] <= A[i]) {
            Ap[i] = {min(Ap[i].first, Bp[i - 1].first), max(Ap[i].second, Bp[i - 1].second)};
        }

        if (A[i - 1] <= B[i]) {
            Bp[i] = {min(Bp[i].first, Ap[i - 1].first), max(Bp[i].second, Ap[i - 1].second)};
        }
        if (B[i - 1] <= B[i]) {
            Bp[i] = {min(Bp[i].first, Bp[i - 1].first), max(Bp[i].second, Bp[i - 1].second)};
        }

        if (Ap[i].first != INF) {
            Ap[i].first++;
            Ap[i].second++;
        }
    }

    if (Ap[2 * n - 1].first <= n && n <= Ap[2 * n - 1].second) r = 0;
    else if (Bp[2 * n - 1].first <= n && n <= Bp[2 * n - 1].second) r = 1;
    else r = -1;

    if (r == -1) cout << -1 << endl;
    else {
        Sol[2 * n - 1] = r;
        v = n;
        for (int i = 2 * n - 2; i >= 0; i--) {
            if (r == 0) {
                v--;
                if (A[i] <= A[i + 1] && Ap[i].first <= v && v <= Ap[i].second) r = 0;
                else r = 1;
            }
            else {
                if (A[i] <= B[i + 1] && Ap[i].first <= v && v <= Ap[i].second) r = 0;
                else r = 1;
            }
            Sol[i] = r;
        }

        for (int i = 0; i < 2 * n; i++) {
            if (Sol[i] == 0) cout << "A";
            else cout << "B";
        }
        cout << endl;
    }

    return 0;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 3 ms 512 KB Output is correct
12 Correct 2 ms 512 KB Output is correct
13 Correct 3 ms 512 KB Output is correct
14 Correct 2 ms 512 KB Output is correct
15 Correct 2 ms 512 KB Output is correct
16 Correct 2 ms 512 KB Output is correct
17 Correct 2 ms 512 KB Output is correct
18 Correct 3 ms 512 KB Output is correct
19 Correct 2 ms 512 KB Output is correct
20 Correct 1 ms 512 KB Output is correct
21 Correct 2 ms 512 KB Output is correct
22 Correct 1 ms 512 KB Output is correct
23 Correct 1 ms 512 KB Output is correct
24 Correct 2 ms 512 KB Output is correct
25 Correct 1 ms 512 KB Output is correct
26 Correct 1 ms 512 KB Output is correct
27 Correct 2 ms 512 KB Output is correct
28 Correct 1 ms 512 KB Output is correct
29 Correct 2 ms 512 KB Output is correct
30 Correct 1 ms 512 KB Output is correct
31 Correct 1 ms 512 KB Output is correct
32 Correct 1 ms 512 KB Output is correct
33 Correct 1 ms 512 KB Output is correct
34 Correct 309 ms 24896 KB Output is correct
35 Correct 336 ms 24568 KB Output is correct
36 Correct 330 ms 24056 KB Output is correct
37 Correct 336 ms 24568 KB Output is correct
38 Correct 325 ms 24696 KB Output is correct
39 Correct 317 ms 24596 KB Output is correct
40 Correct 343 ms 26104 KB Output is correct
41 Correct 318 ms 24952 KB Output is correct
42 Correct 332 ms 25464 KB Output is correct
43 Correct 364 ms 26232 KB Output is correct
44 Correct 358 ms 26232 KB Output is correct
45 Correct 350 ms 26232 KB Output is correct
46 Correct 332 ms 26232 KB Output is correct
47 Correct 340 ms 26360 KB Output is correct
48 Correct 334 ms 26232 KB Output is correct
49 Correct 391 ms 26360 KB Output is correct
50 Correct 348 ms 26360 KB Output is correct
51 Correct 349 ms 26364 KB Output is correct
52 Correct 226 ms 33400 KB Output is correct
53 Correct 233 ms 33432 KB Output is correct
54 Correct 220 ms 33656 KB Output is correct
55 Correct 218 ms 33144 KB Output is correct
56 Correct 338 ms 26232 KB Output is correct
57 Correct 301 ms 37112 KB Output is correct
58 Correct 321 ms 36984 KB Output is correct
59 Correct 381 ms 36728 KB Output is correct
60 Correct 293 ms 35064 KB Output is correct
61 Correct 311 ms 36088 KB Output is correct
62 Correct 306 ms 35448 KB Output is correct
63 Correct 312 ms 35576 KB Output is correct
64 Correct 372 ms 34424 KB Output is correct
65 Correct 313 ms 34936 KB Output is correct