oj.uz

Submission #522165

# Submission time Handle Problem Language Result Execution time Memory
522165 2022-02-04T02:52:57 Z Rainbowbunny Building 4 (JOI20_building4) C++17
100 / 100
 261 ms 48276 KB 
#include <bits/stdc++.h>
using namespace std;

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

int n;
int A[MAXN][2], l[MAXN][2], r[MAXN][2];
int ans[MAXN];

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin >> n;
    for(int i = 1; i <= 2 * n; i++)
    {
        cin >> A[i][0];
    }
    for(int i = 1; i <= 2 * n; i++)
    {
        cin >> A[i][1];
    }

    for(int i = 1; i <= 2 * n; i++)
    {
        for(int j = 0; j < 2; j++)
        {
            l[i][j] = INF; r[i][j] = -INF;
            for(int k = 0; k < 2; k++)
            {
                if(A[i][j] >= A[i - 1][k])
                {
                    l[i][j] = min(l[i][j], l[i - 1][k] + j);
                    r[i][j] = max(r[i][j], r[i - 1][k] + j);
                }
            }
        }
    }

    int root = -1, cntb = n;
    for(int i = 0; i < 2; i++)
    {
        if(l[2 * n][i] <= cntb and r[2 * n][i] >= cntb)
        {
            root = i;
        }
    }

    if(root == -1)
    {
        cout << -1 << '\n';
    }
    else
    {
        for(int i = 2 * n; i >= 1; i--)
        {
            for(int j = 0; j < 2; j++)
            {
                if(A[i][root] >= A[i - 1][j] and cntb - root >= l[i - 1][j] and cntb - root <= r[i - 1][j])
                {
                    ans[i] = root;
                    cntb -= root;
                    root = j;
                    break;
                }
            }
        }
        for(int i = 1; i <= 2 * n; i++)
        {
            cout << char(ans[i] + 'A');
        }
        cout << '\n';
    }
}

Subtask #1
11.0 / 11.0

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

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 2 ms 460 KB Output is correct
7 Correct 1 ms 444 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 2 ms 400 KB Output is correct
10 Correct 1 ms 400 KB Output is correct
11 Correct 2 ms 456 KB Output is correct
12 Correct 2 ms 460 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 1 ms 460 KB Output is correct
17 Correct 3 ms 460 KB Output is correct
18 Correct 2 ms 460 KB Output is correct
19 Correct 2 ms 460 KB Output is correct
20 Correct 1 ms 456 KB Output is correct
21 Correct 1 ms 460 KB Output is correct
22 Correct 1 ms 460 KB Output is correct
23 Correct 1 ms 456 KB Output is correct
24 Correct 1 ms 460 KB Output is correct
25 Correct 1 ms 460 KB Output is correct
26 Correct 1 ms 460 KB Output is correct
27 Correct 1 ms 380 KB Output is correct
28 Correct 2 ms 456 KB Output is correct
29 Correct 1 ms 460 KB Output is correct
30 Correct 1 ms 456 KB Output is correct
31 Correct 1 ms 464 KB Output is correct
32 Correct 1 ms 460 KB Output is correct
33 Correct 2 ms 460 KB Output is correct
34 Correct 209 ms 42564 KB Output is correct
35 Correct 227 ms 44680 KB Output is correct
36 Correct 213 ms 43752 KB Output is correct
37 Correct 239 ms 44736 KB Output is correct
38 Correct 233 ms 44660 KB Output is correct
39 Correct 223 ms 43956 KB Output is correct
40 Correct 229 ms 47540 KB Output is correct
41 Correct 232 ms 44888 KB Output is correct
42 Correct 233 ms 46552 KB Output is correct
43 Correct 243 ms 47964 KB Output is correct
44 Correct 235 ms 47956 KB Output is correct
45 Correct 255 ms 48060 KB Output is correct
46 Correct 261 ms 47964 KB Output is correct
47 Correct 252 ms 47056 KB Output is correct
48 Correct 222 ms 46932 KB Output is correct
49 Correct 218 ms 47692 KB Output is correct
50 Correct 251 ms 47284 KB Output is correct
51 Correct 239 ms 47284 KB Output is correct
52 Correct 197 ms 36288 KB Output is correct
53 Correct 171 ms 36288 KB Output is correct
54 Correct 151 ms 36292 KB Output is correct
55 Correct 155 ms 36036 KB Output is correct
56 Correct 245 ms 48276 KB Output is correct
57 Correct 201 ms 42948 KB Output is correct
58 Correct 221 ms 43212 KB Output is correct
59 Correct 199 ms 43336 KB Output is correct
60 Correct 178 ms 41012 KB Output is correct
61 Correct 200 ms 43652 KB Output is correct
62 Correct 196 ms 43208 KB Output is correct
63 Correct 212 ms 43720 KB Output is correct
64 Correct 223 ms 42224 KB Output is correct
65 Correct 203 ms 43720 KB Output is correct