oj.uz

Submission #958354

# Submission time Handle Problem Language Result Execution time Memory
958354 2024-04-05T13:56:09 Z Vladth11 Building 4 (JOI20_building4) C++14
100 / 100
 196 ms 69076 KB 
#include <bits/stdc++.h>
#define debug(x) cerr << #x << " " << x << "\n"
#define debugs(x) cerr << #x << " " << x << " "
#pragma GCC optimize ("Ofast")
#pragma GCC target ("avx2")

#define int ll

using namespace std;
typedef long long ll;
typedef pair <ll, ll> pii;

const ll NMAX = 1000001;
const ll INF = 1e9;
const ll nrbits = 20;
const ll MOD = 998244353;

int a[NMAX];
int b[NMAX];

pii dpa[NMAX];
pii dpb[NMAX];

const pii NEUTRU = {0, -1};

pii unite(pii a, pii b){
    if(a.first > a.second)
        return b;
    if(b.first > b.second)
        return a;
    return {min(a.first, b.first), max(a.second, b.second)};
}

signed main() {
#ifdef HOME
    ifstream cin(".in");
    ofstream cout(".out");
#endif // HOME
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    srand(time(0));
    int n, i, k;
    cin >> n;
    for(i = 1; i <= 2 * n; i++){
        cin >> a[i];
    }
    for(i = 1; i <= 2 * n; i++){
        cin >> b[i];
    }
    dpb[1] = {1, 1};
    dpa[1] = {0, 0};
    for(i = 2; i <= 2 * n; i++){
        dpa[i] = dpb[i] = NEUTRU;
        if(a[i] >= a[i - 1]){
            dpa[i] = unite(dpa[i], dpa[i - 1]);
        }
        if(a[i] >= b[i - 1]){
            dpa[i] = unite(dpa[i], dpb[i - 1]);
        }
        if(b[i] >= b[i - 1]){
            dpb[i] = unite(dpb[i], {dpb[i - 1].first + 1, dpb[i - 1].second + 1});
        }
        if(b[i] >= a[i - 1]){
            dpb[i] = unite(dpb[i], {dpa[i - 1].first + 1, dpa[i - 1].second + 1});
        }
    }
    if((dpb[2 * n].first > n || dpb[2 * n].second < n) && ((dpa[2 * n].first > n || dpa[2 * n].second < n))){
        cout << -1;
        return 0;
    }
    int unde = 2 * n;
    int ta = n;
    int tb = n;
    string sol = "";
    int lst = 2e9;
    while(unde >= 1){
        if(ta > 0 && ((dpa[unde].first <= tb && dpa[unde].second >= tb) || tb == 0) && a[unde] <= lst){
            ta--;
            sol += "A";
            lst = a[unde];
        }else{
            sol += "B";
            tb--;
            lst = b[unde];
        }

        unde--;
    }
    reverse(sol.begin(), sol.end());
    cout << sol;
    return 0;
}

Compilation message

