oj.uz

Submission #937699

# Submission time Handle Problem Language Result Execution time Memory
937699 2024-03-04T11:35:12 Z borisAngelov Building 4 (JOI20_building4) C++17
11 / 100
 2000 ms 405632 KB 
#include <bits/stdc++.h>

using namespace std;

const int maxn = 4005;

int n;

int a[maxn];
int b[maxn];

bool dp[maxn][maxn][2];
tuple<int, int, int> prv[maxn][maxn][2];

void fastIO()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}

int main()
{
    fastIO();

    cin >> n;

    for (int i = 1; i <= 2 * n; ++i)
    {
        cin >> a[i];
    }

    for (int i = 1; i <= 2 * n; ++i)
    {
        cin >> b[i];
    }

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

    for (int pos = 1; pos <= 2 * n; ++pos)
    {
        for (int cntA = 0; cntA <= n; ++cntA)
        {
            if (b[pos] >= b[pos - 1])
            {
                dp[pos][cntA][1] |= dp[pos - 1][cntA][1];

                if (dp[pos - 1][cntA][1] == true)
                {
                    prv[pos][cntA][1] = make_tuple(pos - 1, cntA, 1);
                }
            }

            if (b[pos] >= a[pos - 1])
            {
                dp[pos][cntA][1] |= dp[pos - 1][cntA][0];

                if (dp[pos - 1][cntA][0] == true)
                {
                    prv[pos][cntA][1] = make_tuple(pos - 1, cntA, 0);
                }
            }

            if (a[pos] >= a[pos - 1] && cntA >= 1)
            {
                dp[pos][cntA][0] |= dp[pos - 1][cntA - 1][0];

                if (dp[pos - 1][cntA - 1][0] == true)
                {
                    prv[pos][cntA][0] = make_tuple(pos - 1, cntA - 1, 0);
                }
            }

            if (a[pos] >= b[pos - 1] && cntA >= 1)
            {
                dp[pos][cntA][0] |= dp[pos - 1][cntA - 1][1];

                if (dp[pos - 1][cntA - 1][1] == true)
                {
                    prv[pos][cntA][0] = make_tuple(pos - 1, cntA - 1, 1);
                }
            }
        }
    }

    bool hasAns = (dp[2 * n][n][0] == true || dp[2 * n][n][1] == true);

    if (hasAns == false)
    {
        cout << -1 << endl;
    }
    else
    {
        int pos = 2 * n;
        int curr = (dp[2 * n][n][0] == true ? 0 : 1);
        int cntA = n;

        stack<char> result;

        while (pos >= 1)
        {
            result.push(char(curr + 'A'));
            tie(pos, cntA, curr) = prv[pos][cntA][curr];
        }

        while (!result.empty())
        {
            cout << result.top();
            result.pop();
        }

        cout << endl;
    }

    return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4696 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 25 ms 33384 KB Output is correct
6 Correct 50 ms 116576 KB Output is correct
7 Correct 33 ms 110772 KB Output is correct
8 Correct 76 ms 210988 KB Output is correct
9 Correct 63 ms 185632 KB Output is correct
10 Correct 57 ms 190924 KB Output is correct
11 Correct 36 ms 120536 KB Output is correct
12 Correct 45 ms 126036 KB Output is correct
13 Correct 44 ms 123984 KB Output is correct
14 Correct 103 ms 256336 KB Output is correct
15 Correct 77 ms 213388 KB Output is correct
16 Correct 71 ms 168572 KB Output is correct
17 Correct 71 ms 198992 KB Output is correct
18 Correct 43 ms 124192 KB Output is correct
19 Correct 45 ms 125972 KB Output is correct
20 Correct 46 ms 124256 KB Output is correct
21 Correct 44 ms 127884 KB Output is correct
22 Correct 100 ms 255312 KB Output is correct
23 Correct 76 ms 207668 KB Output is correct
24 Correct 90 ms 256284 KB Output is correct
25 Correct 64 ms 187568 KB Output is correct
26 Correct 63 ms 189012 KB Output is correct
27 Correct 83 ms 258056 KB Output is correct
28 Correct 49 ms 152732 KB Output is correct
29 Correct 65 ms 174188 KB Output is correct
30 Correct 53 ms 148280 KB Output is correct
31 Correct 59 ms 165676 KB Output is correct
32 Correct 42 ms 140836 KB Output is correct
33 Correct 59 ms 165732 KB Output is correct

Subtask #2
0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4696 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 25 ms 33384 KB Output is correct
6 Correct 50 ms 116576 KB Output is correct
7 Correct 33 ms 110772 KB Output is correct
8 Correct 76 ms 210988 KB Output is correct
9 Correct 63 ms 185632 KB Output is correct
10 Correct 57 ms 190924 KB Output is correct
11 Correct 36 ms 120536 KB Output is correct
12 Correct 45 ms 126036 KB Output is correct
13 Correct 44 ms 123984 KB Output is correct
14 Correct 103 ms 256336 KB Output is correct
15 Correct 77 ms 213388 KB Output is correct
16 Correct 71 ms 168572 KB Output is correct
17 Correct 71 ms 198992 KB Output is correct
18 Correct 43 ms 124192 KB Output is correct
19 Correct 45 ms 125972 KB Output is correct
20 Correct 46 ms 124256 KB Output is correct
21 Correct 44 ms 127884 KB Output is correct
22 Correct 100 ms 255312 KB Output is correct
23 Correct 76 ms 207668 KB Output is correct
24 Correct 90 ms 256284 KB Output is correct
25 Correct 64 ms 187568 KB Output is correct
26 Correct 63 ms 189012 KB Output is correct
27 Correct 83 ms 258056 KB Output is correct
28 Correct 49 ms 152732 KB Output is correct
29 Correct 65 ms 174188 KB Output is correct
30 Correct 53 ms 148280 KB Output is correct
31 Correct 59 ms 165676 KB Output is correct
32 Correct 42 ms 140836 KB Output is correct
33 Correct 59 ms 165732 KB Output is correct
34 Execution timed out 2076 ms 405632 KB Time limit exceeded
35 Halted 0 ms 0 KB -