oj.uz

Submission #945240

# Submission time Handle Problem Language Result Execution time Memory
945240 2024-03-13T14:49:17 Z vjudge1 Building 4 (JOI20_building4) C++17
100 / 100
 184 ms 45132 KB 
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <deque>
#include <random>
 
using namespace std;
template<typename T1, typename T2> inline void chkmin(T1 &a, T2 b) {if (a > b) a = b;}
template<typename T1, typename T2> inline void chkmax(T1 &a, T2 b) {if (a < b) a = b;}
#define files(FILENAME) read(FILENAME); write(FILENAME)
#define read(FILENAME) freopen((FILENAME + ".in").c_str(), "r", stdin)
#define write(FILENAME) freopen((FILENAME + ".out").c_str(), "w", stdout)
#define all(c) (c).begin(), (c).end()
#define sz(c) (int)(c).size()
#define left left228
#define right right228
#define y1 y1228
#define mp make_pair
#define pb push_back
#define y2 y2228
#define rank rank228
using ll = long long;
using ld = long double; 
const string FILENAME = "input";
const int MAXN = 500228;

int n;
int a[2 * MAXN], b[2 * MAXN];
int L[2 * MAXN][2], R[2 * MAXN][2];

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    //read(FILENAME);
    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++) {
        L[i][0] = L[i][1] = 1e9;
        R[i][0] = R[i][1] = -1e9;
    }
    L[1][0] = 1;
    R[1][0] = 1;
    L[1][1] = 0;
    R[1][1] = 0;
    for (int i = 1; i < 2 * n; i++) {
        if (a[i] <= a[i + 1]) {
            chkmin(L[i + 1][0], L[i][0] + 1);
            chkmax(R[i + 1][0], R[i][0] + 1);
        }
        if (a[i] <= b[i + 1]) {
            chkmin(L[i + 1][1], L[i][0]);
            chkmax(R[i + 1][1], R[i][0]);
        }
        if (b[i] <= a[i + 1]) {
            chkmin(L[i + 1][0], L[i][1] + 1);
            chkmax(R[i + 1][0], R[i][1] + 1);
        }
        if (b[i] <= b[i + 1]) {
            chkmin(L[i + 1][1], L[i][1]);
            chkmax(R[i + 1][1], R[i][1]);
        }
    }
    if (!(L[2 * n][0] <= n && R[2 * n][0] >= n) && !(L[2 * n][1] <= n && R[2 * n][1] >= n)) {
        cout << -1 << '\n';
        return 0;
    }
    int i = 2 * n;
    int cnt = n;
    int last = ((L[2 * n][0] <= n && R[2 * n][0] >= n) ? 0 : 1);
    string sol = "";
    while (i >= 2) {
        if (last == 0) {
            sol += 'A';
        } else {
            sol += 'B';
        }
        if (last == 0) {
            if (a[i - 1] <= a[i] && L[i - 1][0] + 1 <= cnt && cnt <= R[i - 1][0] + 1) {
                last = 0;
            } else if (b[i - 1] <= a[i] && L[i - 1][1] + 1 <= cnt && cnt <= R[i - 1][1] + 1) {
                last = 1;
            }
            cnt--;
        } else {
            if (a[i - 1] <= b[i] && L[i - 1][0] <= cnt && cnt <= R[i - 1][0]) {
                last = 0;
            } else if (b[i - 1] <= b[i] && L[i - 1][1] <= cnt && cnt <= R[i - 1][1]) {
                last = 1;
            }
        }
        i--;
    }
    if (last == 0) {
        sol += 'A';
    } else {
        sol += 'B';
    }
    reverse(all(sol));
    cout << sol << '\n';
    return 0;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6488 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6488 KB Output is correct
5 Correct 2 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 2 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 2 ms 6488 KB Output is correct
12 Correct 2 ms 6656 KB Output is correct
13 Correct 2 ms 6620 KB Output is correct
14 Correct 2 ms 6492 KB Output is correct
15 Correct 2 ms 6488 KB Output is correct
16 Correct 2 ms 6488 KB Output is correct
17 Correct 2 ms 6492 KB Output is correct
18 Correct 2 ms 6492 KB Output is correct
19 Correct 2 ms 6616 KB Output is correct
20 Correct 2 ms 6492 KB Output is correct
21 Correct 2 ms 6492 KB Output is correct
22 Correct 2 ms 6492 KB Output is correct
23 Correct 2 ms 6492 KB Output is correct
24 Correct 2 ms 6748 KB Output is correct
25 Correct 2 ms 6620 KB Output is correct
26 Correct 2 ms 6740 KB Output is correct
27 Correct 1 ms 6488 KB Output is correct
28 Correct 2 ms 7000 KB Output is correct
29 Correct 1 ms 6492 KB Output is correct
30 Correct 1 ms 6492 KB Output is correct
31 Correct 2 ms 6492 KB Output is correct
32 Correct 1 ms 6492 KB Output is correct
33 Correct 2 ms 6492 KB Output is correct
34 Correct 162 ms 40972 KB Output is correct
35 Correct 161 ms 41744 KB Output is correct
36 Correct 160 ms 41384 KB Output is correct
37 Correct 160 ms 41784 KB Output is correct
38 Correct 148 ms 41824 KB Output is correct
39 Correct 184 ms 40972 KB Output is correct
40 Correct 167 ms 43144 KB Output is correct
41 Correct 148 ms 41400 KB Output is correct
42 Correct 159 ms 42412 KB Output is correct
43 Correct 171 ms 43336 KB Output is correct
44 Correct 173 ms 43400 KB Output is correct
45 Correct 184 ms 43384 KB Output is correct
46 Correct 167 ms 43340 KB Output is correct
47 Correct 164 ms 42408 KB Output is correct
48 Correct 167 ms 42824 KB Output is correct
49 Correct 160 ms 43080 KB Output is correct
50 Correct 180 ms 42600 KB Output is correct
51 Correct 178 ms 42608 KB Output is correct
52 Correct 118 ms 33424 KB Output is correct
53 Correct 117 ms 33612 KB Output is correct
54 Correct 104 ms 33612 KB Output is correct
55 Correct 107 ms 33344 KB Output is correct
56 Correct 165 ms 45132 KB Output is correct
57 Correct 135 ms 40012 KB Output is correct
58 Correct 138 ms 40240 KB Output is correct
59 Correct 140 ms 40012 KB Output is correct
60 Correct 130 ms 39440 KB Output is correct
61 Correct 140 ms 40456 KB Output is correct
62 Correct 140 ms 40108 KB Output is correct
63 Correct 135 ms 40648 KB Output is correct
64 Correct 134 ms 39788 KB Output is correct
65 Correct 164 ms 40444 KB Output is correct