oj.uz

답안 #482459

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
482459 2021-10-24T15:38:44 Z SirCovidThe19th 건물 4 (JOI20_building4) C++17
100 / 100
 767 ms 45516 KB 
#include <bits/stdc++.h>
using namespace std;

#define FOR(i, x, y) for (int i = x; i < y; i++)
#define pii pair<int, int>
#define f first
#define s second

const int mx = 1e6 + 5;

int n, A[mx][2]; pii dp[mx][2]; 

int main(){
    cin >> n; n *= 2; 
    FOR(i, 1, n + 1) cin >> A[i][0];
    FOR(i, 1, n + 1) cin >> A[i][1];

    dp[0][0] = dp[0][1] = {0, 0};
    FOR(i, 1, n + 1) FOR(k, 0, 2){
        dp[i][k] = {1e9, -1e9};
        FOR(prv, 0, 2) if (A[i][k] >= A[i - 1][prv]){
            dp[i][k].f = min(dp[i][k].f, dp[i - 1][prv].f + !k);
            dp[i][k].s = max(dp[i][k].s, dp[i - 1][prv].s + !k);
        }
    }
    vector<char> ans; int cnt = n / 2, cur = -1;
    for (int i = n; i; i--){
        auto ok = [&](int use){ 
            return (cnt >= dp[i][use].f and cnt <= dp[i][use].s) and 
                   (cur == -1 or A[i][use] <= A[i + 1][cur]); 
        };
        if (ok(0)) ans.push_back('A'), cnt--, cur = 0;
        else if (ok(1)) ans.push_back('B'), cur = 1;
        else{ cout<<-1<<endl; return 0; }
    }
    reverse(ans.begin(), ans.end());
    for (char ret : ans) cout<<ret;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 4 ms 460 KB Output is correct
6 Correct 3 ms 460 KB Output is correct
7 Correct 3 ms 460 KB Output is correct
8 Correct 3 ms 460 KB Output is correct
9 Correct 4 ms 460 KB Output is correct
10 Correct 3 ms 332 KB Output is correct
11 Correct 3 ms 460 KB Output is correct
12 Correct 3 ms 460 KB Output is correct
13 Correct 4 ms 448 KB Output is correct
14 Correct 4 ms 444 KB Output is correct
15 Correct 4 ms 460 KB Output is correct
16 Correct 3 ms 460 KB Output is correct
17 Correct 4 ms 496 KB Output is correct
18 Correct 5 ms 460 KB Output is correct
19 Correct 3 ms 400 KB Output is correct
20 Correct 2 ms 332 KB Output is correct
21 Correct 2 ms 332 KB Output is correct
22 Correct 2 ms 332 KB Output is correct
23 Correct 2 ms 332 KB Output is correct
24 Correct 4 ms 460 KB Output is correct
25 Correct 3 ms 332 KB Output is correct
26 Correct 3 ms 332 KB Output is correct
27 Correct 2 ms 332 KB Output is correct
28 Correct 2 ms 332 KB Output is correct
29 Correct 2 ms 332 KB Output is correct
30 Correct 3 ms 332 KB Output is correct
31 Correct 2 ms 332 KB Output is correct
32 Correct 2 ms 332 KB Output is correct
33 Correct 3 ms 332 KB Output is correct

Subtask #2
89.0 / 89.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 4 ms 460 KB Output is correct
6 Correct 3 ms 460 KB Output is correct
7 Correct 3 ms 460 KB Output is correct
8 Correct 3 ms 460 KB Output is correct
9 Correct 4 ms 460 KB Output is correct
10 Correct 3 ms 332 KB Output is correct
11 Correct 3 ms 460 KB Output is correct
12 Correct 3 ms 460 KB Output is correct
13 Correct 4 ms 448 KB Output is correct
14 Correct 4 ms 444 KB Output is correct
15 Correct 4 ms 460 KB Output is correct
16 Correct 3 ms 460 KB Output is correct
17 Correct 4 ms 496 KB Output is correct
18 Correct 5 ms 460 KB Output is correct
19 Correct 3 ms 400 KB Output is correct
20 Correct 2 ms 332 KB Output is correct
21 Correct 2 ms 332 KB Output is correct
22 Correct 2 ms 332 KB Output is correct
23 Correct 2 ms 332 KB Output is correct
24 Correct 4 ms 460 KB Output is correct
25 Correct 3 ms 332 KB Output is correct
26 Correct 3 ms 332 KB Output is correct
27 Correct 2 ms 332 KB Output is correct
28 Correct 2 ms 332 KB Output is correct
29 Correct 2 ms 332 KB Output is correct
30 Correct 3 ms 332 KB Output is correct
31 Correct 2 ms 332 KB Output is correct
32 Correct 2 ms 332 KB Output is correct
33 Correct 3 ms 332 KB Output is correct
34 Correct 707 ms 42560 KB Output is correct
35 Correct 705 ms 41892 KB Output is correct
36 Correct 688 ms 41232 KB Output is correct
37 Correct 695 ms 42168 KB Output is correct
38 Correct 682 ms 42036 KB Output is correct
39 Correct 680 ms 41420 KB Output is correct
40 Correct 748 ms 45240 KB Output is correct
41 Correct 690 ms 42276 KB Output is correct
42 Correct 719 ms 43708 KB Output is correct
43 Correct 746 ms 45240 KB Output is correct
44 Correct 757 ms 45244 KB Output is correct
45 Correct 748 ms 45228 KB Output is correct
46 Correct 745 ms 45516 KB Output is correct
47 Correct 711 ms 44452 KB Output is correct
48 Correct 716 ms 44088 KB Output is correct
49 Correct 715 ms 44972 KB Output is correct
50 Correct 727 ms 44384 KB Output is correct
51 Correct 735 ms 44332 KB Output is correct
52 Correct 446 ms 33376 KB Output is correct
53 Correct 414 ms 33464 KB Output is correct
54 Correct 408 ms 33464 KB Output is correct
55 Correct 486 ms 33172 KB Output is correct
56 Correct 767 ms 45360 KB Output is correct
57 Correct 606 ms 40244 KB Output is correct
58 Correct 610 ms 40380 KB Output is correct
59 Correct 603 ms 40480 KB Output is correct
60 Correct 583 ms 38364 KB Output is correct
61 Correct 622 ms 41020 KB Output is correct
62 Correct 636 ms 40372 KB Output is correct
63 Correct 635 ms 40860 KB Output is correct
64 Correct 624 ms 39492 KB Output is correct
65 Correct 698 ms 40884 KB Output is correct