oj.uz

Submission #305085

# Submission time Handle Problem Language Result Execution time Memory
305085 2020-09-22T14:42:30 Z thuanqvbn03 Building 4 (JOI20_building4) C++17
100 / 100
 367 ms 105336 KB 
//thuanqvbn03
#include <bits/stdc++.h>

using namespace std;

const int MaxN = 1000005;

int n;
int a[MaxN][2];
bool Color[MaxN][2];
pair<int, int> dp[MaxN][2];

void DFS(int i, int j)
{
    if (Color[i][j])
    {
        return;
    }
    Color[i][j] = true;
    int Min = 1e9, Max = -1e9;
    if (a[i][j] <= a[i + 1][0])
    {
        DFS(i + 1, 0);
        Min = min(Min, dp[i + 1][0].first + 1);
        Max = max(Max, dp[i + 1][0].second + 1);
    }
    if (a[i][j] <= a[i + 1][1])
    {
        DFS(i + 1, 1);
        Min = min(Min, dp[i + 1][1].first);
        Max = max(Max, dp[i + 1][1].second);
    }
    dp[i][j] = make_pair(Min, Max);
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin >> n;
    n *= 2;
    for (int j = 0; j < 2; j++)
    {
        for (int i = 1; i <= n; i++)
        {
            cin >> a[i][j];
        }
    }
    Color[n][0] = Color[n][1] = 1;
    DFS(0, 0);
    if (dp[0][0].first > n / 2 || dp[0][0].first > dp[0][0].second)
    {
        cout << -1;
        return 0;
    }
    int pre = 0, cnt = n / 2;
    for (int i = 1; i <= n; i++)
    {
        if (a[i][0] >= a[i - 1][pre] && cnt - 1 >= dp[i][0].first && cnt - 1 <= dp[i][0].second)
        {
            cnt--;
            cout << 'A';
            pre = 0;
        }
        else
        {
            cout << 'B';
            pre = 1;
        }
    }
    return 0;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 768 KB Output is correct
7 Correct 1 ms 640 KB Output is correct
8 Correct 2 ms 640 KB Output is correct
9 Correct 2 ms 768 KB Output is correct
10 Correct 1 ms 640 KB Output is correct
11 Correct 2 ms 768 KB Output is correct
12 Correct 2 ms 768 KB Output is correct
13 Correct 2 ms 768 KB Output is correct
14 Correct 2 ms 768 KB Output is correct
15 Correct 2 ms 768 KB Output is correct
16 Correct 2 ms 768 KB Output is correct
17 Correct 2 ms 768 KB Output is correct
18 Correct 2 ms 768 KB Output is correct
19 Correct 2 ms 768 KB Output is correct
20 Correct 2 ms 768 KB Output is correct
21 Correct 2 ms 768 KB Output is correct
22 Correct 1 ms 768 KB Output is correct
23 Correct 1 ms 768 KB Output is correct
24 Correct 2 ms 768 KB Output is correct
25 Correct 1 ms 768 KB Output is correct
26 Correct 2 ms 768 KB Output is correct
27 Correct 2 ms 768 KB Output is correct
28 Correct 1 ms 768 KB Output is correct
29 Correct 2 ms 768 KB Output is correct
30 Correct 2 ms 768 KB Output is correct
31 Correct 2 ms 768 KB Output is correct
32 Correct 2 ms 640 KB Output is correct
33 Correct 2 ms 768 KB Output is correct
34 Correct 223 ms 8204 KB Output is correct
35 Correct 315 ms 97400 KB Output is correct
36 Correct 319 ms 95992 KB Output is correct
37 Correct 319 ms 97912 KB Output is correct
38 Correct 321 ms 97912 KB Output is correct
39 Correct 309 ms 98296 KB Output is correct
40 Correct 340 ms 104652 KB Output is correct
41 Correct 349 ms 100088 KB Output is correct
42 Correct 331 ms 101880 KB Output is correct
43 Correct 344 ms 105208 KB Output is correct
44 Correct 348 ms 105212 KB Output is correct
45 Correct 356 ms 105208 KB Output is correct
46 Correct 340 ms 105212 KB Output is correct
47 Correct 336 ms 105208 KB Output is correct
48 Correct 336 ms 105336 KB Output is correct
49 Correct 343 ms 105212 KB Output is correct
50 Correct 358 ms 105092 KB Output is correct
51 Correct 342 ms 105208 KB Output is correct
52 Correct 269 ms 105080 KB Output is correct
53 Correct 273 ms 105108 KB Output is correct
54 Correct 269 ms 105100 KB Output is correct
55 Correct 265 ms 105240 KB Output is correct
56 Correct 367 ms 105208 KB Output is correct
57 Correct 322 ms 104564 KB Output is correct
58 Correct 313 ms 105208 KB Output is correct
59 Correct 303 ms 105080 KB Output is correct
60 Correct 294 ms 98808 KB Output is correct
61 Correct 315 ms 105116 KB Output is correct
62 Correct 310 ms 103672 KB Output is correct
63 Correct 320 ms 105080 KB Output is correct
64 Correct 300 ms 101496 KB Output is correct
65 Correct 311 ms 105108 KB Output is correct