답안 #261612

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
261612 2020-08-11T22:33:24 Z KCSC 건물 4 (JOI20_building4) C++14
100 / 100
1276 ms 45340 KB
#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

const int DIM = 1000005;

pair<int, int> seg[2][DIM];
char ans[DIM];
int arr[2][DIM];

void solve(int k, int n, int rem) {
    if (n == 0)
        cout << (ans + 1);
    else {
        if (k == 0)
            ans[n] = 'A';
        else
            ans[n] = 'B';
        if (arr[0][n - 1] <= arr[k][n] and seg[0][n - 1].first != -1 and
            seg[0][n - 1].first <= rem - (1 - k) and rem - (1 - k) <= seg[0][n - 1].second)
            solve(0, n - 1, rem - (1 - k));
        else
            solve(1, n - 1, rem - (1 - k));
    }
}

void update(pair<int, int> &s1, pair<int, int> &s2) {
    if (s2.first == -1)
        return;
    if (s1.first == -1)
        s1 = s2;
    else
        s1 = make_pair(min(s1.first, s2.first), max(s1.second, s2.second));
}

int main(void) {
  //  freopen("building4.in", "r", stdin);
  //  freopen("building4.out", "w", stdout);
    int n;
    cin >> n;
    for (int k = 0; k <= 1; ++k) {
        for (int i = 1; i <= n * 2; ++i) {
            cin >> arr[k][i];
            seg[k][i] = {-1, -1};
        }
    }
    seg[0][0] = {0, 0};
    for (int i = 1; i <= n * 2; ++i) {
        for (int k1 = 0; k1 <= 1; ++k1)
        for (int k2 = 0; k2 <= 1; ++k2)
            if (arr[k1][i - 1] <= arr[k2][i])
                update(seg[k2][i], seg[k1][i - 1]);
        if (seg[0][i].first != -1)
            ++seg[0][i].first, ++seg[0][i].second;
    }
  /*  for (int i = 0; i <= n * 2; ++i) {
        for (int k = 0; k <= 1; ++k)
            cout << seg[k][i].first << " " << seg[k][i].second << "    ";
        cout << endl;
    } */
    if (seg[0][n * 2].first != -1 and seg[0][n * 2].first <= n and seg[0][n * 2].second >= n)
        solve(0, n * 2, n);
    else if (seg[1][n * 2].first != -1 and seg[1][n * 2].first <= n and seg[1][n * 2].second >= n)
        solve(1, n * 2, n);
    else
        cout << -1 << "\n";
    return 0;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 6 ms 544 KB Output is correct
6 Correct 5 ms 512 KB Output is correct
7 Correct 5 ms 512 KB Output is correct
8 Correct 7 ms 512 KB Output is correct
9 Correct 5 ms 512 KB Output is correct
10 Correct 5 ms 512 KB Output is correct
11 Correct 6 ms 544 KB Output is correct
12 Correct 6 ms 512 KB Output is correct
13 Correct 6 ms 512 KB Output is correct
14 Correct 6 ms 512 KB Output is correct
15 Correct 7 ms 512 KB Output is correct
16 Correct 6 ms 512 KB Output is correct
17 Correct 5 ms 512 KB Output is correct
18 Correct 5 ms 512 KB Output is correct
19 Correct 6 ms 512 KB Output is correct
20 Correct 4 ms 512 KB Output is correct
21 Correct 3 ms 512 KB Output is correct
22 Correct 3 ms 512 KB Output is correct
23 Correct 4 ms 512 KB Output is correct
24 Correct 6 ms 512 KB Output is correct
25 Correct 4 ms 512 KB Output is correct
26 Correct 4 ms 512 KB Output is correct
27 Correct 4 ms 512 KB Output is correct
28 Correct 3 ms 512 KB Output is correct
29 Correct 5 ms 512 KB Output is correct
30 Correct 4 ms 512 KB Output is correct
31 Correct 4 ms 512 KB Output is correct
32 Correct 4 ms 512 KB Output is correct
33 Correct 4 ms 512 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 6 ms 544 KB Output is correct
6 Correct 5 ms 512 KB Output is correct
7 Correct 5 ms 512 KB Output is correct
8 Correct 7 ms 512 KB Output is correct
9 Correct 5 ms 512 KB Output is correct
10 Correct 5 ms 512 KB Output is correct
11 Correct 6 ms 544 KB Output is correct
12 Correct 6 ms 512 KB Output is correct
13 Correct 6 ms 512 KB Output is correct
14 Correct 6 ms 512 KB Output is correct
15 Correct 7 ms 512 KB Output is correct
16 Correct 6 ms 512 KB Output is correct
17 Correct 5 ms 512 KB Output is correct
18 Correct 5 ms 512 KB Output is correct
19 Correct 6 ms 512 KB Output is correct
20 Correct 4 ms 512 KB Output is correct
21 Correct 3 ms 512 KB Output is correct
22 Correct 3 ms 512 KB Output is correct
23 Correct 4 ms 512 KB Output is correct
24 Correct 6 ms 512 KB Output is correct
25 Correct 4 ms 512 KB Output is correct
26 Correct 4 ms 512 KB Output is correct
27 Correct 4 ms 512 KB Output is correct
28 Correct 3 ms 512 KB Output is correct
29 Correct 5 ms 512 KB Output is correct
30 Correct 4 ms 512 KB Output is correct
31 Correct 4 ms 512 KB Output is correct
32 Correct 4 ms 512 KB Output is correct
33 Correct 4 ms 512 KB Output is correct
34 Correct 1257 ms 42460 KB Output is correct
35 Correct 1189 ms 41956 KB Output is correct
36 Correct 1181 ms 41176 KB Output is correct
37 Correct 1192 ms 42104 KB Output is correct
38 Correct 1177 ms 42120 KB Output is correct
39 Correct 1121 ms 41228 KB Output is correct
40 Correct 1229 ms 44668 KB Output is correct
41 Correct 1170 ms 42180 KB Output is correct
42 Correct 1210 ms 43636 KB Output is correct
43 Correct 1261 ms 45176 KB Output is correct
44 Correct 1260 ms 45176 KB Output is correct
45 Correct 1274 ms 45172 KB Output is correct
46 Correct 1276 ms 45172 KB Output is correct
47 Correct 1224 ms 44280 KB Output is correct
48 Correct 1201 ms 44232 KB Output is correct
49 Correct 1231 ms 44796 KB Output is correct
50 Correct 1249 ms 44276 KB Output is correct
51 Correct 1249 ms 44428 KB Output is correct
52 Correct 694 ms 33432 KB Output is correct
53 Correct 686 ms 33528 KB Output is correct
54 Correct 662 ms 33400 KB Output is correct
55 Correct 661 ms 33272 KB Output is correct
56 Correct 1267 ms 45340 KB Output is correct
57 Correct 1020 ms 40180 KB Output is correct
58 Correct 1026 ms 40464 KB Output is correct
59 Correct 1032 ms 40336 KB Output is correct
60 Correct 974 ms 38504 KB Output is correct
61 Correct 1032 ms 40808 KB Output is correct
62 Correct 1016 ms 40440 KB Output is correct
63 Correct 1037 ms 41040 KB Output is correct
64 Correct 996 ms 39476 KB Output is correct
65 Correct 1079 ms 41064 KB Output is correct