oj.uz

답안 #894686

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
894686 2023-12-28T17:21:50 Z box 건물 4 (JOI20_building4) C++17
100 / 100
 201 ms 45396 KB 
#include <bits/stdc++.h>
using namespace std;

#define ar array
#define sz(v) int(std::size(v))
using i64 = long long;
using range = ar<int, 2>;

const range unit{-1, -1};

range shift(const range one, int c) {
    if (one == unit) return one;
    return {one[0] + c, one[1] + c};
}

range operator+(const range one, const range two) {
    if (one == unit) return two;
    if (two == unit) return one;
    return {min(one[0], two[0]), max(one[1], two[1])};
}

bool can(const range one, int x) {
    return one[0] <= x && one[1] >= x;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int N;
    cin >> N;
    int A[N * 2 + 1], B[N * 2 + 1];
    A[0] = B[0] = 0;
    for (int i = 1; i <= N * 2; i++) cin >> A[i];
    for (int i = 1; i <= N * 2; i++) cin >> B[i];
    /*
    auto solve = [&]() {
        ar<int, 2> dp{1, 0};
        for (int i = 1; i < N * 2; i++) {
            ar<int, 2> ndp{-(N * 2), -(N * 2)};
            if (A[i - 1] <= A[i]) ndp[0] = max(ndp[0], dp[0] + 1);
            if (B[i - 1] <= A[i]) ndp[0] = max(ndp[0], dp[1] + 1);
            if (A[i - 1] <= B[i]) ndp[1] = max(ndp[1], dp[0]);
            if (B[i - 1] <= B[i]) ndp[1] = max(ndp[1], dp[1]);
            dp = ndp;
        }
        return max(dp[0], dp[1]);
    };
    bool ok = 1;
    ok &= solve() >= N;
    swap(A, B);
    ok &= solve() >= N;
    cout << (ok ? "YES\n" : "NO\n");
    */
    range f[N * 2 + 1][2];
    f[0][0] = f[0][1] = {0, 0};
    for (int i = 1; i <= N * 2; i++) {
        f[i][0] = f[i][1] = unit;
        if (A[i - 1] <= A[i]) f[i][0] = f[i][0] + shift(f[i - 1][0], 1);
        if (B[i - 1] <= A[i]) f[i][0] = f[i][0] + shift(f[i - 1][1], 1);
        if (A[i - 1] <= B[i]) f[i][1] = f[i][1] + f[i - 1][0];
        if (B[i - 1] <= B[i]) f[i][1] = f[i][1] + f[i - 1][1];
    }
    for (int t : {0, 1}) if (can(f[N * 2][t], N)) {
        string S;
        int i = N * 2, c = N;
        while (i > 0) {
            S += char('A' + t);
            c -= t ^ 1;
            if (A[i - 1] <= (t ? B : A)[i] && can(f[i - 1][0], c)) {
                t = 0;
                i--;
            } else if (B[i - 1] <= (t ? B : A)[i] && can(f[i - 1][1], c)) {
                t = 1;
                i--;
            } else assert(false);
        }
        reverse(begin(S), end(S));
        cout << S << '\n';
        return 0;
    }
    cout << "-1\n";
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 456 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 556 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 600 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 600 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 600 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 2 ms 604 KB Output is correct

Subtask #2
89.0 / 89.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 456 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 556 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 600 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 600 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 600 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 2 ms 604 KB Output is correct
34 Correct 169 ms 42316 KB Output is correct
35 Correct 172 ms 41916 KB Output is correct
36 Correct 169 ms 41216 KB Output is correct
37 Correct 173 ms 42068 KB Output is correct
38 Correct 169 ms 42212 KB Output is correct
39 Correct 166 ms 41348 KB Output is correct
40 Correct 193 ms 44704 KB Output is correct
41 Correct 173 ms 42384 KB Output is correct
42 Correct 180 ms 43808 KB Output is correct
43 Correct 187 ms 45268 KB Output is correct
44 Correct 197 ms 45240 KB Output is correct
45 Correct 201 ms 45372 KB Output is correct
46 Correct 188 ms 45268 KB Output is correct
47 Correct 185 ms 44336 KB Output is correct
48 Correct 172 ms 44240 KB Output is correct
49 Correct 196 ms 45032 KB Output is correct
50 Correct 197 ms 44492 KB Output is correct
51 Correct 192 ms 44804 KB Output is correct
52 Correct 139 ms 33800 KB Output is correct
53 Correct 129 ms 33608 KB Output is correct
54 Correct 128 ms 33644 KB Output is correct
55 Correct 125 ms 33352 KB Output is correct
56 Correct 176 ms 45396 KB Output is correct
57 Correct 161 ms 40268 KB Output is correct
58 Correct 162 ms 40776 KB Output is correct
59 Correct 157 ms 40524 KB Output is correct
60 Correct 151 ms 38552 KB Output is correct
61 Correct 157 ms 40888 KB Output is correct
62 Correct 193 ms 40376 KB Output is correct
63 Correct 158 ms 41332 KB Output is correct
64 Correct 148 ms 39440 KB Output is correct
65 Correct 158 ms 40884 KB Output is correct