oj.uz

Submission #782977

# Submission time Handle Problem Language Result Execution time Memory
782977 2023-07-14T13:18:12 Z kamelfanger83 Building 4 (JOI20_building4) C++14
100 / 100
 207 ms 25940 KB 
#include <iostream>
#include <vector>
#include <limits>
#include <string>
#include <cassert>
#include <algorithm>

using namespace std;

int main(){
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    
    int n; cin >> n; n <<= 1;
    vector<pair<int, int>> ops (n);

    for (int i = 0; i < n; ++i) cin >> ops[i].first;
    for (int i = 0; i < n; ++i) cin >> ops[i].second;

    vector<pair<int, int>> lowers (n, {numeric_limits<int>::max(), numeric_limits<int>::max()}), uppers (n, {numeric_limits<int>::min(), numeric_limits<int>::min()});
    lowers[0].first = 1; lowers[0].second = 0;
    uppers[0].first = 1; uppers[0].second = 0;

    for (int i = 1; i < n; ++i) {
        if (ops[i].first >= ops[i - 1].first) {
            lowers[i].first = lowers[i - 1].first;
            uppers[i].first = uppers[i - 1].first;
        }
        if (ops[i].first >= ops[i - 1].second) {
            lowers[i].first = min(lowers[i].first, lowers[i - 1].second);
            uppers[i].first = max(uppers[i].first, uppers[i - 1].second);
        }
        if (lowers[i].first != numeric_limits<int>::max()) lowers[i].first++;
        uppers[i].first++;
        if (ops[i].second >= ops[i - 1].first) {
            lowers[i].second = lowers[i - 1].first;
            uppers[i].second = uppers[i - 1].first;
        }
        if (ops[i].second >= ops[i - 1].second) {
            lowers[i].second = min(lowers[i].second, lowers[i - 1].second);
            uppers[i].second = max(uppers[i].second, uppers[i - 1].second);
        }
    }

    auto isin = [](int l, int r, int v){
        return l <= v && v <= r;
    };

    if (!isin(lowers.back().first, uppers.back().first, n/2) && !isin(lowers.back().second, uppers.back().second, n/2)) cout << -1 << "\n";
    else {
        string ANS;
        int tbd = n/2;
        int at = numeric_limits<int>::max();
        for (int i = n - 1; i >= 0; --i) {
            if (isin(lowers[i].first, uppers[i].first, tbd) && at >= ops[i].first){
                ANS.push_back('A');
                tbd--;
                at = ops[i].first;
            }
            else if (isin(lowers[i].second, uppers[i].second, tbd) && at >= ops[i].second){
                ANS.push_back('B');
                at = ops[i].second;
            }
            else{
                assert(false);
            }
        }
        assert(tbd == 0);
        reverse(ANS.begin(), ANS.end());
        cout << ANS;
    }

    return 0;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 2 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 161 ms 23380 KB Output is correct
35 Correct 174 ms 23948 KB Output is correct
36 Correct 161 ms 23652 KB Output is correct
37 Correct 159 ms 24056 KB Output is correct
38 Correct 163 ms 24060 KB Output is correct
39 Correct 151 ms 24204 KB Output is correct
40 Correct 167 ms 25716 KB Output is correct
41 Correct 153 ms 24584 KB Output is correct
42 Correct 175 ms 25224 KB Output is correct
43 Correct 207 ms 25928 KB Output is correct
44 Correct 176 ms 25940 KB Output is correct
45 Correct 173 ms 25928 KB Output is correct
46 Correct 166 ms 25888 KB Output is correct
47 Correct 165 ms 25928 KB Output is correct
48 Correct 165 ms 25924 KB Output is correct
49 Correct 180 ms 25920 KB Output is correct
50 Correct 181 ms 25848 KB Output is correct
51 Correct 172 ms 25928 KB Output is correct
52 Correct 119 ms 25920 KB Output is correct
53 Correct 119 ms 25848 KB Output is correct
54 Correct 113 ms 25912 KB Output is correct
55 Correct 116 ms 25840 KB Output is correct
56 Correct 161 ms 25928 KB Output is correct
57 Correct 162 ms 25796 KB Output is correct
58 Correct 153 ms 25876 KB Output is correct
59 Correct 139 ms 25848 KB Output is correct
60 Correct 147 ms 24364 KB Output is correct
61 Correct 142 ms 25924 KB Output is correct
62 Correct 140 ms 25560 KB Output is correct
63 Correct 140 ms 25924 KB Output is correct
64 Correct 137 ms 24964 KB Output is correct
65 Correct 148 ms 25844 KB Output is correct