oj.uz

Submission #976578

# Submission time Handle Problem Language Result Execution time Memory
976578 2024-05-06T18:25:41 Z LinkedArray Building 4 (JOI20_building4) C++17
100 / 100
 180 ms 57160 KB 
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
#define pb push_back

const int MAX_N = 1e6;
const int INF = 1e9;

int val[2][2 * MAX_N + 5];
int st_min[2][2 * MAX_N + 5], dr_max[2][2 * MAX_N + 5];
/* 0 -> a[ ]; 1 -> b[ ] */

int main () {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, i, j, k, prev_val, num_a, num_b;
    string ans;

    cin >> n;
    for (i = 1; i <= 2 * n; i++) {
        cin >> val[0][i];
    }
    for (i = 1; i <= 2 * n; i++) {
        cin >> val[1][i];
    }
    for (i = 1; i <= 2 * n; i++) {
        /* iau variante */
        for (j = 0; j < 2; j++) {
            st_min[j][i] = INF;
            dr_max[j][i] = -INF;
        }
        for (j = 0; j < 2; j++) {
            if (val[j][i - 1] <= val[0][i]) {
                st_min[0][i] = min(st_min[0][i], st_min[j][i - 1] + 1);
                dr_max[0][i] = max(dr_max[0][i], dr_max[j][i - 1] + 1);
            }
            if (val[j][i - 1] <= val[1][i]) {
                st_min[1][i] = min(st_min[1][i], st_min[j][i - 1]);
                dr_max[1][i] = max(dr_max[1][i], dr_max[j][i - 1]);
            }
        }
    }

    /* go from largest to smallest */
    prev_val = INF;
    num_a = 0;
    for (i = 2 * n; i >= 1; i--) {
        num_b = n - num_a;
        if (prev_val >= val[0][i] && st_min[0][i] <= num_b && num_b <= dr_max[0][i]) {
            ans.push_back('A');
            num_a++;

            prev_val = val[0][i];
        } else if (prev_val >= val[1][i] && st_min[1][i] <= num_b && num_b <= dr_max[1][i]) {
            ans.push_back('B');

            prev_val = val[1][i];
        } else {
            cout << "-1\n";
            return 0;
        }
    }

    /* take from smallest to largest */
    reverse(ans.begin(), ans.end());
    cout << ans << "\n";
    return 0;
}

Compilation message

building4.cpp: In function 'int main()':
building4.cpp:18:18: warning: unused variable 'k' [-Wunused-variable]
   18 |     int n, i, j, k, prev_val, num_a, num_b;
      |                  ^

Subtask #1
11.0 / 11.0

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

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 10588 KB Output is correct
2 Correct 2 ms 10588 KB Output is correct
3 Correct 2 ms 10588 KB Output is correct
4 Correct 1 ms 10588 KB Output is correct
5 Correct 2 ms 10588 KB Output is correct
6 Correct 3 ms 10588 KB Output is correct
7 Correct 2 ms 10588 KB Output is correct
8 Correct 2 ms 10776 KB Output is correct
9 Correct 2 ms 10588 KB Output is correct
10 Correct 2 ms 10584 KB Output is correct
11 Correct 2 ms 10588 KB Output is correct
12 Correct 3 ms 10588 KB Output is correct
13 Correct 2 ms 10588 KB Output is correct
14 Correct 2 ms 10588 KB Output is correct
15 Correct 2 ms 10584 KB Output is correct
16 Correct 2 ms 10588 KB Output is correct
17 Correct 2 ms 10588 KB Output is correct
18 Correct 3 ms 10588 KB Output is correct
19 Correct 2 ms 10588 KB Output is correct
20 Correct 2 ms 10744 KB Output is correct
21 Correct 2 ms 10588 KB Output is correct
22 Correct 2 ms 10588 KB Output is correct
23 Correct 2 ms 10588 KB Output is correct
24 Correct 2 ms 10584 KB Output is correct
25 Correct 2 ms 10764 KB Output is correct
26 Correct 2 ms 10588 KB Output is correct
27 Correct 3 ms 10588 KB Output is correct
28 Correct 2 ms 10588 KB Output is correct
29 Correct 2 ms 10588 KB Output is correct
30 Correct 3 ms 10584 KB Output is correct
31 Correct 2 ms 10584 KB Output is correct
32 Correct 2 ms 10588 KB Output is correct
33 Correct 2 ms 10588 KB Output is correct
34 Correct 170 ms 54360 KB Output is correct
35 Correct 165 ms 53288 KB Output is correct
36 Correct 162 ms 52840 KB Output is correct
37 Correct 160 ms 53248 KB Output is correct
38 Correct 147 ms 53372 KB Output is correct
39 Correct 146 ms 52496 KB Output is correct
40 Correct 161 ms 56392 KB Output is correct
41 Correct 157 ms 53008 KB Output is correct
42 Correct 179 ms 56132 KB Output is correct
43 Correct 176 ms 56908 KB Output is correct
44 Correct 176 ms 56960 KB Output is correct
45 Correct 174 ms 56908 KB Output is correct
46 Correct 161 ms 56872 KB Output is correct
47 Correct 173 ms 56024 KB Output is correct
48 Correct 159 ms 55872 KB Output is correct
49 Correct 164 ms 56652 KB Output is correct
50 Correct 180 ms 56012 KB Output is correct
51 Correct 174 ms 56024 KB Output is correct
52 Correct 125 ms 45248 KB Output is correct
53 Correct 117 ms 45120 KB Output is correct
54 Correct 107 ms 45228 KB Output is correct
55 Correct 108 ms 44872 KB Output is correct
56 Correct 160 ms 57160 KB Output is correct
57 Correct 168 ms 52052 KB Output is correct
58 Correct 138 ms 52016 KB Output is correct
59 Correct 138 ms 52040 KB Output is correct
60 Correct 143 ms 49296 KB Output is correct
61 Correct 140 ms 52684 KB Output is correct
62 Correct 145 ms 52312 KB Output is correct
63 Correct 149 ms 52664 KB Output is correct
64 Correct 145 ms 51984 KB Output is correct
65 Correct 150 ms 52552 KB Output is correct