oj.uz

Submission #232158

# Submission time Handle Problem Language Result Execution time Memory
232158 2020-05-16T10:12:10 Z brcode Building 4 (JOI20_building4) C++14
100 / 100
 1264 ms 48912 KB 
#include <iostream>
#include <bits/stdc++.h>

using namespace std;
const int MAXN = 1e6+5;
int a[MAXN];
int b[MAXN];
int dpmax[MAXN][3];
int dpmin[MAXN][3];
int main(){
    int n;
    cin>>n;
    for(int i=1;i<=2*n;i++){
        cin>>a[i];
    }
    for(int i=1;i<=2*n;i++){
        cin>>b[i];
    }
    for(int i=1;i<=2*n;i++){
        for(int k=0;k<=1;k++){
            dpmin[i][k]  = 1e9;
        }
    }
    for(int i=1;i<=2*n;i++){
        for(int k=0;k<=1;k++){
            if(k){
                if(a[i-1]<=b[i]){
                    dpmin[i][k] = min(dpmin[i][k],dpmin[i-1][0]);
                }
                if(b[i-1]<=b[i]){
                    dpmin[i][k] = min(dpmin[i][k],dpmin[i-1][1]);
                }
                
            }else{
                if(a[i-1]<=a[i]){
                    dpmin[i][k] = min(dpmin[i][k],dpmin[i-1][0]+1);
                }
                if(b[i-1]<=a[i]){
                    dpmin[i][k] = min(dpmin[i][k],dpmin[i-1][1]+1);
                }
            }
          // 
        }
        
    }
    for(int i=1;i<=2*n;i++){
        for(int k=0;k<=1;k++){
            if(k){
                if(a[i-1]<=b[i]){
                    dpmax[i][k] = max(dpmax[i][k],dpmax[i-1][0]);
                }
                if(b[i-1]<=b[i]){
                    dpmax[i][k] = max(dpmax[i][k],dpmax[i-1][1]);
                }
            }else{
                if(a[i-1]<=a[i]){
                    dpmax[i][k] = max(dpmax[i][k],dpmax[i-1][0]+1);
                }
                if(b[i-1]<=a[i]){
                    dpmax[i][k] = max(dpmax[i][k],dpmax[i-1][1]+1);
                }
            }
           // cout<<i<<" "<<k<<" "<<dpmin[i][k]<<" "<<dpmax[i][k]<<endl;
        }
    }
    if((dpmin[2*n][0]<=n && dpmax[2*n][0]>=n)||(dpmin[2*n][1]<=n && dpmax[2*n][1]>=n)){
        string ans = "";
        int cnt = n;
        int lst = 1e9;
        for(int i=2*n;i>=1;i--){
            if((dpmin[i][0]<=cnt && dpmax[i][0]>=cnt) && cnt){
                if((dpmin[i][1]<=cnt && dpmax[i][1]>=cnt)){
                   if(lst == 0){
                       if(a[i]<=a[i+1]){
                           ans+='A';
                            lst = 0;
                            cnt--;
                       }else{
                           ans+='B';
                           lst = 1;
                       }
                   }else if(lst ==1){
                       if(a[i]<=b[i+1]){
                           ans+='A';
                           lst = 0;
                           cnt--;
                       }else{
                           ans+='B';
                           lst = 1;
                       }
                   }else{
                       ans+='A';
                        lst = 0;
                        cnt--;
                   }
                }else{
                    ans+='A';
                    lst = 0;
                    cnt--;
                }
            }else{
                ans+='B';
                lst = 1;
            }
            
        }
        reverse(ans.begin(),ans.end());
        cout<<ans<<endl;
    }else{
        cout<<-1<<endl;
    }
    
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 256 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 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 9 ms 512 KB Output is correct
11 Correct 9 ms 512 KB Output is correct
12 Correct 10 ms 640 KB Output is correct
13 Correct 10 ms 768 KB Output is correct
14 Correct 10 ms 640 KB Output is correct
15 Correct 10 ms 640 KB Output is correct
16 Correct 10 ms 512 KB Output is correct
17 Correct 9 ms 512 KB Output is correct
18 Correct 10 ms 512 KB Output is correct
19 Correct 9 ms 512 KB Output is correct
20 Correct 7 ms 512 KB Output is correct
21 Correct 7 ms 512 KB Output is correct
22 Correct 7 ms 512 KB Output is correct
23 Correct 7 ms 512 KB Output is correct
24 Correct 10 ms 512 KB Output is correct
25 Correct 8 ms 512 KB Output is correct
26 Correct 8 ms 512 KB Output is correct
27 Correct 8 ms 512 KB Output is correct
28 Correct 7 ms 512 KB Output is correct
29 Correct 8 ms 512 KB Output is correct
30 Correct 8 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 4 ms 256 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 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 9 ms 512 KB Output is correct
11 Correct 9 ms 512 KB Output is correct
12 Correct 10 ms 640 KB Output is correct
13 Correct 10 ms 768 KB Output is correct
14 Correct 10 ms 640 KB Output is correct
15 Correct 10 ms 640 KB Output is correct
16 Correct 10 ms 512 KB Output is correct
17 Correct 9 ms 512 KB Output is correct
18 Correct 10 ms 512 KB Output is correct
19 Correct 9 ms 512 KB Output is correct
20 Correct 7 ms 512 KB Output is correct
21 Correct 7 ms 512 KB Output is correct
22 Correct 7 ms 512 KB Output is correct
23 Correct 7 ms 512 KB Output is correct
24 Correct 10 ms 512 KB Output is correct
25 Correct 8 ms 512 KB Output is correct
26 Correct 8 ms 512 KB Output is correct
27 Correct 8 ms 512 KB Output is correct
28 Correct 7 ms 512 KB Output is correct
29 Correct 8 ms 512 KB Output is correct
30 Correct 8 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 1201 ms 32760 KB Output is correct
35 Correct 1147 ms 33596 KB Output is correct
36 Correct 1139 ms 36044 KB Output is correct
37 Correct 1173 ms 33556 KB Output is correct
38 Correct 1144 ms 36932 KB Output is correct
39 Correct 1119 ms 48912 KB Output is correct
40 Correct 1217 ms 35448 KB Output is correct
41 Correct 1150 ms 37152 KB Output is correct
42 Correct 1194 ms 34432 KB Output is correct
43 Correct 1252 ms 34540 KB Output is correct
44 Correct 1255 ms 34644 KB Output is correct
45 Correct 1264 ms 34668 KB Output is correct
46 Correct 1239 ms 34728 KB Output is correct
47 Correct 1189 ms 35564 KB Output is correct
48 Correct 1173 ms 35436 KB Output is correct
49 Correct 1219 ms 34796 KB Output is correct
50 Correct 1201 ms 35436 KB Output is correct
51 Correct 1215 ms 35608 KB Output is correct
52 Correct 689 ms 41324 KB Output is correct
53 Correct 685 ms 41324 KB Output is correct
54 Correct 680 ms 41452 KB Output is correct
55 Correct 668 ms 41068 KB Output is correct
56 Correct 1254 ms 35976 KB Output is correct
57 Correct 994 ms 48108 KB Output is correct
58 Correct 1018 ms 48364 KB Output is correct
59 Correct 1000 ms 48492 KB Output is correct
60 Correct 962 ms 45816 KB Output is correct
61 Correct 1024 ms 48724 KB Output is correct
62 Correct 1008 ms 48084 KB Output is correct
63 Correct 1029 ms 48808 KB Output is correct
64 Correct 984 ms 47152 KB Output is correct
65 Correct 1030 ms 48872 KB Output is correct