oj.uz

Submission #983671

# Submission time Handle Problem Language Result Execution time Memory
983671 2024-05-15T22:20:56 Z parsadox2 Building 4 (JOI20_building4) C++17
100 / 100
 202 ms 45388 KB 
#include <bits/stdc++.h>
#define F first
#define S second
using namespace std;

const int N = 1e6 + 10;

int n , A[2][N];
pair <int , int> dp[N][2];

pair <int , int> ejtema(pair<int , int> a , pair <int , int> b , int v)
{
    b.F += v;  b.S += v;
    pair <int , int> res;
    res.F = min(a.F , b.F);
    res.S = max(a.S , b.S);
    return res;
}

string Solve(int id , int val , int ty)
{
    string res = "";
    while(true)
    {
        if(ty == 1)
            res.push_back('B');
        else
            res.push_back('A');
        val -= ty;
        if(id == 1)
            break;
        if(A[ty][id] >= A[0][id - 1] && val >= dp[id - 1][0].F && val <= dp[id - 1][0].S)
            ty = 0;
        else
            ty = 1;
        id--;
    }
    reverse(res.begin() , res.end());
    return res;
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);  cout.tie(0);
    cin >> n;
    n *= 2;
    for(int i = 1 ; i <= n ; i++)
        cin >> A[0][i];
    for(int i = 1 ; i <= n ; i++)
        cin >> A[1][i];
    dp[1][0] = make_pair(0 , 0);
    dp[1][1] = make_pair(1 , 1);
    for(int i = 2 ; i <= n ; i++)   for(int ty = 0 ; ty < 2 ; ty++)
    {
        dp[i][ty] = make_pair(N , -1);
        if(A[ty][i] >= A[0][i - 1])
            dp[i][ty] = ejtema(dp[i][ty] , dp[i - 1][0] , ty);
        if(A[ty][i] >= A[1][i - 1])
            dp[i][ty] = ejtema(dp[i][ty] , dp[i - 1][1] , ty);
    }
    int m = n / 2;
    if(m >= dp[n][0].F && m <= dp[n][0].S)
    {
        cout << Solve(n , m , 0) << '\n';
    }
    else if(m >= dp[n][1].F && m <= dp[n][1].S)
    {
        cout << Solve(n , m , 1) << '\n';
    }
    else
    {
        cout << -1 << '\n';
    }
    return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4696 KB Output is correct
7 Correct 1 ms 4628 KB Output is correct
8 Correct 2 ms 4700 KB Output is correct
9 Correct 1 ms 4700 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4700 KB Output is correct
12 Correct 2 ms 4700 KB Output is correct
13 Correct 2 ms 4700 KB Output is correct
14 Correct 2 ms 4572 KB Output is correct
15 Correct 1 ms 4700 KB Output is correct
16 Correct 1 ms 4700 KB Output is correct
17 Correct 2 ms 4696 KB Output is correct
18 Correct 2 ms 4700 KB Output is correct
19 Correct 1 ms 4700 KB Output is correct
20 Correct 1 ms 4440 KB Output is correct
21 Correct 1 ms 4440 KB Output is correct
22 Correct 2 ms 4572 KB Output is correct
23 Correct 1 ms 4440 KB Output is correct
24 Correct 1 ms 4700 KB Output is correct
25 Correct 1 ms 4612 KB Output is correct
26 Correct 2 ms 4444 KB Output is correct
27 Correct 1 ms 4444 KB Output is correct
28 Correct 1 ms 4604 KB Output is correct
29 Correct 2 ms 4616 KB Output is correct
30 Correct 1 ms 4444 KB Output is correct
31 Correct 1 ms 4444 KB Output is correct
32 Correct 1 ms 4444 KB Output is correct
33 Correct 2 ms 4440 KB Output is correct

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4696 KB Output is correct
7 Correct 1 ms 4628 KB Output is correct
8 Correct 2 ms 4700 KB Output is correct
9 Correct 1 ms 4700 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4700 KB Output is correct
12 Correct 2 ms 4700 KB Output is correct
13 Correct 2 ms 4700 KB Output is correct
14 Correct 2 ms 4572 KB Output is correct
15 Correct 1 ms 4700 KB Output is correct
16 Correct 1 ms 4700 KB Output is correct
17 Correct 2 ms 4696 KB Output is correct
18 Correct 2 ms 4700 KB Output is correct
19 Correct 1 ms 4700 KB Output is correct
20 Correct 1 ms 4440 KB Output is correct
21 Correct 1 ms 4440 KB Output is correct
22 Correct 2 ms 4572 KB Output is correct
23 Correct 1 ms 4440 KB Output is correct
24 Correct 1 ms 4700 KB Output is correct
25 Correct 1 ms 4612 KB Output is correct
26 Correct 2 ms 4444 KB Output is correct
27 Correct 1 ms 4444 KB Output is correct
28 Correct 1 ms 4604 KB Output is correct
29 Correct 2 ms 4616 KB Output is correct
30 Correct 1 ms 4444 KB Output is correct
31 Correct 1 ms 4444 KB Output is correct
32 Correct 1 ms 4444 KB Output is correct
33 Correct 2 ms 4440 KB Output is correct
34 Correct 165 ms 42776 KB Output is correct
35 Correct 165 ms 43276 KB Output is correct
36 Correct 157 ms 42896 KB Output is correct
37 Correct 202 ms 43536 KB Output is correct
38 Correct 147 ms 43504 KB Output is correct
39 Correct 151 ms 42476 KB Output is correct
40 Correct 155 ms 44888 KB Output is correct
41 Correct 154 ms 43332 KB Output is correct
42 Correct 160 ms 44304 KB Output is correct
43 Correct 173 ms 45132 KB Output is correct
44 Correct 187 ms 45360 KB Output is correct
45 Correct 168 ms 45228 KB Output is correct
46 Correct 157 ms 45232 KB Output is correct
47 Correct 158 ms 44464 KB Output is correct
48 Correct 155 ms 44204 KB Output is correct
49 Correct 157 ms 44876 KB Output is correct
50 Correct 165 ms 44328 KB Output is correct
51 Correct 171 ms 44364 KB Output is correct
52 Correct 117 ms 33608 KB Output is correct
53 Correct 120 ms 33712 KB Output is correct
54 Correct 107 ms 33612 KB Output is correct
55 Correct 108 ms 33500 KB Output is correct
56 Correct 157 ms 45388 KB Output is correct
57 Correct 134 ms 40372 KB Output is correct
58 Correct 138 ms 40356 KB Output is correct
59 Correct 135 ms 40568 KB Output is correct
60 Correct 146 ms 39680 KB Output is correct
61 Correct 153 ms 41260 KB Output is correct
62 Correct 137 ms 40696 KB Output is correct
63 Correct 140 ms 41008 KB Output is correct
64 Correct 133 ms 40184 KB Output is correct
65 Correct 155 ms 40972 KB Output is correct