oj.uz

Submission #789081

# Submission time Handle Problem Language Result Execution time Memory
789081 2023-07-21T03:17:05 Z 1075508020060209tc Building 4 (JOI20_building4) C++14
100 / 100
 610 ms 75720 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,popcnt,sse4,abm")
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define X first
#define Y second
int n;
int ar[1000006];
int br[1000006];
pair<int,int>dp[2][1000006];
int ans[1000006];
signed main(){
cin>>n;n*=2;
for(int i=1;i<=n;i++){
    cin>>ar[i];
}
for(int i=1;i<=n;i++){
    cin>>br[i];
}
dp[0][1]={0,0};
dp[1][1]={1,1};
for(int i=2;i<=n;i++){
    pair<int,int>a={1e9,-1e9};pair<int,int>b={1e9,-1e9};
    if(ar[i]>=ar[i-1]){
        a=dp[0][i-1];
    }
    if(ar[i]>=br[i-1]){
        a={min(dp[1][i-1].first,a.first),max(dp[1][i-1].second,a.second)};
    }
    if(br[i]>=ar[i-1]){
        b=dp[0][i-1];
        b.first++;b.second++;
    }
    if(br[i]>=br[i-1]){
        b={min(dp[1][i-1].first+1,b.first),max(dp[1][i-1].second+1,b.second)};
    }
    dp[1][i]=b;
    dp[0][i]=a;
}



int bcnt=0;int lst=1e18;
for(int i=n;i>=1;i--){
    if(br[i]<=lst&&n/2-bcnt>=dp[1][i].first&&n/2-bcnt<=dp[1][i].second){
        ans[i]=1;
        bcnt++;
        lst=br[i];
    }else{
        if(ar[i]>lst){cout<<-1;return 0;}
        ans[i]=0;
        lst=ar[i];

    }
}
if(bcnt!=n/2){cout<<-1;return 0;}


for(int i=1;i<=n;i++){
    if(ans[i]==0){
        cout<<"A";
    }else{
        cout<<"B";
    }
}

}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 308 KB Output is correct
5 Correct 3 ms 468 KB Output is correct
6 Correct 3 ms 596 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 3 ms 596 KB Output is correct
9 Correct 2 ms 596 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 3 ms 596 KB Output is correct
12 Correct 3 ms 596 KB Output is correct
13 Correct 3 ms 528 KB Output is correct
14 Correct 3 ms 596 KB Output is correct
15 Correct 4 ms 556 KB Output is correct
16 Correct 3 ms 520 KB Output is correct
17 Correct 3 ms 524 KB Output is correct
18 Correct 3 ms 596 KB Output is correct
19 Correct 3 ms 552 KB Output is correct
20 Correct 2 ms 468 KB Output is correct
21 Correct 2 ms 596 KB Output is correct
22 Correct 2 ms 468 KB Output is correct
23 Correct 2 ms 468 KB Output is correct
24 Correct 3 ms 596 KB Output is correct
25 Correct 2 ms 596 KB Output is correct
26 Correct 2 ms 468 KB Output is correct
27 Correct 2 ms 596 KB Output is correct
28 Correct 2 ms 444 KB Output is correct
29 Correct 2 ms 528 KB Output is correct
30 Correct 2 ms 468 KB Output is correct
31 Correct 2 ms 596 KB Output is correct
32 Correct 2 ms 468 KB Output is correct
33 Correct 2 ms 596 KB Output is correct

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 308 KB Output is correct
5 Correct 3 ms 468 KB Output is correct
6 Correct 3 ms 596 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 3 ms 596 KB Output is correct
9 Correct 2 ms 596 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 3 ms 596 KB Output is correct
12 Correct 3 ms 596 KB Output is correct
13 Correct 3 ms 528 KB Output is correct
14 Correct 3 ms 596 KB Output is correct
15 Correct 4 ms 556 KB Output is correct
16 Correct 3 ms 520 KB Output is correct
17 Correct 3 ms 524 KB Output is correct
18 Correct 3 ms 596 KB Output is correct
19 Correct 3 ms 552 KB Output is correct
20 Correct 2 ms 468 KB Output is correct
21 Correct 2 ms 596 KB Output is correct
22 Correct 2 ms 468 KB Output is correct
23 Correct 2 ms 468 KB Output is correct
24 Correct 3 ms 596 KB Output is correct
25 Correct 2 ms 596 KB Output is correct
26 Correct 2 ms 468 KB Output is correct
27 Correct 2 ms 596 KB Output is correct
28 Correct 2 ms 444 KB Output is correct
29 Correct 2 ms 528 KB Output is correct
30 Correct 2 ms 468 KB Output is correct
31 Correct 2 ms 596 KB Output is correct
32 Correct 2 ms 468 KB Output is correct
33 Correct 2 ms 596 KB Output is correct
34 Correct 561 ms 65552 KB Output is correct
35 Correct 554 ms 69952 KB Output is correct
36 Correct 552 ms 68868 KB Output is correct
37 Correct 559 ms 70160 KB Output is correct
38 Correct 573 ms 70212 KB Output is correct
39 Correct 532 ms 69564 KB Output is correct
40 Correct 578 ms 74976 KB Output is correct
41 Correct 541 ms 71016 KB Output is correct
42 Correct 568 ms 72944 KB Output is correct
43 Correct 604 ms 75336 KB Output is correct
44 Correct 604 ms 75464 KB Output is correct
45 Correct 610 ms 75340 KB Output is correct
46 Correct 592 ms 75360 KB Output is correct
47 Correct 561 ms 74444 KB Output is correct
48 Correct 580 ms 74400 KB Output is correct
49 Correct 583 ms 75172 KB Output is correct
50 Correct 578 ms 74528 KB Output is correct
51 Correct 578 ms 74556 KB Output is correct
52 Correct 344 ms 63664 KB Output is correct
53 Correct 340 ms 63688 KB Output is correct
54 Correct 335 ms 63604 KB Output is correct
55 Correct 322 ms 63416 KB Output is correct
56 Correct 587 ms 75720 KB Output is correct
57 Correct 486 ms 70292 KB Output is correct
58 Correct 488 ms 70592 KB Output is correct
59 Correct 485 ms 70732 KB Output is correct
60 Correct 468 ms 66784 KB Output is correct
61 Correct 486 ms 71112 KB Output is correct
62 Correct 493 ms 70000 KB Output is correct
63 Correct 500 ms 71104 KB Output is correct
64 Correct 485 ms 68692 KB Output is correct
65 Correct 496 ms 71112 KB Output is correct