답안 #212741

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
212741 2020-03-24T08:38:33 Z Alexa2001 건물 4 (JOI20_building4) C++17
100 / 100
362 ms 64376 KB
#include <bits/stdc++.h>

using namespace std;

const int Nmax = 1e6 + 5;

int A[Nmax], B[Nmax], s[Nmax][2], f[Nmax][2];
bool ok[Nmax][2];

char ans[Nmax];
int n;


void min_to(int &x, int y)
{
    if(x > y) x = y;
}
void max_to(int &x, int y)
{
    if(x < y) x = y;
}

void solve(int i, int y, int z)
{
    if(!z) ans[i] = 'A', y--;
        else ans[i] = 'B';

    if(i == 1)
    {
        cout << (ans+1) << '\n';
        return;
    }

    if(!z)
    {
        if(A[i] >= A[i-1] && ok[i-1][0] && s[i-1][0] <= y && y <= f[i-1][0])
            solve(i-1, y, 0);
        else if(A[i] >= B[i-1] && ok[i-1][1] && s[i-1][1] <= y && y <= f[i-1][1])
            solve(i-1, y, 1);
        else assert(0);

        return;
    }
    else
    {
        if(B[i] >= A[i-1] && ok[i-1][0] && s[i-1][0] <= y && y <= f[i-1][0])
            solve(i-1, y, 0);
        else if(B[i] >= B[i-1] && ok[i-1][1] && s[i-1][1] <= y && y <= f[i-1][1])
            solve(i-1, y, 1);
        else assert(0);

        return;
    }
}

