oj.uz

Submission #211517

# Submission time Handle Problem Language Result Execution time Memory
211517 2020-03-20T16:44:39 Z osaaateiasavtnl Building 4 (JOI20_building4) C++14
100 / 100
 329 ms 49620 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcount
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC

const int N = 1e6 + 7;
int a[2][N];
ii dp[N][2];

void merge(ii &a, ii b) {
    if (a.s < a.f) 
        a = b;
    else
        a = mp(min(a.f, b.f), max(a.s, b.s));
}   

signed main() {
    #ifdef HOME
    freopen("input.txt", "r", stdin);
    #else
    #define endl '\n'
    ios_base::sync_with_stdio(0); cin.tie(0);
    #endif
    int n;
    cin >> n;
    for (int i = 0; i < 2; ++i)
        for (int j = 0; j < 2 * n; ++j)
            cin >> a[i][j];

    for (int i = 0; i < N; ++i)
        for (int j = 0; j < 2; ++j)
            dp[i][j] = mp(N, -N);

    dp[0][0] = mp(0, 0);
    for (int i = 0; i < 2 * n; ++i) {
        for (int t = 0; t < 2; ++t) {
            
            int cur = -1;
            if (i)
                cur = a[t][i - 1];
            for (int add = 0; add < 2; ++add) {
                if (cur <= a[add][i]) {
                    merge(dp[i + 1][add], mp(dp[i][t].f + (add == 0), dp[i][t].s + (add == 0)));
                }
            }   

        }   
    }   

    bool r = 0;
    for (int i = 0; i < 2; ++i)
        if (dp[2 * n][i].f <= n && n <= dp[2 * n][i].s) 
            r = i;
    if (n < dp[2 * n][r].f || n > dp[2 * n][r].s) {
        cout << "-1" << endl;
    }   
    else {
        string ans;
        int cnt = n;
        for (int i = 2 * n; ; --i) {
            if (r)
                ans += 'B';
            else {  
                --cnt;
                ans += 'A';
            }
            if (i == 1)
                break;
            if (a[0][i - 2] <= a[r][i - 1] && dp[i - 1][0].f <= cnt && cnt <= dp[i - 1][0].s)
                r = 0;
            else
                r = 1;
        }   
        reverse(all(ans));
        cout << ans << endl;
    }   
}

Subtask #1
11.0 / 11.0

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

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 31616 KB Output is correct
2 Correct 19 ms 31616 KB Output is correct
3 Correct 22 ms 31616 KB Output is correct
4 Correct 20 ms 31616 KB Output is correct
5 Correct 20 ms 31744 KB Output is correct
6 Correct 20 ms 31744 KB Output is correct
7 Correct 20 ms 31744 KB Output is correct
8 Correct 20 ms 31744 KB Output is correct
9 Correct 20 ms 31744 KB Output is correct
10 Correct 21 ms 31744 KB Output is correct
11 Correct 21 ms 31744 KB Output is correct
12 Correct 21 ms 31744 KB Output is correct
13 Correct 22 ms 31788 KB Output is correct
14 Correct 20 ms 31744 KB Output is correct
15 Correct 20 ms 31744 KB Output is correct
16 Correct 19 ms 31744 KB Output is correct
17 Correct 20 ms 31744 KB Output is correct
18 Correct 19 ms 31744 KB Output is correct
19 Correct 24 ms 31744 KB Output is correct
20 Correct 19 ms 31744 KB Output is correct
21 Correct 20 ms 31744 KB Output is correct
22 Correct 20 ms 31744 KB Output is correct
23 Correct 20 ms 31744 KB Output is correct
24 Correct 21 ms 31744 KB Output is correct
25 Correct 20 ms 31744 KB Output is correct
26 Correct 21 ms 31744 KB Output is correct
27 Correct 21 ms 31744 KB Output is correct
28 Correct 20 ms 31744 KB Output is correct
29 Correct 23 ms 31744 KB Output is correct
30 Correct 20 ms 31744 KB Output is correct
31 Correct 21 ms 31744 KB Output is correct
32 Correct 20 ms 31744 KB Output is correct
33 Correct 20 ms 31744 KB Output is correct
34 Correct 301 ms 47156 KB Output is correct
35 Correct 300 ms 48176 KB Output is correct
36 Correct 294 ms 47920 KB Output is correct
37 Correct 292 ms 48176 KB Output is correct
38 Correct 288 ms 48304 KB Output is correct
39 Correct 282 ms 48432 KB Output is correct
40 Correct 320 ms 49516 KB Output is correct
41 Correct 299 ms 48560 KB Output is correct
42 Correct 318 ms 48892 KB Output is correct
43 Correct 312 ms 49388 KB Output is correct
44 Correct 324 ms 49400 KB Output is correct
45 Correct 322 ms 49388 KB Output is correct
46 Correct 311 ms 49516 KB Output is correct
47 Correct 292 ms 49388 KB Output is correct
48 Correct 293 ms 49516 KB Output is correct
49 Correct 325 ms 49388 KB Output is correct
50 Correct 329 ms 49620 KB Output is correct
51 Correct 325 ms 49392 KB Output is correct
52 Correct 199 ms 49388 KB Output is correct
53 Correct 205 ms 49388 KB Output is correct
54 Correct 186 ms 49516 KB Output is correct
55 Correct 174 ms 49388 KB Output is correct
56 Correct 320 ms 49388 KB Output is correct
57 Correct 269 ms 49388 KB Output is correct
58 Correct 275 ms 49516 KB Output is correct
59 Correct 260 ms 49388 KB Output is correct
60 Correct 259 ms 48432 KB Output is correct
61 Correct 280 ms 49516 KB Output is correct
62 Correct 273 ms 49328 KB Output is correct
63 Correct 278 ms 49388 KB Output is correct
64 Correct 253 ms 48816 KB Output is correct
65 Correct 283 ms 49520 KB Output is correct