oj.uz

Submission #947391

# Submission time Handle Problem Language Result Execution time Memory
947391 2024-03-16T05:34:45 Z weakweakweak Building 4 (JOI20_building4) C++17
11 / 100
 43 ms 12952 KB 
//joisc怎麼也有水題阿
#include <bits/stdc++.h>
using namespace std;

#define pii pair<int,int>
#define fs first
#define sc second

int n, a[510000], b[510000];
pii dp[510000][2];
pii dead = {1000000, -1000000};

int main () {
    ios_base::sync_with_stdio(false); cin.tie(0);
    cin >> n;
    for (int i = 1; i <= n * 2; i++) cin >> a[i];
    for (int i = 1; i <= n * 2; i++) cin >> b[i];
    
    a[0] = b[0] = -1, dp[0][0] = dp[0][1] = {0, 0};
    for (int i = 1; i <= n * 2; i++) dp[i][0] = dp[i][1] = dead;

    for (int i = 1; i <= n * 2; i++) {
        {
            bool y0 = (a[i] >= a[i - 1]) and (dp[i - 1][0] != dead),    y1 = (a[i] >= b[i-1]) and (dp[i - 1][1] != dead); 
            if (y0 and y1) {
                dp[i][0] . fs = min(dp[i - 1][0].fs, dp[i - 1][1].fs) + 1;
                dp[i][0] . sc = max(dp[i - 1][0].sc, dp[i - 1][1].sc) + 1;
            }
            else if (y0) dp[i][0] = {dp[i - 1][0].fs + 1, dp[i - 1][0].sc + 1};
            else if (y1) dp[i][0] = {dp[i - 1][1].fs + 1, dp[i - 1][1].sc + 1};
        }
        {
            bool y0 = (b[i] >= a[i - 1]) and (dp[i - 1][0] != dead),    y1 = (b[i] >= b[i-1]) and (dp[i - 1][1] != dead); 
            if (y0 and y1) {
                dp[i][1] . fs = min(dp[i - 1][0].fs, dp[i - 1][1].fs);
                dp[i][1] . sc = max(dp[i - 1][0].sc, dp[i - 1][1].sc);
            }
            else if (y0) dp[i][1] = dp[i - 1][0];
            else if (y1) dp[i][1] = dp[i - 1][1];
        }
    }

    int now = 2;
    if (dp[n * 2][0] != dead and dp[n * 2][0].fs <= n and dp[n * 2][0].sc >= n) now = 0;
    if (dp[n * 2][1] != dead and dp[n * 2][1].fs <= n and dp[n * 2][1].sc >= n) now = 1;
    if (now == 2) {
        cout << "-1\n";
        return 0;
    }

    string ans;
    int used = 0;
    for (int i = n * 2; i >= 1; i--) {
        int me = a[i];
        if (now == 1) ans += "B", me = b[i];
        else ans += "A", used++;
        if (dp[i - 1][1] != dead and dp[i - 1][1].fs + used <= n and dp[i - 1][1].sc + used >= n and b[i -1] <= me) now = 1;
        else now = 0;
    }
    reverse(ans.begin(), ans.end());
    cout << ans << '\n';
return 0;}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4544 KB Output is correct
5 Correct 2 ms 4704 KB Output is correct
6 Correct 1 ms 4700 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 2 ms 4700 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4700 KB Output is correct
12 Correct 1 ms 4576 KB Output is correct
13 Correct 2 ms 4700 KB Output is correct
14 Correct 1 ms 4700 KB Output is correct
15 Correct 1 ms 4700 KB Output is correct
16 Correct 2 ms 4700 KB Output is correct
17 Correct 2 ms 4700 KB Output is correct
18 Correct 1 ms 4640 KB Output is correct
19 Correct 1 ms 4636 KB Output is correct
20 Correct 2 ms 4700 KB Output is correct
21 Correct 2 ms 4440 KB Output is correct
22 Correct 1 ms 4440 KB Output is correct
23 Correct 1 ms 4440 KB Output is correct
24 Correct 2 ms 4648 KB Output is correct
25 Correct 2 ms 4444 KB Output is correct
26 Correct 2 ms 4444 KB Output is correct
27 Correct 1 ms 4568 KB Output is correct
28 Correct 1 ms 4444 KB Output is correct
29 Correct 1 ms 4440 KB Output is correct
30 Correct 1 ms 4444 KB Output is correct
31 Correct 1 ms 4444 KB Output is correct
32 Correct 2 ms 4572 KB Output is correct
33 Correct 1 ms 4444 KB Output is correct

Subtask #2
0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4544 KB Output is correct
5 Correct 2 ms 4704 KB Output is correct
6 Correct 1 ms 4700 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 2 ms 4700 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4700 KB Output is correct
12 Correct 1 ms 4576 KB Output is correct
13 Correct 2 ms 4700 KB Output is correct
14 Correct 1 ms 4700 KB Output is correct
15 Correct 1 ms 4700 KB Output is correct
16 Correct 2 ms 4700 KB Output is correct
17 Correct 2 ms 4700 KB Output is correct
18 Correct 1 ms 4640 KB Output is correct
19 Correct 1 ms 4636 KB Output is correct
20 Correct 2 ms 4700 KB Output is correct
21 Correct 2 ms 4440 KB Output is correct
22 Correct 1 ms 4440 KB Output is correct
23 Correct 1 ms 4440 KB Output is correct
24 Correct 2 ms 4648 KB Output is correct
25 Correct 2 ms 4444 KB Output is correct
26 Correct 2 ms 4444 KB Output is correct
27 Correct 1 ms 4568 KB Output is correct
28 Correct 1 ms 4444 KB Output is correct
29 Correct 1 ms 4440 KB Output is correct
30 Correct 1 ms 4444 KB Output is correct
31 Correct 1 ms 4444 KB Output is correct
32 Correct 2 ms 4572 KB Output is correct
33 Correct 1 ms 4444 KB Output is correct
34 Runtime error 43 ms 12952 KB Execution killed with signal 11
35 Halted 0 ms 0 KB -