oj.uz

Submission #211890

# Submission time Handle Problem Language Result Execution time Memory
211890 2020-03-21T15:17:48 Z jk89 Building 4 (JOI20_building4) C++14
100 / 100
 436 ms 31352 KB 
#include <cstdio>
#include <algorithm>
#include <vector>

using namespace std;

#define f first
#define s second

const int MAXN = 1e6 + 3;
const int INF = 1e9 + 3;

int t[MAXN][2];
pair<int, int> dp[MAXN][2];
bool ans[MAXN];
int a = 0, b = 0, akt;

bool possible(int wym, int ind) {
    if (dp[ind][wym].f == INF)
        return false;
    if (t[ind][wym] > t[ind + 1][akt])
        return false;
    return b - a >= dp[ind][wym].f && b - a <= dp[ind][wym].s;
}

void check(int ind, int wym) {
    if (abs(dp[ind][wym].f - INF) == 1)
        dp[ind][wym].f = INF;
    if (abs(dp[ind][wym].s + INF) == 1)
        dp[ind][wym].s = -INF;
}

int main() {
    int n;
    scanf("%d", &n);
    n *= 2;
    for (int i = 0; i < 2; i++) {
        for (int j = 1; j <= n; j++)
            scanf("%d", &t[j][i]);
    }
    for (int i = 1; i <= n; i++) {
        dp[i][0] = dp[i][1] = {INF, -INF};
        if (t[i - 1][0] <= t[i][0]) {
            dp[i][0] = dp[i - 1][0];
            dp[i][0].f++;
            dp[i][0].s++;
        }
        if (t[i - 1][1] <= t[i][0]) {
            dp[i][0].f = min(dp[i][0].f, dp[i - 1][1].f + 1);
            dp[i][0].s = max(dp[i][0].s, dp[i - 1][1].s + 1);
        }

        if (t[i - 1][0] <= t[i][1]) {
            dp[i][1] = dp[i - 1][0];
            dp[i][1].f--;
            dp[i][1].s--;
        }
        if (t[i - 1][1] <= t[i][1]) {
            dp[i][1].f = min(dp[i][1].f, dp[i - 1][1].f - 1);
            dp[i][1].s = max(dp[i][1].s, dp[i - 1][1].s - 1);
        }

        check(i, 0);
        check(i, 1);
    }
    if (dp[n][0].f <= 0 && dp[n][0].s >= 0) {
        a++;
        akt = 0;
    }
    else if (dp[n][1].f <= 0 && dp[n][1].s >= 0) {
        b++;
        akt = 1;
        ans[n] = true;
    }
    else {
        printf("-1");
        return 0;
    }
    for (int i = n; i > 1; i--) {
        if (possible(0, i - 1)) {
            a++;
            akt = 0;
        }
        else {
            b++;
            akt = 1;
            ans[i - 1] = true;
        }
    }
    for (int i = 1; i <= n; i++)
        printf(ans[i] ? "B" : "A");
    return 0;
}

Compilation message

building4.cpp: In function 'int main()':
building4.cpp:35:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~
building4.cpp:39:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d", &t[j][i]);
             ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 6 ms 512 KB Output is correct
6 Correct 6 ms 512 KB Output is correct
7 Correct 6 ms 512 KB Output is correct
8 Correct 6 ms 512 KB Output is correct
9 Correct 6 ms 512 KB Output is correct
10 Correct 6 ms 512 KB Output is correct
11 Correct 6 ms 512 KB Output is correct
12 Correct 6 ms 512 KB Output is correct
13 Correct 6 ms 440 KB Output is correct
14 Correct 6 ms 512 KB Output is correct
15 Correct 6 ms 512 KB Output is correct
16 Correct 6 ms 512 KB Output is correct
17 Correct 6 ms 456 KB Output is correct
18 Correct 7 ms 512 KB Output is correct
19 Correct 7 ms 512 KB Output is correct
20 Correct 7 ms 496 KB Output is correct
21 Correct 7 ms 512 KB Output is correct
22 Correct 6 ms 384 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 6 ms 512 KB Output is correct
25 Correct 6 ms 384 KB Output is correct
26 Correct 6 ms 512 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 6 ms 384 KB Output is correct
29 Correct 6 ms 384 KB Output is correct
30 Correct 6 ms 384 KB Output is correct
31 Correct 6 ms 512 KB Output is correct
32 Correct 6 ms 384 KB Output is correct
33 Correct 6 ms 512 KB Output is correct
34 Correct 407 ms 25356 KB Output is correct
35 Correct 403 ms 28024 KB Output is correct
36 Correct 401 ms 29888 KB Output is correct
37 Correct 416 ms 29544 KB Output is correct
38 Correct 369 ms 30200 KB Output is correct
39 Correct 362 ms 24440 KB Output is correct
40 Correct 391 ms 27644 KB Output is correct
41 Correct 338 ms 30712 KB Output is correct
42 Correct 396 ms 26872 KB Output is correct
43 Correct 436 ms 31232 KB Output is correct
44 Correct 429 ms 31224 KB Output is correct
45 Correct 431 ms 25976 KB Output is correct
46 Correct 399 ms 30712 KB Output is correct
47 Correct 390 ms 31352 KB Output is correct
48 Correct 382 ms 31352 KB Output is correct
49 Correct 394 ms 31224 KB Output is correct
50 Correct 419 ms 27896 KB Output is correct
51 Correct 423 ms 27644 KB Output is correct
52 Correct 304 ms 29048 KB Output is correct
53 Correct 308 ms 29304 KB Output is correct
54 Correct 286 ms 29112 KB Output is correct
55 Correct 286 ms 29052 KB Output is correct
56 Correct 387 ms 27316 KB Output is correct
57 Correct 332 ms 27256 KB Output is correct
58 Correct 338 ms 27388 KB Output is correct
59 Correct 340 ms 27384 KB Output is correct
60 Correct 330 ms 26196 KB Output is correct
61 Correct 342 ms 27744 KB Output is correct
62 Correct 337 ms 27512 KB Output is correct
63 Correct 334 ms 27768 KB Output is correct
64 Correct 326 ms 26872 KB Output is correct
65 Correct 346 ms 27640 KB Output is correct