oj.uz

Submission #782975

# Submission time Handle Problem Language Result Execution time Memory
782975 2023-07-14T13:16:54 Z kamelfanger83 Building 4 (JOI20_building4) C++14
100 / 100
 652 ms 27136 KB 
#include <iostream>
#include <vector>
#include <limits>
#include <string>
#include <cassert>
#include <algorithm>

using namespace std;

int main(){
    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 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 4 ms 340 KB Output is correct
6 Correct 3 ms 340 KB Output is correct
7 Correct 3 ms 468 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 3 ms 340 KB Output is correct
10 Correct 3 ms 468 KB Output is correct
11 Correct 3 ms 468 KB Output is correct
12 Correct 4 ms 468 KB Output is correct
13 Correct 5 ms 468 KB Output is correct
14 Correct 3 ms 440 KB Output is correct
15 Correct 3 ms 468 KB Output is correct
16 Correct 3 ms 468 KB Output is correct
17 Correct 3 ms 468 KB Output is correct
18 Correct 3 ms 436 KB Output is correct
19 Correct 3 ms 468 KB Output is correct
20 Correct 2 ms 340 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 3 ms 408 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 3 ms 340 KB Output is correct
27 Correct 2 ms 340 KB Output is correct
28 Correct 2 ms 340 KB Output is correct
29 Correct 2 ms 340 KB Output is correct
30 Correct 2 ms 312 KB Output is correct
31 Correct 2 ms 340 KB Output is correct
32 Correct 2 ms 340 KB Output is correct
33 Correct 2 ms 340 KB Output is correct

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 4 ms 340 KB Output is correct
6 Correct 3 ms 340 KB Output is correct
7 Correct 3 ms 468 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 3 ms 340 KB Output is correct
10 Correct 3 ms 468 KB Output is correct
11 Correct 3 ms 468 KB Output is correct
12 Correct 4 ms 468 KB Output is correct
13 Correct 5 ms 468 KB Output is correct
14 Correct 3 ms 440 KB Output is correct
15 Correct 3 ms 468 KB Output is correct
16 Correct 3 ms 468 KB Output is correct
17 Correct 3 ms 468 KB Output is correct
18 Correct 3 ms 436 KB Output is correct
19 Correct 3 ms 468 KB Output is correct
20 Correct 2 ms 340 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 3 ms 408 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 3 ms 340 KB Output is correct
27 Correct 2 ms 340 KB Output is correct
28 Correct 2 ms 340 KB Output is correct
29 Correct 2 ms 340 KB Output is correct
30 Correct 2 ms 312 KB Output is correct
31 Correct 2 ms 340 KB Output is correct
32 Correct 2 ms 340 KB Output is correct
33 Correct 2 ms 340 KB Output is correct
34 Correct 592 ms 24372 KB Output is correct
35 Correct 538 ms 24952 KB Output is correct
36 Correct 574 ms 24612 KB Output is correct
37 Correct 558 ms 25228 KB Output is correct
38 Correct 550 ms 25104 KB Output is correct
39 Correct 583 ms 25388 KB Output is correct
40 Correct 652 ms 26816 KB Output is correct
41 Correct 565 ms 25756 KB Output is correct
42 Correct 575 ms 26152 KB Output is correct
43 Correct 594 ms 26996 KB Output is correct
44 Correct 589 ms 27016 KB Output is correct
45 Correct 586 ms 27024 KB Output is correct
46 Correct 586 ms 26984 KB Output is correct
47 Correct 566 ms 27052 KB Output is correct
48 Correct 579 ms 27088 KB Output is correct
49 Correct 577 ms 27136 KB Output is correct
50 Correct 605 ms 26956 KB Output is correct
51 Correct 612 ms 26956 KB Output is correct
52 Correct 318 ms 26860 KB Output is correct
53 Correct 380 ms 26660 KB Output is correct
54 Correct 316 ms 26632 KB Output is correct
55 Correct 341 ms 26564 KB Output is correct
56 Correct 588 ms 26996 KB Output is correct
57 Correct 473 ms 26848 KB Output is correct
58 Correct 475 ms 27080 KB Output is correct
59 Correct 496 ms 26880 KB Output is correct
60 Correct 483 ms 25348 KB Output is correct
61 Correct 486 ms 26804 KB Output is correct
62 Correct 485 ms 26240 KB Output is correct
63 Correct 535 ms 26440 KB Output is correct
64 Correct 470 ms 25436 KB Output is correct
65 Correct 475 ms 26068 KB Output is correct