oj.uz

Submission #227423

# Submission time Handle Problem Language Result Execution time Memory
227423 2020-04-27T11:20:20 Z anonymous Building 4 (JOI20_building4) C++14
100 / 100
 484 ms 44024 KB 
#include <iostream>
#define MAXN 1000005
using namespace std;
int N, A[MAXN][2];
int dp[MAXN][2][2], Num;
bool res[MAXN], b;
bool can(int i, int j, int v) {return(v >= dp[i][j][0] && v <= dp[i][j][1]);}
int main() {
    //freopen("b4in.txt","r",stdin);
    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]);
    }
    dp[1][1][0] = dp[1][1][1] = 1;
    for (int i=2; i<=2*N; i++) {
        for (int j=0; j<=1; j++) {
            dp[i][j][0] = 1<<30, dp[i][j][1]=-1<<30;
            if (A[i][j] >= A[i-1][0]) {
                dp[i][j][0] = min(dp[i][j][0], dp[i-1][0][0]+(j > 0));
                dp[i][j][1] = max(dp[i][j][1], dp[i-1][0][1]+(j > 0));
            }
            if (A[i][j] >= A[i-1][1]) {
                dp[i][j][0] = min(dp[i][j][0], dp[i-1][1][0]+(j > 0));
                dp[i][j][1] = max(dp[i][j][1], dp[i-1][1][1]+(j > 0));
            }
        }
    }
    if (!can(2*N, 0, N) && !can(2*N, 1, N)) {
        printf("-1");
    } else {
        b = can(2*N, 1, N), Num = N;
        for (int i=2*N; i>=1; i--) {
            res[i] = b;
            Num -= b;
            b = (A[i-1][1] <= A[i][b]) && can(i-1, 1, Num);
        }
        for (int i=1; i<=2*N; i++) {
            printf("%c", res[i] ? 'B' : 'A');
        }
    }
}

Compilation message

building4.cpp: In function 'int main()':
building4.cpp:10:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&N);
     ~~~~~^~~~~~~~~
building4.cpp:12: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:15: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

# Verdict Execution time Memory Grader output
1 Correct 5 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 5 ms 384 KB Output is correct
5 Correct 6 ms 512 KB Output is correct
6 Correct 6 ms 512 KB Output is correct
7 Correct 6 ms 512 KB Output is correct
8 Correct 6 ms 512 KB Output is correct
9 Correct 7 ms 640 KB Output is correct
10 Correct 6 ms 512 KB Output is correct
11 Correct 6 ms 512 KB Output is correct
12 Correct 6 ms 512 KB Output is correct
13 Correct 7 ms 512 KB Output is correct
14 Correct 6 ms 512 KB Output is correct
15 Correct 7 ms 512 KB Output is correct
16 Correct 6 ms 512 KB Output is correct
17 Correct 7 ms 512 KB Output is correct
18 Correct 7 ms 512 KB Output is correct
19 Correct 6 ms 512 KB Output is correct
20 Correct 6 ms 512 KB Output is correct
21 Correct 6 ms 512 KB Output is correct
22 Correct 7 ms 512 KB Output is correct
23 Correct 6 ms 512 KB Output is correct
24 Correct 7 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 6 ms 512 KB Output is correct
29 Correct 6 ms 512 KB Output is correct
30 Correct 6 ms 512 KB Output is correct
31 Correct 6 ms 432 KB Output is correct
32 Correct 6 ms 512 KB Output is correct
33 Correct 6 ms 512 KB Output is correct

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 5 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 5 ms 384 KB Output is correct
5 Correct 6 ms 512 KB Output is correct
6 Correct 6 ms 512 KB Output is correct
7 Correct 6 ms 512 KB Output is correct
8 Correct 6 ms 512 KB Output is correct
9 Correct 7 ms 640 KB Output is correct
10 Correct 6 ms 512 KB Output is correct
11 Correct 6 ms 512 KB Output is correct
12 Correct 6 ms 512 KB Output is correct
13 Correct 7 ms 512 KB Output is correct
14 Correct 6 ms 512 KB Output is correct
15 Correct 7 ms 512 KB Output is correct
16 Correct 6 ms 512 KB Output is correct
17 Correct 7 ms 512 KB Output is correct
18 Correct 7 ms 512 KB Output is correct
19 Correct 6 ms 512 KB Output is correct
20 Correct 6 ms 512 KB Output is correct
21 Correct 6 ms 512 KB Output is correct
22 Correct 7 ms 512 KB Output is correct
23 Correct 6 ms 512 KB Output is correct
24 Correct 7 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 6 ms 512 KB Output is correct
29 Correct 6 ms 512 KB Output is correct
30 Correct 6 ms 512 KB Output is correct
31 Correct 6 ms 432 KB Output is correct
32 Correct 6 ms 512 KB Output is correct
33 Correct 6 ms 512 KB Output is correct
34 Correct 423 ms 33400 KB Output is correct
35 Correct 441 ms 41848 KB Output is correct
36 Correct 438 ms 41276 KB Output is correct
37 Correct 443 ms 41976 KB Output is correct
38 Correct 410 ms 41936 KB Output is correct
39 Correct 394 ms 41208 KB Output is correct
40 Correct 428 ms 37496 KB Output is correct
41 Correct 380 ms 42232 KB Output is correct
42 Correct 445 ms 41720 KB Output is correct
43 Correct 467 ms 28664 KB Output is correct
44 Correct 470 ms 28664 KB Output is correct
45 Correct 471 ms 28664 KB Output is correct
46 Correct 429 ms 28668 KB Output is correct
47 Correct 424 ms 43896 KB Output is correct
48 Correct 429 ms 44024 KB Output is correct
49 Correct 439 ms 34680 KB Output is correct
50 Correct 484 ms 43768 KB Output is correct
51 Correct 461 ms 43512 KB Output is correct
52 Correct 349 ms 33400 KB Output is correct
53 Correct 337 ms 33400 KB Output is correct
54 Correct 315 ms 33400 KB Output is correct
55 Correct 324 ms 33276 KB Output is correct
56 Correct 423 ms 28664 KB Output is correct
57 Correct 376 ms 40184 KB Output is correct
58 Correct 371 ms 40312 KB Output is correct
59 Correct 374 ms 40312 KB Output is correct
60 Correct 357 ms 38264 KB Output is correct
61 Correct 378 ms 40824 KB Output is correct
62 Correct 365 ms 40184 KB Output is correct
63 Correct 383 ms 40924 KB Output is correct
64 Correct 375 ms 39440 KB Output is correct
65 Correct 391 ms 40824 KB Output is correct