oj.uz

답안 #212491

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
212491 2020-03-23T07:53:47 Z PeppaPig 건물 4 (JOI20_building4) C++14
100 / 100
 420 ms 29024 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 1e6+5;

int n;
int A[N][2], mn[N][2], mx[N][2];

int main() {
    scanf("%d", &n), n <<= 1;
    for(int j = 0; j < 2; j++) for(int i = 1; i <= n; i++) scanf("%d", &A[i][j]);
    for(int i = 1; i <= n; i++) {
        mn[i][0] = mn[i][1] = 1e9, mx[i][0] = mx[i][1] = -1e9;
        for(int x = 0; x < 2; x++) for(int y = 0; y < 2; y++) {
            if(A[i - 1][y] > A[i][x]) continue;
            int pre_mn = mn[i - 1][y] + (x == 0);
            int pre_mx = mx[i - 1][y] + (x == 0);
            mn[i][x] = min(mn[i][x], pre_mn), mx[i][x] = max(mx[i][x], pre_mx);
        }
    }

    int cnt = n / 2;
    vector<int> ans;

    if(mn[n][0] <= n / 2 && n / 2 <= mx[n][0]) ans.emplace_back(0), --cnt;
    else if(mn[n][1] <= n / 2 && n / 2 <= mx[n][1]) ans.emplace_back(1);
    else return !printf("-1\n");

    for(int i = n - 1; i; i--) for(int j = 0; j < 2; j++) {
        if(A[i][j] > A[i + 1][ans.back()]) continue;
        if(mn[i][j] <= cnt && cnt <= mx[i][j]) {
            cnt -= (j == 0);
            ans.emplace_back(j);
            break;
        }
    }
    reverse(ans.begin(), ans.end());
    for(int x : ans) printf("%c", 'A' + x);
    printf("\n");

    return 0;
}

Compilation message

building4.cpp: In function 'int main()':
building4.cpp:11:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n), n <<= 1;
     ~~~~~~~~~~~~~~~^~~~~~~~~
building4.cpp:12:65: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int j = 0; j < 2; j++) for(int i = 1; i <= n; i++) scanf("%d", &A[i][j]);
                                                            ~~~~~^~~~~~~~~~~~~~~~

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 4 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 384 KB Output is correct
7 Correct 6 ms 512 KB Output is correct
8 Correct 6 ms 384 KB Output is correct
9 Correct 6 ms 384 KB Output is correct
10 Correct 6 ms 408 KB Output is correct
11 Correct 6 ms 384 KB Output is correct
12 Correct 6 ms 384 KB Output is correct
13 Correct 6 ms 384 KB Output is correct
14 Correct 6 ms 512 KB Output is correct
15 Correct 6 ms 512 KB Output is correct
16 Correct 6 ms 384 KB Output is correct
17 Correct 6 ms 512 KB Output is correct
18 Correct 6 ms 512 KB Output is correct
19 Correct 6 ms 488 KB Output is correct
20 Correct 6 ms 512 KB Output is correct
21 Correct 6 ms 384 KB Output is correct
22 Correct 5 ms 512 KB Output is correct
23 Correct 6 ms 512 KB Output is correct
24 Correct 6 ms 512 KB Output is correct
25 Correct 6 ms 512 KB Output is correct
26 Correct 6 ms 512 KB Output is correct
27 Correct 6 ms 512 KB Output is correct
28 Correct 5 ms 384 KB Output is correct
29 Correct 6 ms 512 KB Output is correct
30 Correct 5 ms 384 KB Output is correct
31 Correct 6 ms 384 KB Output is correct
32 Correct 6 ms 384 KB Output is correct
33 Correct 6 ms 512 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 4 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 384 KB Output is correct
7 Correct 6 ms 512 KB Output is correct
8 Correct 6 ms 384 KB Output is correct
9 Correct 6 ms 384 KB Output is correct
10 Correct 6 ms 408 KB Output is correct
11 Correct 6 ms 384 KB Output is correct
12 Correct 6 ms 384 KB Output is correct
13 Correct 6 ms 384 KB Output is correct
14 Correct 6 ms 512 KB Output is correct
15 Correct 6 ms 512 KB Output is correct
16 Correct 6 ms 384 KB Output is correct
17 Correct 6 ms 512 KB Output is correct
18 Correct 6 ms 512 KB Output is correct
19 Correct 6 ms 488 KB Output is correct
20 Correct 6 ms 512 KB Output is correct
21 Correct 6 ms 384 KB Output is correct
22 Correct 5 ms 512 KB Output is correct
23 Correct 6 ms 512 KB Output is correct
24 Correct 6 ms 512 KB Output is correct
25 Correct 6 ms 512 KB Output is correct
26 Correct 6 ms 512 KB Output is correct
27 Correct 6 ms 512 KB Output is correct
28 Correct 5 ms 384 KB Output is correct
29 Correct 6 ms 512 KB Output is correct
30 Correct 5 ms 384 KB Output is correct
31 Correct 6 ms 384 KB Output is correct
32 Correct 6 ms 384 KB Output is correct
33 Correct 6 ms 512 KB Output is correct
34 Correct 415 ms 23300 KB Output is correct
35 Correct 420 ms 26792 KB Output is correct
36 Correct 397 ms 26460 KB Output is correct
37 Correct 393 ms 27208 KB Output is correct
38 Correct 370 ms 26932 KB Output is correct
39 Correct 353 ms 26972 KB Output is correct
40 Correct 368 ms 28764 KB Output is correct
41 Correct 336 ms 27484 KB Output is correct
42 Correct 385 ms 27996 KB Output is correct
43 Correct 416 ms 28804 KB Output is correct
44 Correct 419 ms 28892 KB Output is correct
45 Correct 418 ms 28852 KB Output is correct
46 Correct 371 ms 28892 KB Output is correct
47 Correct 364 ms 28892 KB Output is correct
48 Correct 364 ms 28900 KB Output is correct
49 Correct 372 ms 28892 KB Output is correct
50 Correct 414 ms 28892 KB Output is correct
51 Correct 411 ms 28892 KB Output is correct
52 Correct 314 ms 28896 KB Output is correct
53 Correct 321 ms 29020 KB Output is correct
54 Correct 289 ms 28892 KB Output is correct
55 Correct 287 ms 28892 KB Output is correct
56 Correct 366 ms 28956 KB Output is correct
57 Correct 327 ms 28892 KB Output is correct
58 Correct 380 ms 28892 KB Output is correct
59 Correct 325 ms 29024 KB Output is correct
60 Correct 310 ms 27100 KB Output is correct
61 Correct 322 ms 28892 KB Output is correct
62 Correct 338 ms 28508 KB Output is correct
63 Correct 341 ms 28892 KB Output is correct
64 Correct 327 ms 28004 KB Output is correct
65 Correct 338 ms 29000 KB Output is correct