oj.uz

답안 #482482

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
482482 2021-10-24T18:21:25 Z SirCovidThe19th 건물 4 (JOI20_building4) C++17
100 / 100
 792 ms 28596 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; }
    }
    for (int i = n - 1; ~i; i--) cout<<ans[i];
}

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 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 3 ms 460 KB Output is correct
6 Correct 3 ms 444 KB Output is correct
7 Correct 3 ms 332 KB Output is correct
8 Correct 3 ms 460 KB Output is correct
9 Correct 3 ms 460 KB Output is correct
10 Correct 3 ms 460 KB Output is correct
11 Correct 4 ms 460 KB Output is correct
12 Correct 4 ms 460 KB Output is correct
13 Correct 4 ms 460 KB Output is correct
14 Correct 3 ms 460 KB Output is correct
15 Correct 3 ms 460 KB Output is correct
16 Correct 3 ms 460 KB Output is correct
17 Correct 3 ms 460 KB Output is correct
18 Correct 3 ms 460 KB Output is correct
19 Correct 3 ms 460 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 2 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 3 ms 384 KB Output is correct
30 Correct 2 ms 332 KB Output is correct
31 Correct 2 ms 408 KB Output is correct
32 Correct 2 ms 332 KB Output is correct
33 Correct 2 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 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 3 ms 460 KB Output is correct
6 Correct 3 ms 444 KB Output is correct
7 Correct 3 ms 332 KB Output is correct
8 Correct 3 ms 460 KB Output is correct
9 Correct 3 ms 460 KB Output is correct
10 Correct 3 ms 460 KB Output is correct
11 Correct 4 ms 460 KB Output is correct
12 Correct 4 ms 460 KB Output is correct
13 Correct 4 ms 460 KB Output is correct
14 Correct 3 ms 460 KB Output is correct
15 Correct 3 ms 460 KB Output is correct
16 Correct 3 ms 460 KB Output is correct
17 Correct 3 ms 460 KB Output is correct
18 Correct 3 ms 460 KB Output is correct
19 Correct 3 ms 460 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 2 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 3 ms 384 KB Output is correct
30 Correct 2 ms 332 KB Output is correct
31 Correct 2 ms 408 KB Output is correct
32 Correct 2 ms 332 KB Output is correct
33 Correct 2 ms 332 KB Output is correct
34 Correct 732 ms 24868 KB Output is correct
35 Correct 717 ms 25176 KB Output is correct
36 Correct 685 ms 25364 KB Output is correct
37 Correct 702 ms 25400 KB Output is correct
38 Correct 715 ms 25408 KB Output is correct
39 Correct 670 ms 27092 KB Output is correct
40 Correct 740 ms 27212 KB Output is correct
41 Correct 724 ms 25828 KB Output is correct
42 Correct 715 ms 26460 KB Output is correct
43 Correct 747 ms 27276 KB Output is correct
44 Correct 755 ms 27288 KB Output is correct
45 Correct 756 ms 27356 KB Output is correct
46 Correct 792 ms 27200 KB Output is correct
47 Correct 710 ms 27316 KB Output is correct
48 Correct 720 ms 27212 KB Output is correct
49 Correct 756 ms 27188 KB Output is correct
50 Correct 746 ms 27244 KB Output is correct
51 Correct 756 ms 27372 KB Output is correct
52 Correct 457 ms 28120 KB Output is correct
53 Correct 432 ms 28060 KB Output is correct
54 Correct 430 ms 28128 KB Output is correct
55 Correct 402 ms 28088 KB Output is correct
56 Correct 775 ms 27356 KB Output is correct
57 Correct 618 ms 28472 KB Output is correct
58 Correct 616 ms 28484 KB Output is correct
59 Correct 631 ms 28580 KB Output is correct
60 Correct 585 ms 26972 KB Output is correct
61 Correct 633 ms 28596 KB Output is correct
62 Correct 620 ms 28200 KB Output is correct
63 Correct 627 ms 28592 KB Output is correct
64 Correct 608 ms 27832 KB Output is correct
65 Correct 621 ms 28580 KB Output is correct