oj.uz

Submission #824984

# Submission time Handle Problem Language Result Execution time Memory
824984 2023-08-14T12:51:16 Z xink Building 4 (JOI20_building4) C++14
100 / 100
 645 ms 25900 KB 
#include <iostream>
#include <vector>
#include <utility>
#include <sstream>
#include <climits>
#include <cstring>
#include <algorithm>
#define ll long long
#define ld long double
using namespace std;
const ll mod = 1e9 + 7;
const int maxn = 5e5 + 5, maxn1 = 2e3 + 5;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
bool can_construct[maxn1][maxn1][2];
int arr[2 * maxn][2], dp_min[2 * maxn][2], dp_max[2 * maxn][2];

void solve()
{
    int n;
    cin >> n;
    for (int i = 0; i < 2 * n; i++)
    {
        cin >> arr[i][0];
    }
    for (int i = 0; i < 2 * n; i++)
    {
        cin >> arr[i][1];
    }
    dp_min[0][0] = 0, dp_max[0][0] = 0;
    dp_min[0][1] = 1, dp_max[0][1] = 1;
    for (int i = 1; i < 2 * n; i++)
    {
        for (int curr = 0; curr < 2; curr++)
        {
            dp_min[i][curr] = i + 1;
            for (int prev = 0; prev < 2; prev++)
            {
                if (arr[i][curr] >= arr[i - 1][prev])
                {
                    dp_min[i][curr] = min(dp_min[i][curr], dp_min[i - 1][prev] + curr);
                    dp_max[i][curr] = max(dp_max[i][curr], dp_max[i - 1][prev] + curr);
                }
            }
        }
    }
    int curr_arr = -1, n_arr1 = n;
    for (int i = 0; i < 2; i++)
    {
        if (dp_min[2 * n - 1][i] <= n && n <= dp_max[2 * n - 1][i])
        {
            curr_arr = i;
            break;
        }
    }
    if (curr_arr == -1)
    {
        cout << -1;
        return;
    }
    string ans;
    for (int i = 2 * n - 1; i >= 0; i--)
    {
        ans += (curr_arr ? 'B' : 'A');
        for (int nxt = 0; nxt < 2; nxt++)
        {
            if (i > 0 && arr[i][curr_arr] >= arr[i - 1][nxt] && dp_min[i - 1][nxt] <= n_arr1 - curr_arr && n_arr1 - curr_arr <= dp_max[i - 1][nxt])
            {
                n_arr1 -= curr_arr;
                curr_arr = nxt;
                break;
            }
        }
    }
    reverse(ans.begin(), ans.end());
    cout << ans;
}

int main()
{
    // freopen("input_text", "r", stdin);
    // freopen("output_text", "w", stdout);
    // ios_base::sync_with_stdio(NULL); cin.tie(0); cout.tie(0);
    int t = 1;
    // cin >> t;
    while (t-- > 0)
        solve();
}

Subtask #1
11.0 / 11.0

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

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 4 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 2 ms 324 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 3 ms 340 KB Output is correct
12 Correct 3 ms 340 KB Output is correct
13 Correct 3 ms 340 KB Output is correct
14 Correct 3 ms 340 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 3 ms 356 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 3 ms 340 KB Output is correct
19 Correct 3 ms 340 KB Output is correct
20 Correct 2 ms 340 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 3 ms 340 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 2 ms 340 KB Output is correct
27 Correct 2 ms 340 KB Output is correct
28 Correct 2 ms 340 KB Output is correct
29 Correct 2 ms 340 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 2 ms 340 KB Output is correct
32 Correct 2 ms 340 KB Output is correct
33 Correct 2 ms 340 KB Output is correct
34 Correct 550 ms 23404 KB Output is correct
35 Correct 572 ms 23996 KB Output is correct
36 Correct 576 ms 23648 KB Output is correct
37 Correct 522 ms 24032 KB Output is correct
38 Correct 528 ms 24028 KB Output is correct
39 Correct 500 ms 24240 KB Output is correct
40 Correct 559 ms 25736 KB Output is correct
41 Correct 519 ms 24640 KB Output is correct
42 Correct 541 ms 25092 KB Output is correct
43 Correct 596 ms 25776 KB Output is correct
44 Correct 645 ms 25880 KB Output is correct
45 Correct 580 ms 25856 KB Output is correct
46 Correct 563 ms 25780 KB Output is correct
47 Correct 561 ms 25900 KB Output is correct
48 Correct 553 ms 25840 KB Output is correct
49 Correct 562 ms 25848 KB Output is correct
50 Correct 591 ms 25840 KB Output is correct
51 Correct 580 ms 25772 KB Output is correct
52 Correct 325 ms 25848 KB Output is correct
53 Correct 328 ms 25852 KB Output is correct
54 Correct 329 ms 25844 KB Output is correct
55 Correct 318 ms 25844 KB Output is correct
56 Correct 606 ms 25892 KB Output is correct
57 Correct 488 ms 25744 KB Output is correct
58 Correct 473 ms 25844 KB Output is correct
59 Correct 501 ms 25864 KB Output is correct
60 Correct 426 ms 24268 KB Output is correct
61 Correct 473 ms 25840 KB Output is correct
62 Correct 466 ms 25684 KB Output is correct
63 Correct 463 ms 25836 KB Output is correct
64 Correct 479 ms 24944 KB Output is correct
65 Correct 493 ms 25824 KB Output is correct