oj.uz

Submission #682034

# Submission time Handle Problem Language Result Execution time Memory
682034 2023-01-15T10:39:40 Z ParsaS Building 4 (JOI20_building4) C++17
100 / 100
 213 ms 45508 KB 
// In the name of God
//-MILY-
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
typedef long long ll;
const int N = 1e6 + 5;
int n, a[N], b[N];
pair<int, int> P[N][2];
bool mark[N];

pair<int, int> unite(pair<int, int> x, pair<int, int> y) {
    if (x.fi == -1)
        return y;
    if (y.fi == -1)
        return x;
    return mp(min(x.fi, y.fi), max(x.se, y.se));
}

void solve() {
    cin >> n;
    int m = n;
    n *= 2;
    for (int i = 0; i < n; i++)
        cin >> a[i];
    for (int i = 0; i < n; i++)
        cin >> b[i];
    P[0][0] = mp(1, 1);
    P[0][1] = mp(0, 0);
    for (int i = 1; i < n; i++) {
        int x = a[i], y = b[i];
        int xp = a[i - 1], yp = b[i - 1];
        P[i][0] = P[i][1] = mp(-1, -1);
        if (P[i - 1][0].fi != -1) {
            if (x >= xp) {
                P[i][0] = P[i - 1][0];
            }
            if (y >= xp)
                P[i][1] = P[i - 1][0];
        }
        if (P[i - 1][1].fi != -1) {
            if (x >= yp) {
                P[i][0] = unite(P[i][0], P[i - 1][1]);
            }
            if (y >= yp)
                P[i][1] = unite(P[i][1], P[i - 1][1]);
        }
        if (P[i][0].fi != -1) {
            P[i][0].fi++;
            P[i][0].se++;
        }
    }
    pair<int, int> res = unite(P[n - 1][0], P[n - 1][1]);
    if (m < res.fi || m > res.se) {
        cout << -1 << '\n';
        return;
    }
    string ans;
    bool x = false;
    if (m >= P[n - 1][1].fi && m <= P[n - 1][1].se) {
        x = true;
    }
    int i = n - 1;
    while (i > 0) {
        ans += char(x + 'A');
        m -= !x;
        int val = x ? b[i] : a[i];
        if (a[i - 1] <= val && m >= P[i - 1][0].fi && m <= P[i - 1][0].se)
            x = false;
        else if (b[i - 1] <= val && m >= P[i - 1][1].fi && m <= P[i - 1][1].se)
            x = true;
        i--;
    }
    ans += char(x + 'A');
    reverse(ans.begin(), ans.end());
    cout << ans << '\n';
}
int32_t main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    solve();
    return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 520 KB Output is correct
7 Correct 1 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 408 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 2 ms 472 KB Output is correct
14 Correct 1 ms 476 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 2 ms 456 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 476 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 476 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 424 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 1 ms 476 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 384 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 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 520 KB Output is correct
7 Correct 1 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 408 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 2 ms 472 KB Output is correct
14 Correct 1 ms 476 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 2 ms 456 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 476 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 476 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 424 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 1 ms 476 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 200 ms 42464 KB Output is correct
35 Correct 206 ms 41960 KB Output is correct
36 Correct 200 ms 41360 KB Output is correct
37 Correct 193 ms 42168 KB Output is correct
38 Correct 188 ms 42188 KB Output is correct
39 Correct 185 ms 41316 KB Output is correct
40 Correct 201 ms 44744 KB Output is correct
41 Correct 190 ms 42348 KB Output is correct
42 Correct 202 ms 43820 KB Output is correct
43 Correct 202 ms 45252 KB Output is correct
44 Correct 210 ms 45232 KB Output is correct
45 Correct 208 ms 45272 KB Output is correct
46 Correct 196 ms 45288 KB Output is correct
47 Correct 202 ms 44396 KB Output is correct
48 Correct 196 ms 44260 KB Output is correct
49 Correct 198 ms 45024 KB Output is correct
50 Correct 209 ms 44396 KB Output is correct
51 Correct 206 ms 44392 KB Output is correct
52 Correct 137 ms 33504 KB Output is correct
53 Correct 147 ms 33520 KB Output is correct
54 Correct 150 ms 33536 KB Output is correct
55 Correct 129 ms 33168 KB Output is correct
56 Correct 205 ms 45508 KB Output is correct
57 Correct 192 ms 40300 KB Output is correct
58 Correct 213 ms 40408 KB Output is correct
59 Correct 179 ms 40588 KB Output is correct
60 Correct 165 ms 38476 KB Output is correct
61 Correct 179 ms 40900 KB Output is correct
62 Correct 174 ms 40516 KB Output is correct
63 Correct 176 ms 40908 KB Output is correct
64 Correct 178 ms 39496 KB Output is correct
65 Correct 173 ms 40888 KB Output is correct