oj.uz

답안 #824980

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
824980 2023-08-14T12:48:14 Z phoenix 건물 4 (JOI20_building4) C++17
100 / 100
 204 ms 45624 KB 
#include<bits/stdc++.h>

using namespace std;
using ll = long long;

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int n;
    cin >> n;
    int a[2 * n][2];
    for(int i = 0; i < 2 * n; i++)  
        cin >> a[i][0];
    for(int i = 0; i < 2 * n; i++)  
        cin >> a[i][1];
    pair<int, int> dp[2 * n][2];
    dp[0][0] = {0, 0};
    dp[0][1] = {1, 1};
    for(int i = 1; i < 2 * n; i++) {
        dp[i][0] = dp[i][1] = {2 * n + 1, -1};
        for(int t = 0; t <= 1; t++) {
            for(int p = 0; p <= 1; p++) {
                if(a[i][t] >= a[i - 1][p]) {
                    dp[i][t].first = min(dp[i][t].first, dp[i - 1][p].first + t);
                    dp[i][t].second = max(dp[i][t].second, dp[i - 1][p].second + t);
                }
            }
        }
    }
    int it = -1, k = n;
    for(int t = 0; t <= 1; t++) {
        if(dp[2 * n - 1][t].first <= n && n <= dp[2 * n - 1][t].second) {
            it = t;
            break;
        }
    }
    if(it == -1) {
        cout << -1;
        return 0;
    }
    string res;
    for(int i = 2 * n - 1; i >= 0; i--) {
        res += (it ? 'B' : 'A');
        if(!i) break;
        for(int p = 0; p <= 1; p++) {
            if(a[i][it] >= a[i - 1][p] && (dp[i - 1][p].first <= k - it && k - it <= dp[i - 1][p].second)) {
                k -= it;
                it = p;
                break;
            }
        }
    }
    reverse(res.begin(), res.end());
    cout << res;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 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 1 ms 468 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 1 ms 408 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 2 ms 456 KB Output is correct
18 Correct 1 ms 456 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 372 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 2 ms 468 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 464 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 464 KB Output is correct

Subtask #2
89.0 / 89.0

# 결과 실행 시간 메모리 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 1 ms 468 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 1 ms 408 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 2 ms 456 KB Output is correct
18 Correct 1 ms 456 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 372 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 2 ms 468 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 464 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 464 KB Output is correct
34 Correct 188 ms 24728 KB Output is correct
35 Correct 168 ms 41996 KB Output is correct
36 Correct 165 ms 41284 KB Output is correct
37 Correct 165 ms 42120 KB Output is correct
38 Correct 157 ms 42120 KB Output is correct
39 Correct 157 ms 41336 KB Output is correct
40 Correct 175 ms 44828 KB Output is correct
41 Correct 159 ms 42316 KB Output is correct
42 Correct 194 ms 43644 KB Output is correct
43 Correct 204 ms 45224 KB Output is correct
44 Correct 201 ms 45252 KB Output is correct
45 Correct 186 ms 45364 KB Output is correct
46 Correct 168 ms 45220 KB Output is correct
47 Correct 165 ms 44288 KB Output is correct
48 Correct 167 ms 44096 KB Output is correct
49 Correct 173 ms 44992 KB Output is correct
50 Correct 188 ms 44436 KB Output is correct
51 Correct 180 ms 44336 KB Output is correct
52 Correct 130 ms 33460 KB Output is correct
53 Correct 123 ms 33452 KB Output is correct
54 Correct 117 ms 33456 KB Output is correct
55 Correct 114 ms 33160 KB Output is correct
56 Correct 174 ms 45624 KB Output is correct
57 Correct 143 ms 40260 KB Output is correct
58 Correct 143 ms 40380 KB Output is correct
59 Correct 169 ms 40368 KB Output is correct
60 Correct 144 ms 38432 KB Output is correct
61 Correct 157 ms 40860 KB Output is correct
62 Correct 145 ms 40288 KB Output is correct
63 Correct 152 ms 40884 KB Output is correct
64 Correct 147 ms 39528 KB Output is correct
65 Correct 148 ms 40900 KB Output is correct