oj.uz

Submission #930501

# Submission time Handle Problem Language Result Execution time Memory
930501 2024-02-20T03:58:56 Z dimashhh Building 4 (JOI20_building4) C++17
11 / 100
 115 ms 256080 KB 
#include <bits/stdc++.h>

using namespace std;
const int N = 4000 + 12, MOD = 998244353;

typedef long long ll;

int n, a[N][2];
bool dp[N][2];
int dp_[N][N][2];
void test() {
    cin >> n;
    memset(dp_,-1,sizeof(dp_));
    for (int i = 1; i <= n + n; i++) {
        cin >> a[i][0];
    }
    for (int i = 1; i <= n + n; i++) {
        cin >> a[i][1];
    }
    dp[n + n][0] = dp[n + n][1] = 1;
    dp_[0][0][0] = 0;
    for (int i = n + n - 1; i >= 1; i--) {
        for (int j = 0; j <= 1; j++) {
            for (int k = 0; k <= 1; k++) {
                if (a[i][j] <= a[i + 1][k]) {
                    dp[i][j] |= dp[i + 1][k];
                }
            }
        }
    }
    if (!dp[1][0] && !dp[1][1]) {
        cout << -1;
        return;
    }
    a[n + n + 1][1] = 1e9 + 2;
    for(int i = 1;i <= n + n;i++){
        for(int j = 0;j <= 1;j++){
            for(int k = 0;k <= n;k++){
                if(j == 1){
                    if(a[i][j] >= a[i - 1][0] && dp_[i - 1][k][0] != -1){
                        dp_[i][k][1] = 0;
                    }
                    if(a[i][j] >= a[i - 1][1] && dp_[i - 1][k][1] != -1){
                        dp_[i][k][1] = 1;
                    }
                }else{
                    if(k){
                        if(a[i][j] >= a[i - 1][0] && dp_[i - 1][k - 1][0] != -1){
                            dp_[i][k][j] = 0;
                        }
                        if(a[i][j] >= a[i - 1][1] && dp_[i - 1][k - 1][1] != -1){
                            dp_[i][k][j] = 1;
                        }
                    }
                }
            }
        }
    }
    if(dp_[n + n][n][1] == -1 && dp_[n + n][n][0] == -1){
        cout << -1;
        return;
    }
    vector<char> res;
    int val = n,lst = 0;
    if(dp_[n + n][n][lst] == -1){
        lst = 1;
    }
    for(int i = n + n;i >= 1;i--){
        bool ok = false;
        if(lst == 0){
            res.push_back('A');
            ok = 1;
        }else res.push_back('B');
        lst = dp_[i][val][lst];
        val -= ok;
    }
    reverse(res.begin(),res.end());
    for(auto i:res){
        cout << i;
    }
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int T = 1;
//    cin >> T;
    while (T--)
        test();
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 126292 KB Output is correct
2 Correct 17 ms 126296 KB Output is correct
3 Correct 17 ms 126300 KB Output is correct
4 Correct 17 ms 126300 KB Output is correct
5 Correct 19 ms 126556 KB Output is correct
6 Correct 41 ms 126552 KB Output is correct
7 Correct 41 ms 126528 KB Output is correct
8 Correct 41 ms 126536 KB Output is correct
9 Correct 36 ms 126556 KB Output is correct
10 Correct 31 ms 126544 KB Output is correct
11 Correct 41 ms 126548 KB Output is correct
12 Correct 56 ms 126560 KB Output is correct
13 Correct 46 ms 126556 KB Output is correct
14 Correct 41 ms 126552 KB Output is correct
15 Correct 44 ms 126556 KB Output is correct
16 Correct 46 ms 126556 KB Output is correct
17 Correct 54 ms 126472 KB Output is correct
18 Correct 46 ms 126464 KB Output is correct
19 Correct 44 ms 126556 KB Output is correct
20 Correct 45 ms 126300 KB Output is correct
21 Correct 45 ms 126296 KB Output is correct
22 Correct 45 ms 126288 KB Output is correct
23 Correct 45 ms 126288 KB Output is correct
24 Correct 39 ms 126552 KB Output is correct
25 Correct 41 ms 126296 KB Output is correct
26 Correct 50 ms 126300 KB Output is correct
27 Correct 37 ms 126296 KB Output is correct
28 Correct 40 ms 126296 KB Output is correct
29 Correct 46 ms 126296 KB Output is correct
30 Correct 41 ms 126300 KB Output is correct
31 Correct 45 ms 126520 KB Output is correct
32 Correct 38 ms 126300 KB Output is correct
33 Correct 46 ms 126300 KB Output is correct

Subtask #2
0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 126292 KB Output is correct
2 Correct 17 ms 126296 KB Output is correct
3 Correct 17 ms 126300 KB Output is correct
4 Correct 17 ms 126300 KB Output is correct
5 Correct 19 ms 126556 KB Output is correct
6 Correct 41 ms 126552 KB Output is correct
7 Correct 41 ms 126528 KB Output is correct
8 Correct 41 ms 126536 KB Output is correct
9 Correct 36 ms 126556 KB Output is correct
10 Correct 31 ms 126544 KB Output is correct
11 Correct 41 ms 126548 KB Output is correct
12 Correct 56 ms 126560 KB Output is correct
13 Correct 46 ms 126556 KB Output is correct
14 Correct 41 ms 126552 KB Output is correct
15 Correct 44 ms 126556 KB Output is correct
16 Correct 46 ms 126556 KB Output is correct
17 Correct 54 ms 126472 KB Output is correct
18 Correct 46 ms 126464 KB Output is correct
19 Correct 44 ms 126556 KB Output is correct
20 Correct 45 ms 126300 KB Output is correct
21 Correct 45 ms 126296 KB Output is correct
22 Correct 45 ms 126288 KB Output is correct
23 Correct 45 ms 126288 KB Output is correct
24 Correct 39 ms 126552 KB Output is correct
25 Correct 41 ms 126296 KB Output is correct
26 Correct 50 ms 126300 KB Output is correct
27 Correct 37 ms 126296 KB Output is correct
28 Correct 40 ms 126296 KB Output is correct
29 Correct 46 ms 126296 KB Output is correct
30 Correct 41 ms 126300 KB Output is correct
31 Correct 45 ms 126520 KB Output is correct
32 Correct 38 ms 126300 KB Output is correct
33 Correct 46 ms 126300 KB Output is correct
34 Runtime error 115 ms 256080 KB Execution killed with signal 11
35 Halted 0 ms 0 KB -