oj.uz

Submission #702736

# Submission time Handle Problem Language Result Execution time Memory
702736 2023-02-25T01:54:02 Z LittleCube Building 4 (JOI20_building4) C++17
100 / 100
 236 ms 45532 KB 
#include <bits/stdc++.h>
#define pii pair<int, int>
#define F first
#define S second
using namespace std;

int N, A[1000006], B[1000006];
const pii emp = pii(0, -1);
pii dp[1000006][2];

pii operator+(pii p, int i)
{
    return pii(p.F + i, p.S + i);
}

pii merge(pii p1, pii p2)
{
    if (p1.S < p1.F)
        return p2;
    if (p2.S < p2.F)
        return p1;
    assert(max(p1.S, p2.S) - min(p1.F, p2.F) + 1 <= p1.S + p2.S - p1.F - p2.F + 2);
    return pii(min(p1.F, p2.F), max(p1.S, p2.S));
}

signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    cin >> N;
    for (int i = 1; i <= 2 * N; i++)
        cin >> A[i];
    for (int i = 1; i <= 2 * N; i++)
        cin >> B[i];
    for (int i = 0; i <= 2 * N; i++)
        dp[i][0] = dp[i][1] = emp;
    dp[0][0] = pii(0, 0);
    for (int i = 1; i <= 2 * N; i++)
    {
        if (A[i - 1] <= A[i])
            dp[i][0] = merge(dp[i][0], dp[i - 1][0] + 1);
        if (B[i - 1] <= A[i])
            dp[i][0] = merge(dp[i][0], dp[i - 1][1] + 1);
        if (A[i - 1] <= B[i])
            dp[i][1] = merge(dp[i][1], dp[i - 1][0]);
        if (B[i - 1] <= B[i])
            dp[i][1] = merge(dp[i][1], dp[i - 1][1]);
    }
    string ans;
    int cur = N, i = 2 * N, j = -1;
    if (dp[i][0].F <= cur && cur <= dp[i][0].S)
        j = 0;
    if (dp[i][1].F <= cur && cur <= dp[i][1].S)
        j = 1;
    if (j < 0)
    {
        cout << -1 << '\n';
        return 0;
    }
    while (i)
    {
        ans.push_back(j == 0 ? 'A' : 'B');
        if (j == 0)
        {
            cur--;
            if (A[i - 1] <= A[i] && dp[i - 1][0].F <= cur && cur <= dp[i - 1][0].S)
                i--, j = 0;
            else
                i--, j = 1;
        }
        else
        {
            if (A[i - 1] <= B[i] && dp[i - 1][0].F <= cur && cur <= dp[i - 1][0].S)
                i--, j = 0;
            else
                i--, j = 1;
        }
    }
    reverse(ans.begin(), ans.end());
    cout << ans << '\n';
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 420 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 476 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 2 ms 480 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 2 ms 420 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 480 KB Output is correct
24 Correct 1 ms 480 KB Output is correct
25 Correct 2 ms 472 KB Output is correct
26 Correct 1 ms 424 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 1 ms 480 KB Output is correct
30 Correct 1 ms 468 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 468 KB Output is correct

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 420 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 476 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 2 ms 480 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 2 ms 420 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 480 KB Output is correct
24 Correct 1 ms 480 KB Output is correct
25 Correct 2 ms 472 KB Output is correct
26 Correct 1 ms 424 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 1 ms 480 KB Output is correct
30 Correct 1 ms 468 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 468 KB Output is correct
34 Correct 208 ms 42524 KB Output is correct
35 Correct 211 ms 42056 KB Output is correct
36 Correct 200 ms 41344 KB Output is correct
37 Correct 208 ms 42112 KB Output is correct
38 Correct 205 ms 42120 KB Output is correct
39 Correct 193 ms 41404 KB Output is correct
40 Correct 206 ms 44700 KB Output is correct
41 Correct 236 ms 42256 KB Output is correct
42 Correct 210 ms 43812 KB Output is correct
43 Correct 218 ms 45380 KB Output is correct
44 Correct 218 ms 45296 KB Output is correct
45 Correct 216 ms 45228 KB Output is correct
46 Correct 217 ms 45336 KB Output is correct
47 Correct 214 ms 44356 KB Output is correct
48 Correct 210 ms 44192 KB Output is correct
49 Correct 206 ms 44920 KB Output is correct
50 Correct 219 ms 44368 KB Output is correct
51 Correct 216 ms 44528 KB Output is correct
52 Correct 153 ms 33484 KB Output is correct
53 Correct 145 ms 33484 KB Output is correct
54 Correct 151 ms 33516 KB Output is correct
55 Correct 144 ms 33172 KB Output is correct
56 Correct 208 ms 45532 KB Output is correct
57 Correct 178 ms 40216 KB Output is correct
58 Correct 180 ms 40388 KB Output is correct
59 Correct 176 ms 40384 KB Output is correct
60 Correct 167 ms 38360 KB Output is correct
61 Correct 184 ms 40900 KB Output is correct
62 Correct 182 ms 40316 KB Output is correct
63 Correct 180 ms 40900 KB Output is correct
64 Correct 181 ms 39516 KB Output is correct
65 Correct 179 ms 40884 KB Output is correct