oj.uz

Submission #709560

# Submission time Handle Problem Language Result Execution time Memory
709560 2023-03-13T23:06:44 Z RandomLB Building 4 (JOI20_building4) C++17
100 / 100
 240 ms 45396 KB 
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
#define all(x) x.begin(), x.end()
#define ms(x, a) memset(x, a, sizeof(x))
#define deb(...) logger(#__VA_ARGS__, __VA_ARGS__)
template<typename ...Args>
void logger(string vars, Args&&... values){
    cout << vars << " = ";
    string delim = "";
    (...,(cout << delim << values, delim = ", "));
    cout << endl;
}
//===========================================
const int MAX = 1e6+5;
int a[MAX], b[MAX], dp[2][2][MAX];

int main(){
    cin.tie(0)->sync_with_stdio(0);
    int n; cin >> n; n*=2;
    for (int i = 1; i <= n; i++) cin >> a[i];
    for (int i = 1; i <= n; i++) cin >> b[i];
    for (int i = 1; i <= n; i++){
        dp[0][0][i] = dp[1][0][i] = INF;
        if (a[i] >= a[i-1]){
            dp[0][0][i] = min(dp[0][0][i], dp[0][0][i-1]+1);
            dp[0][1][i] = max(dp[0][1][i], dp[0][1][i-1]+1);
        }
        if (a[i] >= b[i-1]){
            dp[0][0][i] = min(dp[0][0][i], dp[1][0][i-1]+1);
            dp[0][1][i] = max(dp[0][1][i], dp[1][1][i-1]+1);
        }
        if (b[i] >= a[i-1]){
            dp[1][0][i] = min(dp[1][0][i], dp[0][0][i-1]);
            dp[1][1][i] = max(dp[1][1][i], dp[0][1][i-1]);
        }
        if (b[i] >= b[i-1]){
            dp[1][0][i] = min(dp[1][0][i], dp[1][0][i-1]);
            dp[1][1][i] = max(dp[1][1][i], dp[1][1][i-1]);
        }
    }
    //deb(dp[0][0][n], dp[1][0][n], dp[0][1][n], dp[1][1][n]);
    if ((dp[0][0][n] <= n/2 && n/2 <= dp[0][1][n]) ||
        (dp[1][0][n] <= n/2 && n/2 <= dp[1][1][n])){
        string res = "";
        int c = (dp[1][0][n] <= n/2 && n/2 <= dp[1][1][n]);
        int rem = n/2;
        for (int i = n; i; i--){
            res += (c? 'B' : 'A');
            rem -= (!c);
            if (!c){
                if (a[i] >= a[i-1] && dp[0][0][i-1] <= rem && rem <= dp[0][1][i-1]){
                    c = 0;
                } else c = 1;
            } else {
                if (b[i] >= a[i-1] && dp[0][0][i-1] <= rem && rem <= dp[0][1][i-1]){
                    c = 0;
                } else c = 1;
            }
        }
        assert(!rem);
        reverse(all(res));
        int curr = 0;
        for (int i = 1; i <= n; i++){
            int x = (res[i-1] == 'A'? a[i] : b[i]);
            assert(x >= curr);
            curr = x;
        }
        cout << res << "\n";
        return 0;
    }
    cout << -1 << "\n";
}

Subtask #1
11.0 / 11.0

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

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 2 ms 472 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
13 Correct 2 ms 472 KB Output is correct
14 Correct 2 ms 472 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 2 ms 476 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 472 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 508 KB Output is correct
23 Correct 1 ms 504 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 1 ms 416 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 380 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 208 ms 42444 KB Output is correct
35 Correct 209 ms 41976 KB Output is correct
36 Correct 213 ms 41344 KB Output is correct
37 Correct 202 ms 42088 KB Output is correct
38 Correct 193 ms 42136 KB Output is correct
39 Correct 207 ms 41316 KB Output is correct
40 Correct 240 ms 44724 KB Output is correct
41 Correct 199 ms 42368 KB Output is correct
42 Correct 214 ms 43668 KB Output is correct
43 Correct 229 ms 45184 KB Output is correct
44 Correct 222 ms 45120 KB Output is correct
45 Correct 239 ms 45188 KB Output is correct
46 Correct 224 ms 45332 KB Output is correct
47 Correct 203 ms 44220 KB Output is correct
48 Correct 208 ms 44084 KB Output is correct
49 Correct 215 ms 44948 KB Output is correct
50 Correct 234 ms 44380 KB Output is correct
51 Correct 230 ms 44312 KB Output is correct
52 Correct 151 ms 33448 KB Output is correct
53 Correct 157 ms 33436 KB Output is correct
54 Correct 137 ms 33448 KB Output is correct
55 Correct 138 ms 33184 KB Output is correct
56 Correct 229 ms 45396 KB Output is correct
57 Correct 182 ms 40244 KB Output is correct
58 Correct 182 ms 40476 KB Output is correct
59 Correct 189 ms 40336 KB Output is correct
60 Correct 176 ms 38436 KB Output is correct
61 Correct 222 ms 40892 KB Output is correct
62 Correct 186 ms 40388 KB Output is correct
63 Correct 189 ms 40852 KB Output is correct
64 Correct 180 ms 39404 KB Output is correct
65 Correct 201 ms 40936 KB Output is correct