oj.uz

답안 #384425

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
384425 2021-04-01T16:01:07 Z Sorting 건물 4 (JOI20_building4) C++17
100 / 100
 304 ms 58860 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3")

using namespace std;

const int N = 1e6 + 3;

pair<int, int> dp[N][2];
int n, a[N][2];

pair<int, int> merge(const pair<int, int> &l, const pair<int, int> &r){
    if(l == pair{1, 0} || r == pair{1, 0}) return (l == pair{1, 0}) ? r : l;
    return {min(l.first, r.first), max(l.second, r.second)};
}

void output(int i, int j, int target = n / 2){
    if(i == 0) return;
    target -= j;
    if(dp[i - 1][0].first <= target && target <= dp[i - 1][0].second && a[i - 1][0] <= a[i][j])
        output(i - 1, 0, target);
    else
        output(i - 1, 1, target);
    
    cout << (j ? "B" : "A");
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> n;
    n *= 2;
    for(int i = 1; i <= n; ++i) cin >> a[i][0];
    for(int i = 1; i <= n; ++i) cin >> a[i][1];

    dp[1][0] = {0, 0};
    dp[1][1] = {1, 1};

    for(int i = 2; i <= n; ++i)
        for(int j = 0; j <= 1; ++j){
            auto &ans = dp[i][j];
            ans = {1, 0};
            if(a[i - 1][0] <= a[i][j])
                ans = merge(ans, dp[i - 1][0]);
            if(a[i - 1][1] <= a[i][j])
                ans = merge(ans, dp[i - 1][1]);
            if(ans != pair{1, 0} && j){
                ans.first++;
                ans.second++;
            }
            //cout << ans.first << " " << ans.second << " - " << i << " " << j << endl; 
        }

    if(dp[n][0].first <= n / 2 && n / 2 <= dp[n][0].second)
        output(n, 0);
    else if(dp[n][1].first <= n / 2 && n / 2 <= dp[n][1].second)
        output(n, 1);
    else
        cout << "-1";
}

Subtask #1
11.0 / 11.0

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

Subtask #2
89.0 / 89.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 2 ms 492 KB Output is correct
6 Correct 2 ms 492 KB Output is correct
7 Correct 2 ms 492 KB Output is correct
8 Correct 2 ms 492 KB Output is correct
9 Correct 2 ms 492 KB Output is correct
10 Correct 2 ms 492 KB Output is correct
11 Correct 2 ms 492 KB Output is correct
12 Correct 2 ms 492 KB Output is correct
13 Correct 2 ms 492 KB Output is correct
14 Correct 2 ms 492 KB Output is correct
15 Correct 2 ms 492 KB Output is correct
16 Correct 2 ms 492 KB Output is correct
17 Correct 2 ms 492 KB Output is correct
18 Correct 2 ms 512 KB Output is correct
19 Correct 3 ms 492 KB Output is correct
20 Correct 2 ms 492 KB Output is correct
21 Correct 2 ms 492 KB Output is correct
22 Correct 2 ms 492 KB Output is correct
23 Correct 2 ms 492 KB Output is correct
24 Correct 2 ms 492 KB Output is correct
25 Correct 2 ms 492 KB Output is correct
26 Correct 2 ms 492 KB Output is correct
27 Correct 2 ms 492 KB Output is correct
28 Correct 2 ms 492 KB Output is correct
29 Correct 3 ms 492 KB Output is correct
30 Correct 2 ms 492 KB Output is correct
31 Correct 2 ms 492 KB Output is correct
32 Correct 2 ms 492 KB Output is correct
33 Correct 2 ms 492 KB Output is correct
34 Correct 242 ms 23532 KB Output is correct
35 Correct 276 ms 39020 KB Output is correct
36 Correct 272 ms 40812 KB Output is correct
37 Correct 278 ms 39148 KB Output is correct
38 Correct 266 ms 39276 KB Output is correct
39 Correct 268 ms 45548 KB Output is correct
40 Correct 292 ms 41820 KB Output is correct
41 Correct 275 ms 42348 KB Output is correct
42 Correct 299 ms 53228 KB Output is correct
43 Correct 298 ms 41964 KB Output is correct
44 Correct 304 ms 41964 KB Output is correct
45 Correct 304 ms 41964 KB Output is correct
46 Correct 284 ms 41968 KB Output is correct
47 Correct 294 ms 57844 KB Output is correct
48 Correct 289 ms 58860 KB Output is correct
49 Correct 281 ms 41964 KB Output is correct
50 Correct 300 ms 54252 KB Output is correct
51 Correct 302 ms 54252 KB Output is correct
52 Correct 231 ms 48108 KB Output is correct
53 Correct 232 ms 48236 KB Output is correct
54 Correct 219 ms 48236 KB Output is correct
55 Correct 221 ms 47852 KB Output is correct
56 Correct 283 ms 41964 KB Output is correct
57 Correct 267 ms 51564 KB Output is correct
58 Correct 259 ms 51820 KB Output is correct
59 Correct 260 ms 51564 KB Output is correct
60 Correct 246 ms 49388 KB Output is correct
61 Correct 269 ms 51436 KB Output is correct
62 Correct 259 ms 50924 KB Output is correct
63 Correct 270 ms 51436 KB Output is correct
64 Correct 251 ms 50284 KB Output is correct
65 Correct 274 ms 51436 KB Output is correct