oj.uz

Submission #561164

# Submission time Handle Problem Language Result Execution time Memory
561164 2022-05-12T12:01:35 Z Bill_00 Building 4 (JOI20_building4) C++14
100 / 100
 282 ms 29172 KB 
#include <bits/stdc++.h>
#define N 500005
#define ff first
#define ss second
#define ll long long 
const ll MAXN = 1e9; 
using namespace std;

int n, a[2 * N], b[2 * N];
pair<int, int> dp[2 * N][2];

char x[2 * N];

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    cin >> n;
    for(int i = 1; i <= 2 * n; i++){
        cin >> a[i];
    }
    for(int i = 1; i <= 2 * n; i++){
        cin >> b[i];
    }

    dp[1][1] = {1, 1};
    dp[1][0] = {0, 0};
    for(int i = 2; i <= 2 * n; i++){
        dp[i][1] = {1e9, -1};
        dp[i][0] = {1e9, -1};
        if(a[i] >= a[i - 1]){
            dp[i][1].ff = min(dp[i][1].ff, dp[i - 1][1].ff + 1);
            dp[i][1].ss = max(dp[i][1].ss, dp[i - 1][1].ss + 1);
        }
        if(a[i] >= b[i - 1]){
            dp[i][1].ff = min(dp[i][1].ff, dp[i - 1][0].ff + 1);
            dp[i][1].ss = max(dp[i][1].ss, dp[i - 1][0].ss + 1);
        }
        if(b[i] >= a[i - 1]){
            dp[i][0].ff = min(dp[i][0].ff, dp[i - 1][1].ff);
            dp[i][0].ss = max(dp[i][0].ss, dp[i - 1][1].ss);
        }
        if(b[i] >= b[i - 1]){
            dp[i][0].ff = min(dp[i][0].ff, dp[i - 1][0].ff);
            dp[i][0].ss = max(dp[i][0].ss, dp[i - 1][0].ss);
        }
    }
    // for(int i = 1; i <= 2 * n; i++){
    //     cout << dp[i][1].ff << ' ' << dp[i][1].ss << '\n';
    //     cout << dp[i][0].ff << ' ' << dp[i][0].ss << '\n';
    // }
    if(dp[2 * n][0].ff <= n && n <= dp[2 * n][0].ss || dp[2 * n][1].ff <= n && n <= dp[2 * n][1].ss){
        int lol = n;
        deque<char> ans;
        for(int i = 2 * n; i >= 1; i--){
            if(dp[i][1].ff <= lol && lol <= dp[i][1].ss){
                if(ans.size() > 0){
                    if(ans.front() == 'A'){
                        if(a[i] > a[i + 1]){
                            ans.push_front('B');
                            continue;
                        }
                    }
                    else{
                        if(a[i] > b[i + 1]){
                            ans.push_front('B');
                            continue;
                        }
                    }
                }
                ans.push_front('A');
                lol--;
            }
            else{
                ans.push_front('B');
            }
        }
        for(char x : ans) cout << x;
    }
    else cout << -1;
}

Compilation message

building4.cpp: In function 'int main()':
building4.cpp:53:29: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   53 |     if(dp[2 * n][0].ff <= n && n <= dp[2 * n][0].ss || dp[2 * n][1].ff <= n && n <= dp[2 * n][1].ss){
      |                             ^

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 1 ms 412 KB Output is correct
9 Correct 2 ms 412 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
13 Correct 2 ms 464 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 3 ms 472 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 2 ms 472 KB Output is correct
19 Correct 3 ms 472 KB Output is correct
20 Correct 2 ms 472 KB Output is correct
21 Correct 1 ms 472 KB Output is correct
22 Correct 2 ms 468 KB Output is correct
23 Correct 2 ms 356 KB Output is correct
24 Correct 2 ms 464 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 2 ms 468 KB Output is correct
27 Correct 2 ms 468 KB Output is correct
28 Correct 2 ms 468 KB Output is correct
29 Correct 2 ms 468 KB Output is correct
30 Correct 2 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 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 1 ms 412 KB Output is correct
9 Correct 2 ms 412 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
13 Correct 2 ms 464 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 3 ms 472 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 2 ms 472 KB Output is correct
19 Correct 3 ms 472 KB Output is correct
20 Correct 2 ms 472 KB Output is correct
21 Correct 1 ms 472 KB Output is correct
22 Correct 2 ms 468 KB Output is correct
23 Correct 2 ms 356 KB Output is correct
24 Correct 2 ms 464 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 2 ms 468 KB Output is correct
27 Correct 2 ms 468 KB Output is correct
28 Correct 2 ms 468 KB Output is correct
29 Correct 2 ms 468 KB Output is correct
30 Correct 2 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 245 ms 24672 KB Output is correct
35 Correct 255 ms 25152 KB Output is correct
36 Correct 265 ms 24980 KB Output is correct
37 Correct 256 ms 25244 KB Output is correct
38 Correct 244 ms 25296 KB Output is correct
39 Correct 245 ms 28156 KB Output is correct
40 Correct 266 ms 26988 KB Output is correct
41 Correct 232 ms 25740 KB Output is correct
42 Correct 246 ms 26296 KB Output is correct
43 Correct 270 ms 27124 KB Output is correct
44 Correct 282 ms 27116 KB Output is correct
45 Correct 266 ms 27172 KB Output is correct
46 Correct 243 ms 27100 KB Output is correct
47 Correct 255 ms 27228 KB Output is correct
48 Correct 256 ms 26988 KB Output is correct
49 Correct 264 ms 27140 KB Output is correct
50 Correct 267 ms 27240 KB Output is correct
51 Correct 271 ms 27048 KB Output is correct
52 Correct 175 ms 28744 KB Output is correct
53 Correct 170 ms 28688 KB Output is correct
54 Correct 173 ms 28680 KB Output is correct
55 Correct 181 ms 28668 KB Output is correct
56 Correct 250 ms 27240 KB Output is correct
57 Correct 237 ms 28864 KB Output is correct
58 Correct 233 ms 29032 KB Output is correct
59 Correct 209 ms 29100 KB Output is correct
60 Correct 221 ms 27440 KB Output is correct
61 Correct 271 ms 29172 KB Output is correct
62 Correct 234 ms 28820 KB Output is correct
63 Correct 229 ms 29072 KB Output is correct
64 Correct 221 ms 28140 KB Output is correct
65 Correct 242 ms 28892 KB Output is correct