oj.uz

답안 #212330

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
212330 2020-03-22T17:22:49 Z 4fecta 건물 4 (JOI20_building4) C++14
100 / 100
 460 ms 33812 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

#define ll long long
#define ld long double
#define pii pair<int, int>
#define f first
#define s second
#define readl(_s) getline(cin, (_s));
#define boost() cin.tie(0); cin.sync_with_stdio(0)

const int MN = 1000005;

int n, a[MN][2], mn[MN][2], mx[MN][2], valid[MN][2];
char ans[MN];

int main() {
    boost();

    memset(mn, 0x3f, sizeof(mn));
    cin >> n;
    for (int j = 0; j < 2; j++) for (int i = 1; i <= 2 * n; i++) cin >> a[i][j];
    valid[1][0] = 1;
    valid[1][1] = 1;
    mn[1][0] = mx[1][0] = 0;
    mn[1][1] = mx[1][1] = 1;
    for (int i = 2; i <= 2 * n; i++) {
        for (int j = 0; j < 2; j++) {
            for (int k = 0; k < 2; k++) {
                if (a[i][j] < a[i - 1][k] || !valid[i - 1][k]) continue;
                valid[i][j] = 1;
                mn[i][j] = min(mn[i][j], mn[i - 1][k] + j);
                mx[i][j] = max(mx[i][j], mx[i - 1][k] + j);
            }
        }
    }
    if (valid[2 * n][0] && mn[2 * n][0] <= n && mx[2 * n][0] >= n) {
        int j = 0, rem = n;
        for (int i = 2 * n; i > 0; i--) {
            ans[i] = 'A' + j;
            if (i == 1) break;
            rem -= j;
            if (a[i - 1][0] <= a[i][j] && mn[i - 1][0] <= rem && mx[i - 1][0] >= rem) j = 0;
            else j = 1;
        }
    } else if (valid[2 * n][1] && mn[2 * n][1] <= n && mx[2 * n][1] >= n) {
        int j = 1, rem = n;
        for (int i = 2 * n; i > 0; i--) {
            ans[i] = 'A' + j;
            if (i == 1) break;
            rem -= j;
            if (a[i - 1][0] <= a[i][j] && mn[i - 1][0] <= rem && mx[i - 1][0] >= rem) j = 0;
            else j = 1;
        }
    } else return 0 * printf("-1\n");
    for (int i = 1; i <= 2 * n; i++) printf("%c", ans[i]);

    return 0;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
89.0 / 89.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 8192 KB Output is correct
2 Correct 8 ms 8192 KB Output is correct
3 Correct 8 ms 8192 KB Output is correct
4 Correct 8 ms 8192 KB Output is correct
5 Correct 9 ms 8192 KB Output is correct
6 Correct 10 ms 8320 KB Output is correct
7 Correct 10 ms 8320 KB Output is correct
8 Correct 9 ms 8320 KB Output is correct
9 Correct 10 ms 8320 KB Output is correct
10 Correct 9 ms 8320 KB Output is correct
11 Correct 10 ms 8320 KB Output is correct
12 Correct 10 ms 8320 KB Output is correct
13 Correct 10 ms 8320 KB Output is correct
14 Correct 9 ms 8320 KB Output is correct
15 Correct 9 ms 8320 KB Output is correct
16 Correct 11 ms 8320 KB Output is correct
17 Correct 11 ms 8320 KB Output is correct
18 Correct 10 ms 8320 KB Output is correct
19 Correct 10 ms 8320 KB Output is correct
20 Correct 9 ms 8320 KB Output is correct
21 Correct 9 ms 8320 KB Output is correct
22 Correct 9 ms 8320 KB Output is correct
23 Correct 9 ms 8320 KB Output is correct
24 Correct 10 ms 8320 KB Output is correct
25 Correct 9 ms 8320 KB Output is correct
26 Correct 9 ms 8320 KB Output is correct
27 Correct 9 ms 8320 KB Output is correct
28 Correct 9 ms 8320 KB Output is correct
29 Correct 9 ms 8320 KB Output is correct
30 Correct 9 ms 8320 KB Output is correct
31 Correct 10 ms 8320 KB Output is correct
32 Correct 9 ms 8320 KB Output is correct
33 Correct 9 ms 8320 KB Output is correct
34 Correct 302 ms 16008 KB Output is correct
35 Correct 365 ms 31864 KB Output is correct
36 Correct 344 ms 31612 KB Output is correct
37 Correct 337 ms 31992 KB Output is correct
38 Correct 339 ms 31864 KB Output is correct
39 Correct 303 ms 31992 KB Output is correct
40 Correct 358 ms 33528 KB Output is correct
41 Correct 377 ms 32432 KB Output is correct
42 Correct 460 ms 32888 KB Output is correct
43 Correct 394 ms 33688 KB Output is correct
44 Correct 447 ms 33608 KB Output is correct
45 Correct 428 ms 33616 KB Output is correct
46 Correct 393 ms 33576 KB Output is correct
47 Correct 355 ms 33656 KB Output is correct
48 Correct 335 ms 33632 KB Output is correct
49 Correct 353 ms 33656 KB Output is correct
50 Correct 339 ms 33632 KB Output is correct
51 Correct 369 ms 33632 KB Output is correct
52 Correct 223 ms 33656 KB Output is correct
53 Correct 250 ms 33632 KB Output is correct
54 Correct 228 ms 33656 KB Output is correct
55 Correct 211 ms 33656 KB Output is correct
56 Correct 376 ms 33636 KB Output is correct
57 Correct 319 ms 33656 KB Output is correct
58 Correct 305 ms 33784 KB Output is correct
59 Correct 296 ms 33656 KB Output is correct
60 Correct 273 ms 32120 KB Output is correct
61 Correct 294 ms 33656 KB Output is correct
62 Correct 311 ms 33400 KB Output is correct
63 Correct 307 ms 33812 KB Output is correct
64 Correct 292 ms 32760 KB Output is correct
65 Correct 306 ms 33660 KB Output is correct