oj.uz

답안 #211579

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
211579 2020-03-20T17:39:24 Z Akashi 건물 4 (JOI20_building4) C++14
100 / 100
 622 ms 64000 KB 
#include <bits/stdc++.h>
using namespace std;

const int INF = 2e9;

struct usu{
    int mina, maxb, maxa, minb;
};
usu seg[1000005][2];

int n;
int a[1000005], b[1000005];
int val[1000005][2];

inline void solve(int n, int k, int nra, int nrb){
    if(k == 0) --nra;
    else --nrb;

    if(n > 1){
        for(int k2 = 0; k2 <= 1 ; ++k2){
            if(seg[n - 1][k2].mina != INF && seg[n - 1][k2].mina <= nra && seg[n - 1][k2].maxa >= nra && val[n - 1][k2] <= val[n][k]){
                solve(n - 1, k2, nra, nrb);
                break ;
            }
        }
    }

    if(k == 0) printf("A");
    else printf("B");
}

int main()
{
//    freopen("1.in", "r", stdin);

    scanf("%d", &n);
    for(int i = 1; i <= 2 * n ; ++i){
        scanf("%d", &a[i]);
        val[i][0] = a[i];
    }
    for(int i = 1; i <= 2 * n ; ++i){
        scanf("%d", &b[i]);
        val[i][1] = b[i];
    }

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

    for(int i = 2; i <= 2 * n ; ++i){
        if(max(a[i], b[i]) < min(a[i - 1], b[i - 1])){
            printf("-1");
            return 0;
        }

        for(int k = 0; k < 2 ; ++k)
        seg[i][k] = {INF, -1, -1, INF};

        if(a[i] >= a[i - 1] && seg[i - 1][0].mina != INF){
            seg[i][0] = seg[i - 1][0];
            ++seg[i][0].mina;
            ++seg[i][0].maxa;
        }
        if(a[i] >= b[i - 1] && seg[i - 1][1].mina != INF){
            if(seg[i - 1][1].mina + 1 < seg[i][0].mina){
                seg[i][0].mina = seg[i - 1][1].mina + 1;
                seg[i][0].maxb = seg[i - 1][1].maxb;
            }
            if(seg[i - 1][1].maxa + 1 > seg[i][0].maxa){
                seg[i][0].maxa = seg[i - 1][1].maxa + 1;
                seg[i][0].minb = seg[i - 1][1].minb;
            }
        }

        if(b[i] >= a[i - 1] && seg[i - 1][0].mina != INF){
            seg[i][1] = seg[i - 1][0];
            ++seg[i][1].minb;
            ++seg[i][1].maxb;
        }
        if(b[i] >= b[i - 1] && seg[i - 1][1].mina != INF){
            if(seg[i - 1][1].maxb + 1 > seg[i][1].maxb){
                seg[i][1].mina = seg[i - 1][1].mina;
                seg[i][1].maxb = seg[i - 1][1].maxb + 1;
            }
            if(seg[i - 1][1].minb + 1 < seg[i][1].minb){
                seg[i][1].maxa = seg[i - 1][1].maxa;
                seg[i][1].minb = seg[i - 1][1].minb + 1;
            }
        }
    }


    for(int k = 0; k <= 1 ; ++k){
        if(seg[2 * n][k].mina <= n && seg[2 * n][k].maxa >= n){
            solve(2 * n, k, n, n);
            return 0;
        }
    }

    printf("-1");
    return 0;
}

Compilation message

building4.cpp: In function 'int main()':
building4.cpp:36:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~
building4.cpp:38:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &a[i]);
         ~~~~~^~~~~~~~~~~~~
building4.cpp:42:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &b[i]);
         ~~~~~^~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
89.0 / 89.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 6 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 7 ms 384 KB Output is correct
6 Correct 6 ms 572 KB Output is correct
7 Correct 6 ms 512 KB Output is correct
8 Correct 8 ms 580 KB Output is correct
9 Correct 6 ms 692 KB Output is correct
10 Correct 7 ms 512 KB Output is correct
11 Correct 6 ms 640 KB Output is correct
12 Correct 7 ms 640 KB Output is correct
13 Correct 9 ms 640 KB Output is correct
14 Correct 8 ms 640 KB Output is correct
15 Correct 7 ms 640 KB Output is correct
16 Correct 8 ms 580 KB Output is correct
17 Correct 11 ms 692 KB Output is correct
18 Correct 6 ms 640 KB Output is correct
19 Correct 9 ms 640 KB Output is correct
20 Correct 6 ms 640 KB Output is correct
21 Correct 8 ms 640 KB Output is correct
22 Correct 7 ms 640 KB Output is correct
23 Correct 8 ms 640 KB Output is correct
24 Correct 8 ms 640 KB Output is correct
25 Correct 7 ms 640 KB Output is correct
26 Correct 11 ms 640 KB Output is correct
27 Correct 8 ms 640 KB Output is correct
28 Correct 7 ms 544 KB Output is correct
29 Correct 6 ms 640 KB Output is correct
30 Correct 7 ms 512 KB Output is correct
31 Correct 6 ms 640 KB Output is correct
32 Correct 6 ms 672 KB Output is correct
33 Correct 7 ms 560 KB Output is correct
34 Correct 436 ms 15700 KB Output is correct
35 Correct 611 ms 59312 KB Output is correct
36 Correct 445 ms 58340 KB Output is correct
37 Correct 453 ms 59616 KB Output is correct
38 Correct 423 ms 59580 KB Output is correct
39 Correct 421 ms 59824 KB Output is correct
40 Correct 441 ms 63652 KB Output is correct
41 Correct 376 ms 60852 KB Output is correct
42 Correct 469 ms 61984 KB Output is correct
43 Correct 486 ms 63916 KB Output is correct
44 Correct 498 ms 63936 KB Output is correct
45 Correct 492 ms 63976 KB Output is correct
46 Correct 458 ms 63968 KB Output is correct
47 Correct 622 ms 63900 KB Output is correct
48 Correct 463 ms 63900 KB Output is correct
49 Correct 464 ms 64000 KB Output is correct
50 Correct 556 ms 63948 KB Output is correct
51 Correct 486 ms 63952 KB Output is correct
52 Correct 353 ms 63928 KB Output is correct
53 Correct 383 ms 63892 KB Output is correct
54 Correct 344 ms 63956 KB Output is correct
55 Correct 339 ms 63880 KB Output is correct
56 Correct 420 ms 63992 KB Output is correct
57 Correct 366 ms 63624 KB Output is correct
58 Correct 362 ms 63936 KB Output is correct
59 Correct 394 ms 63888 KB Output is correct
60 Correct 373 ms 60164 KB Output is correct
61 Correct 389 ms 63928 KB Output is correct
62 Correct 447 ms 63068 KB Output is correct
63 Correct 396 ms 63984 KB Output is correct
64 Correct 363 ms 61816 KB Output is correct
65 Correct 388 ms 63948 KB Output is correct