oj.uz

Submission #535522

# Submission time Handle Problem Language Result Execution time Memory
535522 2022-03-10T12:34:38 Z 79brue Building 4 (JOI20_building4) C++14
100 / 100
 280 ms 61204 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

int n;
int a[1000002][2];
int DP[1000002][2][2]; /// a/b, l/r
int track[1000002][2][2];

int main(){
    scanf("%d", &n);
    for(int i=1; i<=n+n; i++) scanf("%d", &a[i][0]);
    for(int i=1; i<=n+n; i++) scanf("%d", &a[i][1]);
    for(int i=1; i<=n+n; i++){
        DP[i][0][0] = DP[i][1][0] = 1e9;
        for(int j=0; j<2; j++){
            for(int j2=0; j2<2; j2++){
                if(a[i-1][j2] <= a[i][j]){
                    if(DP[i][j][0] > DP[i-1][j2][0] + (j==0)){
                        DP[i][j][0] = DP[i-1][j2][0] + (j==0);
                        track[i][j][0] = j2;
                    }
                    if(DP[i][j][1] < DP[i-1][j2][1] + (j==0)){
                        DP[i][j][1] = DP[i-1][j2][1] + (j==0);
                        track[i][j][1] = j2;
                    }
                }
            }
        }
    }

    int i=0, j=0;
    if((DP[n+n][0][0] <= n && n <= DP[n+n][0][1])) i=n+n, j=0;
    else if(DP[n+n][1][0] <= n && n <= DP[n+n][1][1]) i=n+n, j=1;
    else{
        puts("-1");
        return 0;
    }

    string s;
    int cnt = n;
    while(i){
        if(j==0) s.push_back('A'), cnt--;
        else s.push_back('B');

        int c = 0;
        if(a[i][j] < a[i-1][0]) c = 1;
        else if(DP[i-1][0][0] > cnt || DP[i-1][0][1] < cnt) c = 1;
        j = c;
        i--;
    }
    reverse(s.begin(), s.end());
    printf("%s", s.c_str());
}

Compilation message

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

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 2 ms 536 KB Output is correct
13 Correct 2 ms 468 KB Output is correct
14 Correct 1 ms 536 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 3 ms 500 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 2 ms 452 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 2 ms 556 KB Output is correct
25 Correct 2 ms 456 KB Output is correct
26 Correct 2 ms 468 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 496 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 1 ms 468 KB Output is correct

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 2 ms 536 KB Output is correct
13 Correct 2 ms 468 KB Output is correct
14 Correct 1 ms 536 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 3 ms 500 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 2 ms 452 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 2 ms 556 KB Output is correct
25 Correct 2 ms 456 KB Output is correct
26 Correct 2 ms 468 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 496 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 246 ms 57812 KB Output is correct
35 Correct 237 ms 56376 KB Output is correct
36 Correct 231 ms 55504 KB Output is correct
37 Correct 241 ms 56744 KB Output is correct
38 Correct 219 ms 56808 KB Output is correct
39 Correct 231 ms 55872 KB Output is correct
40 Correct 236 ms 60224 KB Output is correct
41 Correct 218 ms 57252 KB Output is correct
42 Correct 253 ms 58852 KB Output is correct
43 Correct 249 ms 60824 KB Output is correct
44 Correct 249 ms 60864 KB Output is correct
45 Correct 280 ms 60864 KB Output is correct
46 Correct 230 ms 60852 KB Output is correct
47 Correct 229 ms 59968 KB Output is correct
48 Correct 260 ms 59736 KB Output is correct
49 Correct 246 ms 60620 KB Output is correct
50 Correct 257 ms 59964 KB Output is correct
51 Correct 243 ms 59980 KB Output is correct
52 Correct 206 ms 49088 KB Output is correct
53 Correct 200 ms 49292 KB Output is correct
54 Correct 181 ms 49112 KB Output is correct
55 Correct 181 ms 48832 KB Output is correct
56 Correct 233 ms 61204 KB Output is correct
57 Correct 205 ms 55932 KB Output is correct
58 Correct 201 ms 56068 KB Output is correct
59 Correct 212 ms 56112 KB Output is correct
60 Correct 194 ms 53212 KB Output is correct
61 Correct 208 ms 56516 KB Output is correct
62 Correct 198 ms 55676 KB Output is correct
63 Correct 203 ms 56624 KB Output is correct
64 Correct 206 ms 54532 KB Output is correct
65 Correct 212 ms 56504 KB Output is correct