oj.uz

답안 #659423

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
659423 2022-11-17T17:16:02 Z Ronin13 건물 4 (JOI20_building4) C++14
100 / 100
 747 ms 45376 KB 
#include <bits/stdc++.h>
#define ll long long
#define f first
#define s second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define epb emplace_back
#define ull unsigned ll
using namespace std;

pii merg(pii a, pii b){
    return {min(a.f, b.f), max(a.s, b.s)};
}

int main(){
    #ifndef ONLINE_JUDGE
    //freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);
    #endif // ONLINE_JUDGE
    int n; cin >> n;
    int a[2 * n + 1][2];
    for(int j = 0; j < 2; j++){
        for(int i = 1; i <= 2 * n; i++)
            cin >> a[i][j];
    }
    pii dp[2 * n + 1][2];
    dp[1][0] = {0, 0};
    dp[1][1] = {1, 1};
    for(int i  = 2; i <= 2 * n; i++){
        for(int j = 0; j < 2; j++){
            pii x = {1e9, -1e9};
            pii y = {1e9, -1e9};
            if(a[i][j] >= a[i - 1][0]){
                x = {dp[i - 1][0].f + j, dp[i - 1][0].s + j};
            }
            if(a[i][j] >= a[i - 1][1]){
                y = {dp[i - 1][1].f + j, dp[i - 1][1].s + j};
            }
            dp[i][j] = merg(x, y);
        }
    }
    /*for(int i = 1; i <= 2 * n; i++){
        for(int j = 0; j < 2; j++){
            cout << dp[i][j].f << ' ' << dp[i][j].s << " ";
        }
        cout << "\n";
    }*/
    int last;
    int cur = n;
    string ans = "";
    if(dp[2 * n][0].f > n || dp[2 * n][0].s < n){
        if(dp[2 * n][1].f > n || dp[2 * n][1].s < n){
            cout << -1 << "\n";
            return 0;
        }
        last = 1;
        cur--;
        ans += 'B';
    }
    else{
        last = 0;
        ans += 'A';
    }
    for(int i = 2 * n - 1; i >= 1; i--){
        for(int j = 0; j < 2; j++){
            if(a[i][j] > a[i + 1][last]) continue;
            if(dp[i][j].f <= cur && dp[i][j].s >= cur){
                last = j;
                cur -= j;
                break;
            }
        }
        if(last) ans += 'B';
        else ans += 'A';
    }
    reverse(ans.begin(), ans.end());
    cout << ans;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 4 ms 440 KB Output is correct
7 Correct 3 ms 440 KB Output is correct
8 Correct 3 ms 388 KB Output is correct
9 Correct 3 ms 468 KB Output is correct
10 Correct 3 ms 340 KB Output is correct
11 Correct 3 ms 468 KB Output is correct
12 Correct 3 ms 440 KB Output is correct
13 Correct 4 ms 400 KB Output is correct
14 Correct 3 ms 372 KB Output is correct
15 Correct 4 ms 468 KB Output is correct
16 Correct 4 ms 396 KB Output is correct
17 Correct 3 ms 468 KB Output is correct
18 Correct 3 ms 444 KB Output is correct
19 Correct 3 ms 468 KB Output is correct
20 Correct 2 ms 436 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 2 ms 312 KB Output is correct
24 Correct 4 ms 436 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 2 ms 340 KB Output is correct
27 Correct 2 ms 340 KB Output is correct
28 Correct 3 ms 352 KB Output is correct
29 Correct 2 ms 340 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 2 ms 340 KB Output is correct
32 Correct 2 ms 356 KB Output is correct
33 Correct 3 ms 436 KB Output is correct

Subtask #2
89.0 / 89.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 4 ms 440 KB Output is correct
7 Correct 3 ms 440 KB Output is correct
8 Correct 3 ms 388 KB Output is correct
9 Correct 3 ms 468 KB Output is correct
10 Correct 3 ms 340 KB Output is correct
11 Correct 3 ms 468 KB Output is correct
12 Correct 3 ms 440 KB Output is correct
13 Correct 4 ms 400 KB Output is correct
14 Correct 3 ms 372 KB Output is correct
15 Correct 4 ms 468 KB Output is correct
16 Correct 4 ms 396 KB Output is correct
17 Correct 3 ms 468 KB Output is correct
18 Correct 3 ms 444 KB Output is correct
19 Correct 3 ms 468 KB Output is correct
20 Correct 2 ms 436 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 2 ms 312 KB Output is correct
24 Correct 4 ms 436 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 2 ms 340 KB Output is correct
27 Correct 2 ms 340 KB Output is correct
28 Correct 3 ms 352 KB Output is correct
29 Correct 2 ms 340 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 2 ms 340 KB Output is correct
32 Correct 2 ms 356 KB Output is correct
33 Correct 3 ms 436 KB Output is correct
34 Correct 711 ms 42424 KB Output is correct
35 Correct 695 ms 41912 KB Output is correct
36 Correct 688 ms 41384 KB Output is correct
37 Correct 667 ms 42128 KB Output is correct
38 Correct 673 ms 42168 KB Output is correct
39 Correct 634 ms 41312 KB Output is correct
40 Correct 696 ms 44640 KB Output is correct
41 Correct 651 ms 42212 KB Output is correct
42 Correct 697 ms 43604 KB Output is correct
43 Correct 716 ms 45236 KB Output is correct
44 Correct 724 ms 45220 KB Output is correct
45 Correct 747 ms 45240 KB Output is correct
46 Correct 725 ms 45352 KB Output is correct
47 Correct 686 ms 44332 KB Output is correct
48 Correct 674 ms 44076 KB Output is correct
49 Correct 696 ms 44952 KB Output is correct
50 Correct 692 ms 44752 KB Output is correct
51 Correct 692 ms 44352 KB Output is correct
52 Correct 398 ms 33420 KB Output is correct
53 Correct 396 ms 33420 KB Output is correct
54 Correct 383 ms 33472 KB Output is correct
55 Correct 367 ms 33216 KB Output is correct
56 Correct 713 ms 45376 KB Output is correct
57 Correct 571 ms 40316 KB Output is correct
58 Correct 575 ms 40384 KB Output is correct
59 Correct 619 ms 40360 KB Output is correct
60 Correct 552 ms 38404 KB Output is correct
61 Correct 599 ms 40836 KB Output is correct
62 Correct 581 ms 40476 KB Output is correct
63 Correct 618 ms 40976 KB Output is correct
64 Correct 606 ms 39556 KB Output is correct
65 Correct 602 ms 40880 KB Output is correct