oj.uz

Submission #211508

# Submission time Handle Problem Language Result Execution time Memory
211508 2020-03-20T16:12:15 Z JustInCase Building 4 (JOI20_building4) C++17
100 / 100
 312 ms 26092 KB 
#include <bits/stdc++.h>

const int32_t MAX_N = 1e6;
const int32_t INF = 2e9;

int32_t dp[MAX_N + 5][2][2];

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

    int32_t n;
    std::cin >> n;

    n *= 2;

    std::vector< int32_t > a(n);
    for(int32_t i = 0; i < n; i++) {
        std::cin >> a[i];
    }

    std::vector< int32_t > b(n);
    for(int32_t i = 0; i < n; i++) {
        std::cin >> b[i];
    }

    dp[0][0][0] = 1;
    dp[0][0][1] = 1;
    dp[0][1][0] = 0;
    dp[0][1][1] = 0;

    for(int32_t i = 1; i < n; i++) {
        dp[i][0][0] = INF;
        dp[i][0][1] = -1;
        dp[i][1][0] = INF;
        dp[i][1][1] = -1;

        if(a[i - 1] <= a[i]) {
            dp[i][0][0] = std::min(dp[i][0][0], dp[i - 1][0][0] + 1);
            dp[i][0][1] = std::max(dp[i][0][1], dp[i - 1][0][1] + 1);
        }
        if(a[i - 1] <= b[i]) {
            dp[i][1][0] = std::min(dp[i][1][0], dp[i - 1][0][0]);
            dp[i][1][1] = std::max(dp[i][1][1], dp[i - 1][0][1]);
        }
        if(b[i - 1] <= a[i]) {
            dp[i][0][0] = std::min(dp[i][0][0], dp[i - 1][1][0] + 1);
            dp[i][0][1] = std::max(dp[i][0][1], dp[i - 1][1][1] + 1);
        }
        if(b[i - 1] <= b[i]) {
            dp[i][1][0] = std::min(dp[i][1][0], dp[i - 1][1][0]);
            dp[i][1][1] = std::max(dp[i][1][1], dp[i - 1][1][1]);
        }
    }

    int32_t cntA = 0, lastVal;
    std::string res;
    if(dp[n - 1][0][0] <= n / 2 && dp[n - 1][0][1] >= n / 2) {
        cntA = 1;
        lastVal = a[n - 1];
        res = "A";
    }
    else if(dp[n - 1][1][0] <= n / 2 && dp[n - 1][1][1] >= n / 2) {
        res = "B";
        lastVal = b[n - 1];
    }
    else {
        std::cout << -1 << '\n';
        return 0;
    }

    for(int32_t i = n - 2; i >= 0; i--) {
        if(a[i] <= lastVal && dp[i][0][0] <= n / 2 - cntA && dp[i][0][1] >= n / 2 - cntA) {
            res += 'A';
            cntA++;
            lastVal = a[i];
        }
        else {
            res += 'B';
            lastVal = b[i];
        }
    }

    std::reverse(res.begin(), res.end());
    std::cout << res << '\n';
}

Subtask #1
11.0 / 11.0

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

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 512 KB Output is correct
6 Correct 6 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 6 ms 512 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 7 ms 428 KB Output is correct
12 Correct 6 ms 512 KB Output is correct
13 Correct 6 ms 512 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 6 ms 384 KB Output is correct
16 Correct 6 ms 512 KB Output is correct
17 Correct 6 ms 512 KB Output is correct
18 Correct 6 ms 512 KB Output is correct
19 Correct 6 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 5 ms 512 KB Output is correct
24 Correct 6 ms 384 KB Output is correct
25 Correct 5 ms 512 KB Output is correct
26 Correct 5 ms 512 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 5 ms 384 KB Output is correct
29 Correct 5 ms 512 KB Output is correct
30 Correct 5 ms 384 KB Output is correct
31 Correct 5 ms 384 KB Output is correct
32 Correct 5 ms 384 KB Output is correct
33 Correct 5 ms 512 KB Output is correct
34 Correct 295 ms 23416 KB Output is correct
35 Correct 290 ms 24112 KB Output is correct
36 Correct 301 ms 23728 KB Output is correct
37 Correct 284 ms 24240 KB Output is correct
38 Correct 283 ms 24240 KB Output is correct
39 Correct 266 ms 24368 KB Output is correct
40 Correct 286 ms 25836 KB Output is correct
41 Correct 270 ms 24752 KB Output is correct
42 Correct 305 ms 25268 KB Output is correct
43 Correct 301 ms 26092 KB Output is correct
44 Correct 297 ms 25964 KB Output is correct
45 Correct 307 ms 25968 KB Output is correct
46 Correct 300 ms 25964 KB Output is correct
47 Correct 311 ms 25940 KB Output is correct
48 Correct 282 ms 25964 KB Output is correct
49 Correct 302 ms 26008 KB Output is correct
50 Correct 299 ms 25964 KB Output is correct
51 Correct 294 ms 25964 KB Output is correct
52 Correct 180 ms 25964 KB Output is correct
53 Correct 190 ms 25968 KB Output is correct
54 Correct 176 ms 25964 KB Output is correct
55 Correct 176 ms 25964 KB Output is correct
56 Correct 312 ms 25964 KB Output is correct
57 Correct 267 ms 25836 KB Output is correct
58 Correct 267 ms 25964 KB Output is correct
59 Correct 261 ms 26012 KB Output is correct
60 Correct 236 ms 24368 KB Output is correct
61 Correct 251 ms 25964 KB Output is correct
62 Correct 257 ms 25708 KB Output is correct
63 Correct 279 ms 26092 KB Output is correct
64 Correct 267 ms 25140 KB Output is correct
65 Correct 262 ms 25964 KB Output is correct