oj.uz

Submission #383166

# Submission time Handle Problem Language Result Execution time Memory
383166 2021-03-29T01:02:07 Z timmyfeng Building 4 (JOI20_building4) C++17
100 / 100
 281 ms 44512 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 1000000;

int height[N][2], low[N][2], high[N][2];

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;

    for (int i = 0; i < 2; ++i) {
        for (int j = 0; j < 2 * n; ++j) {
            cin >> height[j][i];
        }
    }

    low[0][0] = high[0][0] = 0;
    low[0][1] = high[0][1] = 1;

    for (int i = 1; i < 2 * n; ++i) {
        for (int j = 0; j < 2; ++j) {
            low[i][j] = N, high[i][j] = -N;
            for (int k = 0; k < 2; ++k) {
                if (low[i - 1][k] <= high[i - 1][k] && height[i][j] >= height[i - 1][k]) {
                    low[i][j] = min(low[i][j], low[i - 1][k] + j);
                    high[i][j] = max(high[i][j], high[i - 1][k] + j);
                }
            }
        }
    }

    int i = 2 * n - 1, j;
    if (low[2 * n - 1][0] <= n && n <= high[2 * n - 1][0]) {
        j = 0;
    } else if (low[2 * n - 1][1] <= n && n <= high[2 * n - 1][1]) {
        j = 1;
    } else {
        cout << -1 << "\n";
        exit(0);
    }

    string ans;
    while (i >= 0) {
        ans.push_back(j == 0 ? 'A' : 'B');
        n -= j, --i;
        j = low[i][1] <= n && n <= high[i][1] && height[i][1] <= height[i + 1][j];
    }
    reverse(ans.begin(), ans.end());

    cout << ans << "\n";
}

Subtask #1
11.0 / 11.0

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

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 2 ms 492 KB Output is correct
6 Correct 2 ms 492 KB Output is correct
7 Correct 2 ms 492 KB Output is correct
8 Correct 2 ms 492 KB Output is correct
9 Correct 2 ms 492 KB Output is correct
10 Correct 2 ms 492 KB Output is correct
11 Correct 2 ms 492 KB Output is correct
12 Correct 2 ms 492 KB Output is correct
13 Correct 2 ms 492 KB Output is correct
14 Correct 2 ms 492 KB Output is correct
15 Correct 2 ms 492 KB Output is correct
16 Correct 2 ms 492 KB Output is correct
17 Correct 2 ms 492 KB Output is correct
18 Correct 3 ms 492 KB Output is correct
19 Correct 2 ms 492 KB Output is correct
20 Correct 2 ms 492 KB Output is correct
21 Correct 2 ms 492 KB Output is correct
22 Correct 2 ms 492 KB Output is correct
23 Correct 2 ms 636 KB Output is correct
24 Correct 2 ms 492 KB Output is correct
25 Correct 2 ms 492 KB Output is correct
26 Correct 2 ms 492 KB Output is correct
27 Correct 2 ms 492 KB Output is correct
28 Correct 2 ms 492 KB Output is correct
29 Correct 2 ms 492 KB Output is correct
30 Correct 2 ms 492 KB Output is correct
31 Correct 2 ms 492 KB Output is correct
32 Correct 2 ms 492 KB Output is correct
33 Correct 2 ms 492 KB Output is correct
34 Correct 246 ms 38672 KB Output is correct
35 Correct 254 ms 42020 KB Output is correct
36 Correct 245 ms 41380 KB Output is correct
37 Correct 248 ms 42148 KB Output is correct
38 Correct 246 ms 42276 KB Output is correct
39 Correct 249 ms 41380 KB Output is correct
40 Correct 261 ms 41696 KB Output is correct
41 Correct 243 ms 42404 KB Output is correct
42 Correct 263 ms 43940 KB Output is correct
43 Correct 273 ms 31072 KB Output is correct
44 Correct 266 ms 31072 KB Output is correct
45 Correct 265 ms 30944 KB Output is correct
46 Correct 250 ms 30944 KB Output is correct
47 Correct 257 ms 44384 KB Output is correct
48 Correct 256 ms 44256 KB Output is correct
49 Correct 262 ms 38984 KB Output is correct
50 Correct 281 ms 44384 KB Output is correct
51 Correct 269 ms 44512 KB Output is correct
52 Correct 190 ms 33504 KB Output is correct
53 Correct 189 ms 33504 KB Output is correct
54 Correct 179 ms 33504 KB Output is correct
55 Correct 182 ms 33248 KB Output is correct
56 Correct 259 ms 28968 KB Output is correct
57 Correct 223 ms 40288 KB Output is correct
58 Correct 238 ms 40544 KB Output is correct
59 Correct 230 ms 40572 KB Output is correct
60 Correct 219 ms 38564 KB Output is correct
61 Correct 235 ms 40944 KB Output is correct
62 Correct 227 ms 40544 KB Output is correct
63 Correct 234 ms 41056 KB Output is correct
64 Correct 222 ms 39588 KB Output is correct
65 Correct 237 ms 41072 KB Output is correct