int main()
{
   // freopen("input", "r", stdin);
    cin.sync_with_stdio(false); cin.tie(0);

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

    s[1][0] = f[1][0] = 1;
    s[1][1] = f[1][1] = 0;

    ok[1][0] = ok[1][1] = 1;

    for(i=2; i<=2*n; ++i)
    {
        s[i][0] = s[i][1] = 2*n+1;
        f[i][0] = f[i][1] = -1;

        if(A[i] >= A[i-1] && ok[i-1][0])
            min_to(s[i][0], s[i-1][0] + 1), max_to(f[i][0], f[i-1][0] + 1);

        if(A[i] >= B[i-1] && ok[i-1][1])
            min_to(s[i][0], s[i-1][1] + 1), max_to(f[i][0], f[i-1][1] + 1);

        if(B[i] >= A[i-1] && ok[i-1][0])
            min_to(s[i][1], s[i-1][0]), max_to(f[i][1], f[i-1][0]);

        if(B[i] >= B[i-1] && ok[i-1][1])
            min_to(s[i][1], s[i-1][1]), max_to(f[i][1], f[i-1][1]);


        ok[i][0] = (s[i][0] <= f[i][0]);
        ok[i][1] = (s[i][1] <= f[i][1]);
    }

    if(s[2*n][0] <= n && n <= f[2*n][0])
        solve(2*n, n, 0);
    else if(s[2*n][1] <= n && n <= f[2*n][1])
        solve(2*n, n, 1);
    else cout << "-1\n";

    return 0;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 6 ms 512 KB Output is correct
6 Correct 6 ms 640 KB Output is correct
7 Correct 6 ms 640 KB Output is correct
8 Correct 8 ms 640 KB Output is correct
9 Correct 6 ms 640 KB Output is correct
10 Correct 6 ms 640 KB Output is correct
11 Correct 7 ms 640 KB Output is correct
12 Correct 6 ms 640 KB Output is correct
13 Correct 6 ms 640 KB Output is correct
14 Correct 6 ms 768 KB Output is correct
15 Correct 6 ms 640 KB Output is correct
16 Correct 6 ms 512 KB Output is correct
17 Correct 6 ms 768 KB Output is correct
18 Correct 6 ms 640 KB Output is correct
19 Correct 6 ms 768 KB Output is correct
20 Correct 6 ms 640 KB Output is correct
21 Correct 5 ms 640 KB Output is correct
22 Correct 5 ms 640 KB Output is correct
23 Correct 5 ms 640 KB Output is correct
24 Correct 6 ms 640 KB Output is correct
25 Correct 6 ms 640 KB Output is correct
26 Correct 5 ms 640 KB Output is correct
27 Correct 6 ms 640 KB Output is correct
28 Correct 5 ms 640 KB Output is correct
29 Correct 6 ms 640 KB Output is correct
30 Correct 5 ms 640 KB Output is correct
31 Correct 6 ms 640 KB Output is correct
32 Correct 6 ms 640 KB Output is correct
33 Correct 6 ms 640 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 6 ms 512 KB Output is correct
6 Correct 6 ms 640 KB Output is correct
7 Correct 6 ms 640 KB Output is correct
8 Correct 8 ms 640 KB Output is correct
9 Correct 6 ms 640 KB Output is correct
10 Correct 6 ms 640 KB Output is correct
11 Correct 7 ms 640 KB Output is correct
12 Correct 6 ms 640 KB Output is correct
13 Correct 6 ms 640 KB Output is correct
14 Correct 6 ms 768 KB Output is correct
15 Correct 6 ms 640 KB Output is correct
16 Correct 6 ms 512 KB Output is correct
17 Correct 6 ms 768 KB Output is correct
18 Correct 6 ms 640 KB Output is correct
19 Correct 6 ms 768 KB Output is correct
20 Correct 6 ms 640 KB Output is correct
21 Correct 5 ms 640 KB Output is correct
22 Correct 5 ms 640 KB Output is correct
23 Correct 5 ms 640 KB Output is correct
24 Correct 6 ms 640 KB Output is correct
25 Correct 6 ms 640 KB Output is correct
26 Correct 5 ms 640 KB Output is correct
27 Correct 6 ms 640 KB Output is correct
28 Correct 5 ms 640 KB Output is correct
29 Correct 6 ms 640 KB Output is correct
30 Correct 5 ms 640 KB Output is correct
31 Correct 6 ms 640 KB Output is correct
32 Correct 6 ms 640 KB Output is correct
33 Correct 6 ms 640 KB Output is correct
34 Correct 314 ms 25652 KB Output is correct
35 Correct 329 ms 55128 KB Output is correct
36 Correct 330 ms 54264 KB Output is correct
37 Correct 320 ms 55288 KB Output is correct
38 Correct 306 ms 55288 KB Output is correct
39 Correct 309 ms 55544 KB Output is correct
40 Correct 340 ms 59132 KB Output is correct
41 Correct 311 ms 56440 KB Output is correct
42 Correct 346 ms 57720 KB Output is correct
43 Correct 351 ms 59424 KB Output is correct
44 Correct 351 ms 59384 KB Output is correct
45 Correct 362 ms 59640 KB Output is correct
46 Correct 342 ms 59384 KB Output is correct
47 Correct 334 ms 59384 KB Output is correct
48 Correct 321 ms 59384 KB Output is correct
49 Correct 342 ms 59384 KB Output is correct
50 Correct 345 ms 59384 KB Output is correct
51 Correct 341 ms 59256 KB Output is correct
52 Correct 223 ms 64376 KB Output is correct
53 Correct 230 ms 64376 KB Output is correct
54 Correct 213 ms 64376 KB Output is correct
55 Correct 215 ms 64120 KB Output is correct
56 Correct 344 ms 59384 KB Output is correct
57 Correct 287 ms 62120 KB Output is correct
58 Correct 302 ms 62584 KB Output is correct
59 Correct 294 ms 62328 KB Output is correct
60 Correct 284 ms 58616 KB Output is correct
61 Correct 301 ms 62200 KB Output is correct
62 Correct 299 ms 61176 KB Output is correct
63 Correct 299 ms 62200 KB Output is correct
64 Correct 313 ms 60028 KB Output is correct
65 Correct 293 ms 61688 KB Output is correct