building4.cpp: In function 'int main()':
building4.cpp:43:15: warning: unused variable 'k' [-Wunused-variable]
   43 |     int n, i, k;
      |               ^

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6604 KB Output is correct
3 Correct 1 ms 6624 KB Output is correct
4 Correct 1 ms 6608 KB Output is correct
5 Correct 2 ms 8796 KB Output is correct
6 Correct 2 ms 8796 KB Output is correct
7 Correct 2 ms 8668 KB Output is correct
8 Correct 2 ms 8796 KB Output is correct
9 Correct 2 ms 8796 KB Output is correct
10 Correct 2 ms 8540 KB Output is correct
11 Correct 2 ms 8796 KB Output is correct
12 Correct 2 ms 8796 KB Output is correct
13 Correct 2 ms 8792 KB Output is correct
14 Correct 2 ms 8796 KB Output is correct
15 Correct 2 ms 8800 KB Output is correct
16 Correct 2 ms 8792 KB Output is correct
17 Correct 2 ms 8796 KB Output is correct
18 Correct 2 ms 8800 KB Output is correct
19 Correct 2 ms 8796 KB Output is correct
20 Correct 2 ms 8540 KB Output is correct
21 Correct 2 ms 8540 KB Output is correct
22 Correct 2 ms 8696 KB Output is correct
23 Correct 2 ms 8544 KB Output is correct
24 Correct 2 ms 8744 KB Output is correct
25 Correct 2 ms 8700 KB Output is correct
26 Correct 2 ms 8540 KB Output is correct
27 Correct 2 ms 8796 KB Output is correct
28 Correct 2 ms 8536 KB Output is correct
29 Correct 2 ms 8796 KB Output is correct
30 Correct 2 ms 8540 KB Output is correct
31 Correct 2 ms 8540 KB Output is correct
32 Correct 2 ms 8536 KB Output is correct
33 Correct 2 ms 8796 KB Output is correct

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6604 KB Output is correct
3 Correct 1 ms 6624 KB Output is correct
4 Correct 1 ms 6608 KB Output is correct
5 Correct 2 ms 8796 KB Output is correct
6 Correct 2 ms 8796 KB Output is correct
7 Correct 2 ms 8668 KB Output is correct
8 Correct 2 ms 8796 KB Output is correct
9 Correct 2 ms 8796 KB Output is correct
10 Correct 2 ms 8540 KB Output is correct
11 Correct 2 ms 8796 KB Output is correct
12 Correct 2 ms 8796 KB Output is correct
13 Correct 2 ms 8792 KB Output is correct
14 Correct 2 ms 8796 KB Output is correct
15 Correct 2 ms 8800 KB Output is correct
16 Correct 2 ms 8792 KB Output is correct
17 Correct 2 ms 8796 KB Output is correct
18 Correct 2 ms 8800 KB Output is correct
19 Correct 2 ms 8796 KB Output is correct
20 Correct 2 ms 8540 KB Output is correct
21 Correct 2 ms 8540 KB Output is correct
22 Correct 2 ms 8696 KB Output is correct
23 Correct 2 ms 8544 KB Output is correct
24 Correct 2 ms 8744 KB Output is correct
25 Correct 2 ms 8700 KB Output is correct
26 Correct 2 ms 8540 KB Output is correct
27 Correct 2 ms 8796 KB Output is correct
28 Correct 2 ms 8536 KB Output is correct
29 Correct 2 ms 8796 KB Output is correct
30 Correct 2 ms 8540 KB Output is correct
31 Correct 2 ms 8540 KB Output is correct
32 Correct 2 ms 8536 KB Output is correct
33 Correct 2 ms 8796 KB Output is correct
34 Correct 163 ms 66116 KB Output is correct
35 Correct 169 ms 66700 KB Output is correct
36 Correct 157 ms 66116 KB Output is correct
37 Correct 168 ms 66824 KB Output is correct
38 Correct 157 ms 67128 KB Output is correct
39 Correct 153 ms 65796 KB Output is correct
40 Correct 161 ms 68384 KB Output is correct
41 Correct 149 ms 66684 KB Output is correct
42 Correct 173 ms 67744 KB Output is correct
43 Correct 196 ms 69076 KB Output is correct
44 Correct 186 ms 68684 KB Output is correct
45 Correct 193 ms 68680 KB Output is correct
46 Correct 164 ms 68932 KB Output is correct
47 Correct 165 ms 67944 KB Output is correct
48 Correct 159 ms 67768 KB Output is correct
49 Correct 163 ms 68532 KB Output is correct
50 Correct 177 ms 68044 KB Output is correct
51 Correct 178 ms 68028 KB Output is correct
52 Correct 117 ms 57152 KB Output is correct
53 Correct 123 ms 57116 KB Output is correct
54 Correct 109 ms 56904 KB Output is correct
55 Correct 122 ms 56768 KB Output is correct
56 Correct 164 ms 69044 KB Output is correct
57 Correct 140 ms 64056 KB Output is correct
58 Correct 142 ms 64048 KB Output is correct
59 Correct 152 ms 64056 KB Output is correct
60 Correct 133 ms 62960 KB Output is correct
61 Correct 147 ms 64584 KB Output is correct
62 Correct 147 ms 64184 KB Output is correct
63 Correct 148 ms 64460 KB Output is correct
64 Correct 140 ms 63512 KB Output is correct
65 Correct 166 ms 64440 KB Output is correct