oj.uz

답안 #427493

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
427493 2021-06-14T16:10:35 Z blue 건물 4 (JOI20_building4) C++17
100 / 100
 757 ms 40708 KB 
#include <iostream>
using namespace std;

/*
Let us sort all the 4N coloring plans together, first by height then by building index.

Out of this sequence, we have to choose 2N elements such that:
    No two coloring plans for a single building are chosen.

*/

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    
    int N;
    cin >> N;

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

    A[0] = B[0] = 0;
    int lo[2*N + 1][2], hi[2*N + 1][2]; //lower & upper limits on number of A buildings.

    lo[0][0] = hi[0][0] = 0;
    lo[0][1] = hi[0][1] = 0;

    for(int i = 1; i <= 2*N; i++)
    {
        lo[i][0] = lo[i][1] = 1e9;
        hi[i][0] = hi[i][1] = -1e9;

        if(A[i-1] <= A[i])
        {
            hi[i][0] = max(hi[i][0], hi[i-1][0] + 1);
            lo[i][0] = min(lo[i][0], lo[i-1][0] + 1);
        }

        if(B[i-1] <= A[i])
        {
            hi[i][0] = max(hi[i][0], hi[i-1][1] + 1);
            lo[i][0] = min(lo[i][0], lo[i-1][1] + 1);
        }

        if(A[i-1] <= B[i])
        {
            hi[i][1] = max(hi[i][1], hi[i-1][0]);
            lo[i][1] = min(lo[i][1], lo[i-1][0]);
        }

        if(B[i-1] <= B[i])
        {
            hi[i][1] = max(hi[i][1], hi[i-1][1]);
            lo[i][1] = min(lo[i][1], lo[i-1][1]);
        }

        // cerr << "i = " << i << '\n';
        // cerr << lo[i][0] << ' ' << hi[i][0] << " | " << lo[i][1] << ' ' << hi[i][1] << '\n';
    }

    if(!(lo[2*N][0] <= N && N <= hi[2*N][0]) && !(lo[2*N][1] <= N && N <= hi[2*N][1]))
    {
        cout << "-1\n";
        return 0;
    }

    string res(2*N, '.');

    int i = 2*N;
    int lb = (lo[i][1] <= N && N <= hi[i][1]);
    int buildA = N;

    for(int i = 2*N; i >= 1; i--)
    {
        if(lb == 0)
        {
            res[i-1] = 'A';
            buildA--;
        }
        else res[i-1] = 'B';

        if(lb == 0)
        {
            if(A[i-1] <= A[i] && lo[i-1][0] <= buildA && buildA <= hi[i-1][0])
                lb = 0;
            else
                lb = 1;
        }
        else
        {
            if(A[i-1] <= B[i] && lo[i-1][0] <= buildA && buildA <= hi[i-1][0])
                lb = 0;
            else
                lb = 1;
        }
    }

    cout << res << '\n';
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 2 ms 204 KB Output is correct
5 Correct 2 ms 460 KB Output is correct
6 Correct 2 ms 460 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 3 ms 388 KB Output is correct
9 Correct 2 ms 400 KB Output is correct
10 Correct 1 ms 332 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 444 KB Output is correct
14 Correct 3 ms 440 KB Output is correct
15 Correct 3 ms 460 KB Output is correct
16 Correct 4 ms 436 KB Output is correct
17 Correct 2 ms 460 KB Output is correct
18 Correct 2 ms 460 KB Output is correct
19 Correct 2 ms 444 KB Output is correct
20 Correct 2 ms 332 KB Output is correct
21 Correct 3 ms 324 KB Output is correct
22 Correct 2 ms 368 KB Output is correct
23 Correct 2 ms 368 KB Output is correct
24 Correct 2 ms 444 KB Output is correct
25 Correct 2 ms 356 KB Output is correct
26 Correct 2 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 2 ms 316 KB Output is correct
29 Correct 2 ms 332 KB Output is correct
30 Correct 2 ms 308 KB Output is correct
31 Correct 2 ms 332 KB Output is correct
32 Correct 2 ms 352 KB Output is correct
33 Correct 1 ms 448 KB Output is correct

Subtask #2
89.0 / 89.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 2 ms 204 KB Output is correct
5 Correct 2 ms 460 KB Output is correct
6 Correct 2 ms 460 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 3 ms 388 KB Output is correct
9 Correct 2 ms 400 KB Output is correct
10 Correct 1 ms 332 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 444 KB Output is correct
14 Correct 3 ms 440 KB Output is correct
15 Correct 3 ms 460 KB Output is correct
16 Correct 4 ms 436 KB Output is correct
17 Correct 2 ms 460 KB Output is correct
18 Correct 2 ms 460 KB Output is correct
19 Correct 2 ms 444 KB Output is correct
20 Correct 2 ms 332 KB Output is correct
21 Correct 3 ms 324 KB Output is correct
22 Correct 2 ms 368 KB Output is correct
23 Correct 2 ms 368 KB Output is correct
24 Correct 2 ms 444 KB Output is correct
25 Correct 2 ms 356 KB Output is correct
26 Correct 2 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 2 ms 316 KB Output is correct
29 Correct 2 ms 332 KB Output is correct
30 Correct 2 ms 308 KB Output is correct
31 Correct 2 ms 332 KB Output is correct
32 Correct 2 ms 352 KB Output is correct
33 Correct 1 ms 448 KB Output is correct
34 Correct 480 ms 24788 KB Output is correct
35 Correct 357 ms 25228 KB Output is correct
36 Correct 338 ms 25052 KB Output is correct
37 Correct 369 ms 25412 KB Output is correct
38 Correct 594 ms 25944 KB Output is correct
39 Correct 366 ms 27188 KB Output is correct
40 Correct 345 ms 27700 KB Output is correct
41 Correct 757 ms 27648 KB Output is correct
42 Correct 649 ms 26992 KB Output is correct
43 Correct 384 ms 27908 KB Output is correct
44 Correct 375 ms 27736 KB Output is correct
45 Correct 349 ms 27740 KB Output is correct
46 Correct 360 ms 27732 KB Output is correct
47 Correct 380 ms 27608 KB Output is correct
48 Correct 334 ms 27800 KB Output is correct
49 Correct 340 ms 27728 KB Output is correct
50 Correct 355 ms 27600 KB Output is correct
51 Correct 458 ms 27188 KB Output is correct
52 Correct 345 ms 26844 KB Output is correct
53 Correct 235 ms 27212 KB Output is correct
54 Correct 232 ms 27876 KB Output is correct
55 Correct 350 ms 28464 KB Output is correct
56 Correct 354 ms 27788 KB Output is correct
57 Correct 295 ms 28788 KB Output is correct
58 Correct 334 ms 29620 KB Output is correct
59 Correct 273 ms 29992 KB Output is correct
60 Correct 291 ms 28768 KB Output is correct
61 Correct 389 ms 30940 KB Output is correct
62 Correct 277 ms 31084 KB Output is correct
63 Correct 353 ms 31932 KB Output is correct
64 Correct 343 ms 32176 KB Output is correct
65 Correct 326 ms 40708 KB Output is correct