oj.uz

답안 #572506

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
572506 2022-06-04T14:23:33 Z Lucpp 건물 4 (JOI20_building4) C++17
100 / 100
 344 ms 48260 KB 
#include <bits/stdc++.h>
using namespace std;

const int INF = 1e7;

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin >> n;
    vector<vector<int>> v(2, vector<int>(2*n));
    for(int b = 0; b < 2; ++b) for(int i = 0; i < 2*n; ++i) cin >> v[1-b][i];
    vector<vector<int>> mi(2, vector<int>(2*n, INF)), ma(2, vector<int>(2*n, -INF));
    mi[0][2*n-1] = ma[0][2*n-1] = 0;
    mi[1][2*n-1] = ma[1][2*n-1] = 1;
    for(int i = 2*n-2; i >= 0; --i){
        for(int j = 0; j < 2; ++j){
            for(int k = 0; k < 2; ++k){
                if(v[j][i] <= v[k][i+1]){
                    mi[j][i] = min(mi[j][i], mi[k][i+1]+j);
                    ma[j][i] = max(ma[j][i], ma[k][i+1]+j);
                }
            }
        }
    }
    string ans;
    if(mi[0][0] <= n && n <= ma[0][0]) ans += 'B';
    else if(mi[1][0] <= n && n <= ma[1][0]) ans += 'A';
    if(ans.empty()) cout << "-1\n";
    else{
        int j = (ans=="A");
        int cnt = n-j;
        for(int i = 1; i < 2*n; ++i){
            for(int k = 0; k < 2; ++k){
                if(v[j][i-1] <= v[k][i]){
                    if(mi[k][i] <= cnt && cnt <= ma[k][i]){
                        cnt -= k;
                        j = k;
                        ans += 'A'+(1-k);
                        break;
                    }
                }
            }
        }
        cout << ans << "\n";
    }
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 2 ms 424 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 2 ms 476 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 2 ms 460 KB Output is correct
12 Correct 2 ms 460 KB Output is correct
13 Correct 2 ms 468 KB Output is correct
14 Correct 2 ms 464 KB Output is correct
15 Correct 2 ms 444 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 2 ms 460 KB Output is correct
18 Correct 2 ms 484 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 2 ms 340 KB Output is correct
21 Correct 2 ms 400 KB Output is correct
22 Correct 2 ms 468 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 2 ms 448 KB Output is correct
25 Correct 2 ms 412 KB Output is correct
26 Correct 2 ms 460 KB Output is correct
27 Correct 2 ms 544 KB Output is correct
28 Correct 2 ms 408 KB Output is correct
29 Correct 2 ms 416 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 2 ms 460 KB Output is correct
32 Correct 2 ms 336 KB Output is correct
33 Correct 1 ms 468 KB Output is correct

Subtask #2
89.0 / 89.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 2 ms 424 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 2 ms 476 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 2 ms 460 KB Output is correct
12 Correct 2 ms 460 KB Output is correct
13 Correct 2 ms 468 KB Output is correct
14 Correct 2 ms 464 KB Output is correct
15 Correct 2 ms 444 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 2 ms 460 KB Output is correct
18 Correct 2 ms 484 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 2 ms 340 KB Output is correct
21 Correct 2 ms 400 KB Output is correct
22 Correct 2 ms 468 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 2 ms 448 KB Output is correct
25 Correct 2 ms 412 KB Output is correct
26 Correct 2 ms 460 KB Output is correct
27 Correct 2 ms 544 KB Output is correct
28 Correct 2 ms 408 KB Output is correct
29 Correct 2 ms 416 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 2 ms 460 KB Output is correct
32 Correct 2 ms 336 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 285 ms 46184 KB Output is correct
35 Correct 322 ms 44460 KB Output is correct
36 Correct 333 ms 43864 KB Output is correct
37 Correct 296 ms 44740 KB Output is correct
38 Correct 258 ms 44724 KB Output is correct
39 Correct 252 ms 43928 KB Output is correct
40 Correct 267 ms 47432 KB Output is correct
41 Correct 271 ms 44904 KB Output is correct
42 Correct 240 ms 46252 KB Output is correct
43 Correct 276 ms 47964 KB Output is correct
44 Correct 295 ms 47976 KB Output is correct
45 Correct 282 ms 47900 KB Output is correct
46 Correct 244 ms 47960 KB Output is correct
47 Correct 324 ms 46592 KB Output is correct
48 Correct 327 ms 45860 KB Output is correct
49 Correct 292 ms 47116 KB Output is correct
50 Correct 338 ms 47132 KB Output is correct
51 Correct 344 ms 47140 KB Output is correct
52 Correct 217 ms 36288 KB Output is correct
53 Correct 209 ms 36304 KB Output is correct
54 Correct 199 ms 36296 KB Output is correct
55 Correct 169 ms 36036 KB Output is correct
56 Correct 221 ms 48260 KB Output is correct
57 Correct 203 ms 43060 KB Output is correct
58 Correct 216 ms 43184 KB Output is correct
59 Correct 220 ms 43184 KB Output is correct
60 Correct 199 ms 41036 KB Output is correct
61 Correct 210 ms 43724 KB Output is correct
62 Correct 232 ms 43036 KB Output is correct
63 Correct 236 ms 43444 KB Output is correct
64 Correct 218 ms 42216 KB Output is correct
65 Correct 230 ms 43668 KB Output is correct