oj.uz

Submission #683982

# Submission time Handle Problem Language Result Execution time Memory
683982 2023-01-19T21:06:08 Z stevancv Building 4 (JOI20_building4) C++14
100 / 100
 261 ms 48068 KB 
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define sp ' '
#define en '\n'
#define smin(a, b) a = min(a, b)
#define smax(a, b) a = max(a, b)
using namespace std;
const int N = 1e6 + 2;
const int inf = 1e9;
int a[N][2], dpl[N][2], dpr[N][2], ans[N];
void Resi(int i, int j, int k) {
    if (i == 0) return;
    ans[i] = j;
    k -= j;
    if (dpl[i - 1][0] <= k && k <= dpr[i - 1][0] && a[i - 1][0] <= a[i][j]) Resi(i - 1, 0, k);
    else if (dpl[i - 1][1] <= k && k <= dpr[i - 1][1] && a[i - 1][1] <= a[i][j]) Resi(i - 1, 1, k);
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n; cin >> n;
    n = 2 * n;
    for (int i = 1; i <= n; i++) cin >> a[i][0];
    for (int i = 1; i <= n; i++) cin >> a[i][1];
    for (int i = 1; i <= n; i++) for (int j = 0; j < 2; j++) dpl[i][j] = inf, dpr[i][j] = -inf;
    dpl[1][0] = dpr[1][0] = 0;
    dpl[1][1] = dpr[1][1] = 1;
    for (int i = 2; i <= n; i++) {
        for (int j = 0; j < 2; j++) {
            for (int pj = 0; pj < 2; pj++) {
                if (a[i - 1][pj] > a[i][j]) continue;
                smin(dpl[i][j], dpl[i - 1][pj] + j);
                smax(dpr[i][j], dpr[i - 1][pj] + j);
            }
        }
    }
    if (dpl[n][0] <= n / 2 && n / 2 <= dpr[n][0]) Resi(n, 0, n / 2);
    else if (dpl[n][1] <= n / 2 && n / 2 <= dpr[n][1]) Resi(n, 1, n / 2);
    else {cout << -1; return 0;}
    for (int i = 1; i <= n; i++) {
        if (ans[i] == 0) cout << 'A';
        if (ans[i] == 1) cout << 'B';
    }
    cout << en;
    return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 328 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 2 ms 468 KB Output is correct
9 Correct 1 ms 428 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
13 Correct 2 ms 544 KB Output is correct
14 Correct 2 ms 416 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 1 ms 472 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 412 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 468 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 420 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 2 ms 468 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 2 ms 468 KB Output is correct
30 Correct 1 ms 472 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 1 ms 392 KB Output is correct

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 328 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 2 ms 468 KB Output is correct
9 Correct 1 ms 428 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
13 Correct 2 ms 544 KB Output is correct
14 Correct 2 ms 416 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 1 ms 472 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 412 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 468 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 420 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 2 ms 468 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 2 ms 468 KB Output is correct
30 Correct 1 ms 472 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 1 ms 392 KB Output is correct
34 Correct 205 ms 42428 KB Output is correct
35 Correct 237 ms 44700 KB Output is correct
36 Correct 261 ms 43804 KB Output is correct
37 Correct 230 ms 44652 KB Output is correct
38 Correct 235 ms 44712 KB Output is correct
39 Correct 220 ms 43824 KB Output is correct
40 Correct 226 ms 47520 KB Output is correct
41 Correct 202 ms 44908 KB Output is correct
42 Correct 226 ms 46412 KB Output is correct
43 Correct 233 ms 47972 KB Output is correct
44 Correct 248 ms 47976 KB Output is correct
45 Correct 234 ms 47924 KB Output is correct
46 Correct 220 ms 48016 KB Output is correct
47 Correct 230 ms 47016 KB Output is correct
48 Correct 223 ms 46920 KB Output is correct
49 Correct 239 ms 47712 KB Output is correct
50 Correct 248 ms 47172 KB Output is correct
51 Correct 246 ms 47172 KB Output is correct
52 Correct 163 ms 36260 KB Output is correct
53 Correct 166 ms 36280 KB Output is correct
54 Correct 155 ms 36244 KB Output is correct
55 Correct 152 ms 35960 KB Output is correct
56 Correct 226 ms 48068 KB Output is correct
57 Correct 199 ms 43084 KB Output is correct
58 Correct 202 ms 43124 KB Output is correct
59 Correct 202 ms 43212 KB Output is correct
60 Correct 179 ms 41164 KB Output is correct
61 Correct 190 ms 43596 KB Output is correct
62 Correct 190 ms 43080 KB Output is correct
63 Correct 198 ms 43712 KB Output is correct
64 Correct 202 ms 42208 KB Output is correct
65 Correct 219 ms 43812 KB Output is correct