Submission #946750

# Submission time Handle Problem Language Result Execution time Memory
946750 2024-03-15T02:52:15 Z LOLOLO Building 4 (JOI20_building4) C++17
100 / 100
210 ms 45484 KB
#include <bits/stdc++.h>
typedef long long ll;

#define           f    first
#define           s    second
#define           pb    push_back
#define           ep    emplace
#define           eb    emplace_back
#define           lb    lower_bound
#define           ub    upper_bound
#define       all(x)    x.begin(), x.end()
#define      rall(x)    x.rbegin(), x.rend()
#define   uniquev(v)    sort(all(v)), (v).resize(unique(all(v)) - (v).begin())
#define     mem(f,x)    memset(f , x , sizeof(f))
#define        sz(x)    (int)(x).size()
#define  __lcm(a, b)    (1ll * ((a) / __gcd((a), (b))) * (b))
#define          mxx    *max_element
#define          mnn    *min_element
#define    cntbit(x)    __builtin_popcountll(x)

using namespace std;
const int N = 1e6 + 100;
int A[N][2], mx[N][2], mi[N][2];
int c[2] = {-1, 1};

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin >> n;
    int sz = n * 2;

    for (int i = 1; i <= sz; i++)
        cin >> A[i][0];

    for (int i = 1; i <= sz; i++)
        cin >> A[i][1];

    for (int i = 1; i <= sz; i++) {
        mx[i][0] = mx[i][1] = -1e9;
        mi[i][0] = mi[i][1] = 1e9;
    }

    mi[sz][0] = mx[sz][0] = -1;
    mi[sz][1] = mx[sz][1] = 1;

    for (int i = sz - 1; i >= 1; i--) {      
        for (int j = 0; j < 2; j++) {
            for (int k = 0; k < 2; k++) {
                if (A[i][j] <= A[i + 1][k]) {
                    mx[i][j] = max(mx[i][j], mx[i + 1][k] + c[j]);
                    mi[i][j] = min(mi[i][j], mi[i + 1][k] + c[j]);
                }
            }
        }
    }

    int x = 1, y = 0, all = 0;
    string ans;
    if (mi[x][y] > 0 || mx[x][y] < 0) {
        y = 1;
    }

    if (mi[x][y] > 0 || mx[x][y] < 0) {
        cout << -1 << '\n';
        return 0;
    }

    while (x <= sz) {
        if (y == 0) {
            ans += "A";
            all--;
        } else {
            ans += "B";
            all++;
        }

        if (x == sz)
            break;

        int t = 1;
        for (int k = 0; k < 2; k++) {
            if (A[x][y] <= A[x + 1][k]) {
                if (mi[x + 1][k] + all <= 0 && mx[x + 1][k] + all >= 0) {
                    t = k;
                    break;
                }
            }
        }
        x++;
        y = t;
    }

    cout << ans << '\n';
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4568 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 2 ms 4444 KB Output is correct
9 Correct 2 ms 4444 KB Output is correct
10 Correct 1 ms 4440 KB Output is correct
11 Correct 2 ms 4444 KB Output is correct
12 Correct 1 ms 4528 KB Output is correct
13 Correct 2 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 2 ms 4444 KB Output is correct
17 Correct 2 ms 4576 KB Output is correct
18 Correct 2 ms 4444 KB Output is correct
19 Correct 2 ms 4440 KB Output is correct
20 Correct 2 ms 4696 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct
22 Correct 1 ms 4444 KB Output is correct
23 Correct 1 ms 4444 KB Output is correct
24 Correct 2 ms 4444 KB Output is correct
25 Correct 1 ms 4444 KB Output is correct
26 Correct 1 ms 4444 KB Output is correct
27 Correct 1 ms 4444 KB Output is correct
28 Correct 1 ms 4444 KB Output is correct
29 Correct 2 ms 4564 KB Output is correct
30 Correct 1 ms 4444 KB Output is correct
31 Correct 1 ms 4444 KB Output is correct
32 Correct 1 ms 4444 KB Output is correct
33 Correct 2 ms 4696 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4568 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 2 ms 4444 KB Output is correct
9 Correct 2 ms 4444 KB Output is correct
10 Correct 1 ms 4440 KB Output is correct
11 Correct 2 ms 4444 KB Output is correct
12 Correct 1 ms 4528 KB Output is correct
13 Correct 2 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 2 ms 4444 KB Output is correct
17 Correct 2 ms 4576 KB Output is correct
18 Correct 2 ms 4444 KB Output is correct
19 Correct 2 ms 4440 KB Output is correct
20 Correct 2 ms 4696 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct
22 Correct 1 ms 4444 KB Output is correct
23 Correct 1 ms 4444 KB Output is correct
24 Correct 2 ms 4444 KB Output is correct
25 Correct 1 ms 4444 KB Output is correct
26 Correct 1 ms 4444 KB Output is correct
27 Correct 1 ms 4444 KB Output is correct
28 Correct 1 ms 4444 KB Output is correct
29 Correct 2 ms 4564 KB Output is correct
30 Correct 1 ms 4444 KB Output is correct
31 Correct 1 ms 4444 KB Output is correct
32 Correct 1 ms 4444 KB Output is correct
33 Correct 2 ms 4696 KB Output is correct
34 Correct 161 ms 42580 KB Output is correct
35 Correct 165 ms 43224 KB Output is correct
36 Correct 159 ms 42768 KB Output is correct
37 Correct 165 ms 43144 KB Output is correct
38 Correct 159 ms 43316 KB Output is correct
39 Correct 159 ms 42224 KB Output is correct
40 Correct 161 ms 44876 KB Output is correct
41 Correct 157 ms 43120 KB Output is correct
42 Correct 177 ms 44140 KB Output is correct
43 Correct 184 ms 45072 KB Output is correct
44 Correct 188 ms 45236 KB Output is correct
45 Correct 210 ms 45368 KB Output is correct
46 Correct 167 ms 45132 KB Output is correct
47 Correct 170 ms 44604 KB Output is correct
48 Correct 159 ms 44092 KB Output is correct
49 Correct 166 ms 44964 KB Output is correct
50 Correct 183 ms 44364 KB Output is correct
51 Correct 178 ms 43336 KB Output is correct
52 Correct 121 ms 33608 KB Output is correct
53 Correct 119 ms 33548 KB Output is correct
54 Correct 109 ms 33608 KB Output is correct
55 Correct 112 ms 33288 KB Output is correct
56 Correct 175 ms 45484 KB Output is correct
57 Correct 138 ms 40524 KB Output is correct
58 Correct 140 ms 40524 KB Output is correct
59 Correct 151 ms 40512 KB Output is correct
60 Correct 134 ms 39412 KB Output is correct
61 Correct 153 ms 41004 KB Output is correct
62 Correct 154 ms 40512 KB Output is correct
63 Correct 146 ms 41036 KB Output is correct
64 Correct 138 ms 40208 KB Output is correct
65 Correct 142 ms 41032 KB Output is correct