oj.uz

답안 #637641

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
637641 2022-09-02T14:07:26 Z dxz05 건물 4 (JOI20_building4) C++14
100 / 100
 222 ms 61224 KB 
//#pragma GCC optimize("Ofast,O2,O3,unroll-loops")
//#pragma GCC target("avx2")

#include <bits/stdc++.h>

using namespace std;

void debug_out() { cerr << endl; }

template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << "[" << H << "]";
    debug_out(T...);
}

#ifdef dddxxz
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

#define SZ(s) ((int)s.size())
#define all(x) (x).begin(), (x).end()
#define lla(x) (x).rbegin(), (x).rend()
#define bpc(x) __builtin_popcount(x)
#define bpcll(x) __builtin_popcountll(x)
#define MP make_pair

clock_t startTime;

int getCurrentTime() {
    return int((double) (clock() - startTime) / CLOCKS_PER_SEC * 1000);
}

mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

typedef long long ll;
const int MOD = 998244353;
const int INF = 1000000101;
const long long LLINF = 1223372000000000555;
const int N = 1e6 + 3e2;

int a[N], b[N];
int dpl[N][2], pl[N][2];
int dpr[N][2], pr[N][2];

bool chmin(int &x, int y){
    if (x <= y) return false;
    x = y;
    return true;
}

bool chmax(int &x, int y){
    if (x >= y) return false;
    x = y;
    return true;
}

void solve(int TC) {
    int n;
    cin >> n;

    for (int i = 1; i <= 2 * n; i++) cin >> a[i];
    for (int i = 1; i <= 2 * n; i++) cin >> b[i];

    for (int i = 1; i <= 2 * n; i++){
        dpl[i][0] = dpl[i][1] = INF;
        dpr[i][0] = dpr[i][1] = -INF;
        pl[i][0] = pl[i][1] = -1;
        pr[i][0] = pr[i][1] = -1;
    }

    dpl[1][0] = 1;
    dpl[1][1] = 0;
    dpr[1][0] = 1;
    dpr[1][1] = 0;

    for (int i = 2; i <= 2 * n; i++){
        if (a[i] >= a[i - 1]){
            if (chmin(dpl[i][0], dpl[i - 1][0] + 1)) pl[i][0] = 0;
            if (chmax(dpr[i][0], dpr[i - 1][0] + 1)) pr[i][0] = 0;
        }
        if (a[i] >= b[i - 1]){
            if (chmin(dpl[i][0], dpl[i - 1][1] + 1)) pl[i][0] = 1;
            if (chmax(dpr[i][0], dpr[i - 1][1] + 1)) pr[i][0] = 1;
        }
        if (b[i] >= a[i - 1]){
            if (chmin(dpl[i][1], dpl[i - 1][0])) pl[i][1] = 0;
            if (chmax(dpr[i][1], dpr[i - 1][0])) pr[i][1] = 0;
        }
        if (b[i] >= b[i - 1]){
            if (chmin(dpl[i][1], dpl[i - 1][1])) pl[i][1] = 1;
            if (chmax(dpr[i][1], dpr[i - 1][1])) pr[i][1] = 1;
        }
    }

    int i = 2 * n;
    int x = -1;

    if (dpl[2 * n][0] <= n && n <= dpr[2 * n][0]) x = 0;
    if (dpl[2 * n][1] <= n && n <= dpr[2 * n][1]) x = 1;

    if (x == -1){
        cout << -1;
        return;
    }

    string s;

    if (x == 0){
        s += 'A';
        n--;
    } else {
        s += 'B';
    }

    while (i > 1){
        int y = pl[i][x];

        if (dpl[i - 1][y] <= n && n <= dpr[i - 1][y]){
            if (y == 0){
                s += 'A';
                n--;
            } else {
                s += 'B';
            }
            x = y;
            i--;
            continue;
        }

        y = pr[i][x];

        if (dpl[i - 1][y] <= n && n <= dpr[i - 1][y]){
            if (y == 0){
                s += 'A';
                n--;
            } else {
                s += 'B';
            }
            x = y;
            i--;
            continue;
        }

        assert(false);
    }

    reverse(all(s));

    cout << s << endl;

}

int main() {
    startTime = clock();
    ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);

#ifdef dddxxz
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif

    int TC = 1;
    //cin >> TC;

    for (int test = 1; test <= TC; test++) {
        //debug(test);
        //cout << "Case #" << test << ": ";
        solve(test);
    }

#ifdef dddxxz
    cerr << endl << "Time: " << getCurrentTime() << " ms" << endl;
#endif

    return 0;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 2 ms 468 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 468 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 1 ms 596 KB Output is correct
18 Correct 2 ms 596 KB Output is correct
19 Correct 2 ms 596 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 596 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 596 KB Output is correct
25 Correct 1 ms 480 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 512 KB Output is correct
29 Correct 1 ms 528 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 2 ms 480 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 1 ms 468 KB Output is correct

Subtask #2
89.0 / 89.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 2 ms 468 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 468 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 1 ms 596 KB Output is correct
18 Correct 2 ms 596 KB Output is correct
19 Correct 2 ms 596 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 596 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 596 KB Output is correct
25 Correct 1 ms 480 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 512 KB Output is correct
29 Correct 1 ms 528 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 2 ms 480 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 212 ms 57888 KB Output is correct
35 Correct 208 ms 56656 KB Output is correct
36 Correct 213 ms 55560 KB Output is correct
37 Correct 198 ms 56796 KB Output is correct
38 Correct 189 ms 56680 KB Output is correct
39 Correct 201 ms 56024 KB Output is correct
40 Correct 219 ms 60332 KB Output is correct
41 Correct 189 ms 57256 KB Output is correct
42 Correct 212 ms 59016 KB Output is correct
43 Correct 221 ms 60880 KB Output is correct
44 Correct 222 ms 60864 KB Output is correct
45 Correct 214 ms 60948 KB Output is correct
46 Correct 205 ms 60832 KB Output is correct
47 Correct 214 ms 59964 KB Output is correct
48 Correct 208 ms 59868 KB Output is correct
49 Correct 211 ms 60748 KB Output is correct
50 Correct 219 ms 60120 KB Output is correct
51 Correct 213 ms 60052 KB Output is correct
52 Correct 158 ms 49204 KB Output is correct
53 Correct 150 ms 49140 KB Output is correct
54 Correct 138 ms 49172 KB Output is correct
55 Correct 135 ms 48908 KB Output is correct
56 Correct 210 ms 61224 KB Output is correct
57 Correct 180 ms 55868 KB Output is correct
58 Correct 176 ms 56096 KB Output is correct
59 Correct 177 ms 56064 KB Output is correct
60 Correct 175 ms 53128 KB Output is correct
61 Correct 179 ms 56516 KB Output is correct
62 Correct 173 ms 55788 KB Output is correct
63 Correct 197 ms 56564 KB Output is correct
64 Correct 172 ms 54728 KB Output is correct
65 Correct 179 ms 56644 KB Output is correct