oj.uz

Submission #234284

# Submission time Handle Problem Language Result Execution time Memory
234284 2020-05-23T18:40:53 Z aggu_01000101 Building 4 (JOI20_building4) C++14
100 / 100
 1251 ms 53896 KB 
#include <bits/stdc++.h>
#define INF 10000000000000000
#define MOD 1000000017
#define mid(l, u) ((l+u)/2)
#define rchild(i) (i*2 + 2)
#define lchild(i) (i*2 + 1)
#define rr mt_rand()
#define int long long
using namespace std;
signed main(){
    int n;
    cin>>n;
    n*=2;
    int a[n][2];
    for(int i = 0;i<n;i++) cin>>a[i][0];
    for(int i = 0;i<n;i++) cin>>a[i][1];
    pair<int, int> dp[n][2]; //min number of A's, max number of A's
    dp[0][0] = {1, 1};
    dp[0][1] = {0, 0};
    for(int i = 1;i<n;i++){
        for(int j = 0;j<2;j++){
            dp[i][j] = make_pair(INF, -1);
            if(a[i-1][0]<=a[i][j]){
                dp[i][j].first = min(dp[i][j].first, dp[i-1][0].first + (j==0));
                dp[i][j].second = max(dp[i][j].second, dp[i-1][0].second + (j==0));
            }
            if(a[i-1][1]<=a[i][j]){
                dp[i][j].first = min(dp[i][j].first, dp[i-1][1].first + (j==0));
                dp[i][j].second = max(dp[i][j].second, dp[i-1][1].second + (j==0));
            }
        }
    }
    /*for(int i = 0;i<n;i++){
        cout<<i<<" "<<dp[i][0].first<<" "<<dp[i][0].second<<" "<<dp[i][1].first<<" "<<dp[i][1].second<<endl;
    }*/
    int req = n/2;
    int maxn = INF;
    stack<char> st;
    bool found = false;
    for(int i = n-1;i>=0;i--){
        found = false;
        for(int j = 0;j<2 && !found;j++){
            if(dp[i][j].first>req || dp[i][j].second<req || a[i][j]>maxn) continue;
            maxn = a[i][j];
            req-=(j==0);
            st.push((j==0)?'A':'B');
            found = true;
        }
        if(!found){
            break;
        }
    }
    if(!found){
        cout<<-1<<endl;
        return 0;
    }
    while(!st.empty()){
        cout<<st.top();
        st.pop();
    }
    cout<<endl;
}
//l, mid(l, r) || l+1, r
//

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Correct 9 ms 512 KB Output is correct
6 Correct 9 ms 512 KB Output is correct
7 Correct 9 ms 512 KB Output is correct
8 Correct 9 ms 512 KB Output is correct
9 Correct 9 ms 512 KB Output is correct
10 Correct 8 ms 512 KB Output is correct
11 Correct 9 ms 512 KB Output is correct
12 Correct 10 ms 632 KB Output is correct
13 Correct 10 ms 640 KB Output is correct
14 Correct 10 ms 640 KB Output is correct
15 Correct 9 ms 512 KB Output is correct
16 Correct 9 ms 512 KB Output is correct
17 Correct 10 ms 512 KB Output is correct
18 Correct 10 ms 512 KB Output is correct
19 Correct 9 ms 640 KB Output is correct
20 Correct 7 ms 512 KB Output is correct
21 Correct 8 ms 512 KB Output is correct
22 Correct 8 ms 512 KB Output is correct
23 Correct 7 ms 512 KB Output is correct
24 Correct 10 ms 640 KB Output is correct
25 Correct 8 ms 512 KB Output is correct
26 Correct 7 ms 512 KB Output is correct
27 Correct 8 ms 564 KB Output is correct
28 Correct 7 ms 512 KB Output is correct
29 Correct 8 ms 512 KB Output is correct
30 Correct 7 ms 512 KB Output is correct
31 Correct 8 ms 512 KB Output is correct
32 Correct 7 ms 512 KB Output is correct
33 Correct 8 ms 512 KB Output is correct

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Correct 9 ms 512 KB Output is correct
6 Correct 9 ms 512 KB Output is correct
7 Correct 9 ms 512 KB Output is correct
8 Correct 9 ms 512 KB Output is correct
9 Correct 9 ms 512 KB Output is correct
10 Correct 8 ms 512 KB Output is correct
11 Correct 9 ms 512 KB Output is correct
12 Correct 10 ms 632 KB Output is correct
13 Correct 10 ms 640 KB Output is correct
14 Correct 10 ms 640 KB Output is correct
15 Correct 9 ms 512 KB Output is correct
16 Correct 9 ms 512 KB Output is correct
17 Correct 10 ms 512 KB Output is correct
18 Correct 10 ms 512 KB Output is correct
19 Correct 9 ms 640 KB Output is correct
20 Correct 7 ms 512 KB Output is correct
21 Correct 8 ms 512 KB Output is correct
22 Correct 8 ms 512 KB Output is correct
23 Correct 7 ms 512 KB Output is correct
24 Correct 10 ms 640 KB Output is correct
25 Correct 8 ms 512 KB Output is correct
26 Correct 7 ms 512 KB Output is correct
27 Correct 8 ms 564 KB Output is correct
28 Correct 7 ms 512 KB Output is correct
29 Correct 8 ms 512 KB Output is correct
30 Correct 7 ms 512 KB Output is correct
31 Correct 8 ms 512 KB Output is correct
32 Correct 7 ms 512 KB Output is correct
33 Correct 8 ms 512 KB Output is correct
34 Correct 1175 ms 46712 KB Output is correct
35 Correct 1153 ms 45768 KB Output is correct
36 Correct 1126 ms 45048 KB Output is correct
37 Correct 1163 ms 46072 KB Output is correct
38 Correct 1141 ms 46200 KB Output is correct
39 Correct 1106 ms 46288 KB Output is correct
40 Correct 1215 ms 53896 KB Output is correct
41 Correct 1145 ms 46972 KB Output is correct
42 Correct 1191 ms 47864 KB Output is correct
43 Correct 1236 ms 49400 KB Output is correct
44 Correct 1244 ms 49408 KB Output is correct
45 Correct 1248 ms 49528 KB Output is correct
46 Correct 1231 ms 49352 KB Output is correct
47 Correct 1184 ms 49400 KB Output is correct
48 Correct 1185 ms 49604 KB Output is correct
49 Correct 1212 ms 49528 KB Output is correct
50 Correct 1200 ms 49432 KB Output is correct
51 Correct 1208 ms 49396 KB Output is correct
52 Correct 680 ms 50936 KB Output is correct
53 Correct 680 ms 51192 KB Output is correct
54 Correct 665 ms 50936 KB Output is correct
55 Correct 659 ms 51064 KB Output is correct
56 Correct 1251 ms 49528 KB Output is correct
57 Correct 999 ms 50680 KB Output is correct
58 Correct 996 ms 50940 KB Output is correct
59 Correct 1008 ms 50680 KB Output is correct
60 Correct 961 ms 47864 KB Output is correct
61 Correct 1018 ms 50712 KB Output is correct
62 Correct 1016 ms 49912 KB Output is correct
63 Correct 1024 ms 50680 KB Output is correct
64 Correct 996 ms 48760 KB Output is correct
65 Correct 1025 ms 50552 KB Output is correct