oj.uz

답안 #216273

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
216273 2020-03-27T02:05:42 Z dantoh000 건물 4 (JOI20_building4) C++14
100 / 100
 495 ms 78712 KB 
#include <bits/stdc++.h>
using namespace std;
const int N = 500005;
const int INF = 1000000000;
typedef pair<int,int> ii;
int n;
int a[2*N][2];
int p[2*N][2];
int q[2*N][2];
ii P[2*N][2];
ii Q[2*N][2];
int ans[2*N];
bool test(){
    for (int i = 1; i <= 2*n; i++){
        for (int j = 0; j < 2; j++){
            p[i][j] = INF;
            if (a[i][j] >= a[i-1][0]){
                if (p[i-1][0] < p[i][j]){
                    p[i][j] = p[i-1][0];
                    P[i][j] = {i-1,0};
                }
            }
            if (a[i][j] >= a[i-1][1]){
                if (p[i-1][1] < p[i][j]){
                    p[i][j] = p[i-1][1];
                    P[i][j] = {i-1,1};
                }
            }
        }
        p[i][1]++;
    }
    for (int i = 2*n; i >= 1; i--){
        for (int j = 0; j < 2; j++){
            q[i][j] = INF;
            if (i == 2*n || a[i][j] <= a[i+1][0]){
                if (q[i+1][0] < q[i][j]){
                    q[i][j] = q[i+1][0];
                    Q[i][j] = {i+1,0};
                }
            }
            if (i == 2*n || a[i][j] <= a[i+1][1]){
                if (q[i+1][1] < q[i][j]){
                    q[i][j] = q[i+1][1];
                    Q[i][j] = {i+1,1};
                }
            }
        }
        q[i][0]++;
    }

    for (int i = 1; i <= 2*n; i++){
        for (int j = 0; j < 2; j++){
            if (p[i][j] >= INF || q[i][j] >= INF) continue;
            int num = p[i][j] + (2*n - i + 1) - q[i][j] - (j == 1);
            //printf("%d %d -> %d\n",i,j,num);
            if (num == n){
                //printf("FOUND!");
                ii cur = {i,j};
                while (cur.first >= 1){
                    ans[cur.first] = cur.second;
                    cur = P[cur.first][cur.second];
                }
                cur = Q[i][j];
                while (cur.first <= 2*n){
                    ans[cur.first] = cur.second;
                    cur = Q[cur.first][cur.second];
                }
                return true;
            }
        }
    }
    return false;
}
int main(){
    scanf("%d",&n);
    for (int i = 1; i <= 2*n; i++){
        scanf("%d",&a[i][0]);
    }
    for (int i = 1; i <= 2*n; i++){
        scanf("%d",&a[i][1]);
    }
    if (test()){
        for (int i = 1; i <= 2*n; i++){
            printf("%c",ans[i]?'B':'A');
        }
        return 0;
    }
    for (int i = 1; i <= 2*n; i++){
        a[i][0] ^= a[i][1];
        a[i][1] ^= a[i][0];
        a[i][0] ^= a[i][1];
    }
    if (test()){
        for (int i = 1; i <= 2*n; i++){
            printf("%c",ans[i]?'A':'B');
        }
        return 0;
    }
    printf("-1\n");
}

Compilation message

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

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 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 6 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 636 KB Output is correct
13 Correct 6 ms 640 KB Output is correct
14 Correct 6 ms 640 KB Output is correct
15 Correct 6 ms 640 KB Output is correct
16 Correct 8 ms 640 KB Output is correct
17 Correct 7 ms 640 KB Output is correct
18 Correct 6 ms 640 KB Output is correct
19 Correct 6 ms 640 KB Output is correct
20 Correct 6 ms 640 KB Output is correct
21 Correct 6 ms 640 KB Output is correct
22 Correct 6 ms 640 KB Output is correct
23 Correct 6 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 6 ms 640 KB Output is correct
27 Correct 6 ms 640 KB Output is correct
28 Correct 6 ms 640 KB Output is correct
29 Correct 7 ms 640 KB Output is correct
30 Correct 6 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

Subtask #2
89.0 / 89.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 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 6 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 636 KB Output is correct
13 Correct 6 ms 640 KB Output is correct
14 Correct 6 ms 640 KB Output is correct
15 Correct 6 ms 640 KB Output is correct
16 Correct 8 ms 640 KB Output is correct
17 Correct 7 ms 640 KB Output is correct
18 Correct 6 ms 640 KB Output is correct
19 Correct 6 ms 640 KB Output is correct
20 Correct 6 ms 640 KB Output is correct
21 Correct 6 ms 640 KB Output is correct
22 Correct 6 ms 640 KB Output is correct
23 Correct 6 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 6 ms 640 KB Output is correct
27 Correct 6 ms 640 KB Output is correct
28 Correct 6 ms 640 KB Output is correct
29 Correct 7 ms 640 KB Output is correct
30 Correct 6 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 446 ms 33656 KB Output is correct
35 Correct 423 ms 73720 KB Output is correct
36 Correct 430 ms 72440 KB Output is correct
37 Correct 429 ms 74232 KB Output is correct
38 Correct 413 ms 74232 KB Output is correct
39 Correct 375 ms 73336 KB Output is correct
40 Correct 405 ms 72440 KB Output is correct
41 Correct 356 ms 74744 KB Output is correct
42 Correct 414 ms 76792 KB Output is correct
43 Correct 495 ms 67448 KB Output is correct
44 Correct 454 ms 67580 KB Output is correct
45 Correct 472 ms 69240 KB Output is correct
46 Correct 401 ms 67576 KB Output is correct
47 Correct 405 ms 78584 KB Output is correct
48 Correct 395 ms 78456 KB Output is correct
49 Correct 410 ms 68728 KB Output is correct
50 Correct 458 ms 78712 KB Output is correct
51 Correct 451 ms 78584 KB Output is correct
52 Correct 335 ms 67704 KB Output is correct
53 Correct 341 ms 67704 KB Output is correct
54 Correct 290 ms 67704 KB Output is correct
55 Correct 303 ms 67064 KB Output is correct
56 Correct 406 ms 66808 KB Output is correct
57 Correct 359 ms 74428 KB Output is correct
58 Correct 373 ms 74744 KB Output is correct
59 Correct 332 ms 74620 KB Output is correct
60 Correct 320 ms 70520 KB Output is correct
61 Correct 335 ms 75128 KB Output is correct
62 Correct 343 ms 73976 KB Output is correct
63 Correct 354 ms 75128 KB Output is correct
64 Correct 339 ms 72824 KB Output is correct
65 Correct 359 ms 75256 KB Output is correct