답안 #896619

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
896619 2024-01-01T18:20:15 Z Andrey 건물 4 (JOI20_building4) C++14
100 / 100
182 ms 45388 KB
#include <bits/stdc++.h>
using namespace std;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    int n;
    cin >> n;
    vector<int> a(2*n+1);
    vector<int> b(2*n+1);
    vector<pair<int,int>> wow(2*n+1,{1e9,0});
    vector<pair<int,int>> wut(2*n+1,{1e9,0});
    for(int i = 1; i <= 2*n; i++) {
        cin >> a[i];
    }
    for(int i = 1; i <= 2*n; i++) {
        cin >> b[i];
    }
    wow[0] = {0,0};
    wut[0] = {0,0};
    for(int i = 1; i <= 2*n; i++) {
        if(a[i] >= a[i-1]) {
            wow[i] = {wow[i-1].first+1,wow[i-1].second+1};
        }
        if(a[i] >= b[i-1]) {
            wow[i] = {min(wow[i].first,wut[i-1].first+1),max(wow[i].second,wut[i-1].second+1)};
        }
        if(b[i] >= a[i-1]) {
            wut[i] = {wow[i-1].first,wow[i-1].second};
        }
        if(b[i] >= b[i-1]) {
            wut[i] = {min(wut[i].first,wut[i-1].first),max(wut[i].second,wut[i-1].second)};
        }
    }
    string ans = "";
    int x = -1,br = n;
    if(wow[2*n].second >= n && wow[2*n].first <= n) {
        x = 0;
        ans = "A";
        br--;
    }
    else if(wut[2*n].second >= n && wut[2*n].first <= n) {
        x = 1;
        ans = "B";
    }
    if(x == -1) {
        cout << -1 << "\n";
    }
    else {
        for(int i = 2*n-1; i >= 1; i--) {
            int c;
            if(x == 0) {
                c = a[i+1];
            }
            else {
                c = b[i+1];
            }
            if(wow[i].second >= br && wow[i].first <= br && a[i] <= c) {
                ans+='A';
                x = 0;
                br--;
            }
            else {
                ans+='B';
                x = 1;
            }
        }
        reverse(ans.begin(),ans.end());
        cout << ans;
    }

    return 0;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 456 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 600 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 600 KB Output is correct
23 Correct 1 ms 600 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 1 ms 572 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 456 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 600 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 600 KB Output is correct
23 Correct 1 ms 600 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 1 ms 572 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 164 ms 42488 KB Output is correct
35 Correct 165 ms 42140 KB Output is correct
36 Correct 155 ms 41340 KB Output is correct
37 Correct 159 ms 42244 KB Output is correct
38 Correct 149 ms 42084 KB Output is correct
39 Correct 152 ms 41484 KB Output is correct
40 Correct 168 ms 45008 KB Output is correct
41 Correct 166 ms 42316 KB Output is correct
42 Correct 162 ms 43788 KB Output is correct
43 Correct 171 ms 45180 KB Output is correct
44 Correct 169 ms 45196 KB Output is correct
45 Correct 172 ms 45384 KB Output is correct
46 Correct 182 ms 45192 KB Output is correct
47 Correct 159 ms 44364 KB Output is correct
48 Correct 168 ms 44184 KB Output is correct
49 Correct 162 ms 45136 KB Output is correct
50 Correct 170 ms 44428 KB Output is correct
51 Correct 170 ms 44360 KB Output is correct
52 Correct 118 ms 33656 KB Output is correct
53 Correct 117 ms 33612 KB Output is correct
54 Correct 109 ms 33608 KB Output is correct
55 Correct 109 ms 33272 KB Output is correct
56 Correct 163 ms 45388 KB Output is correct
57 Correct 137 ms 40268 KB Output is correct
58 Correct 138 ms 40608 KB Output is correct
59 Correct 160 ms 40712 KB Output is correct
60 Correct 129 ms 38412 KB Output is correct
61 Correct 143 ms 41204 KB Output is correct
62 Correct 137 ms 40492 KB Output is correct
63 Correct 169 ms 40952 KB Output is correct
64 Correct 138 ms 39696 KB Output is correct
65 Correct 142 ms 41136 KB Output is correct