oj.uz

Submission #414852

# Submission time Handle Problem Language Result Execution time Memory
414852 2021-05-31T09:15:35 Z NintsiChkhaidze Building 4 (JOI20_building4) C++14
100 / 100
 317 ms 41412 KB 
#include <bits/stdc++.h>
#define pb push_back
#define ll  long long
#define s second
#define f first
using namespace std;
const int N = 1000005;
int a[N],b[N];
pair<int,int> dp[4][N];
main (){
    ios_base::sync_with_stdio(0),cin.tie(NULL),cout.tie(NULL);
    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];
        dp[1][i] = {2e9,0};
        dp[2][i] = {2e9,0};
    }
    
    dp[1][1] = {1,1}; 
    dp[2][1] = {0,0};
    for (int i=1;i<=2*n;i++){
        if (a[i] >= a[i - 1]) dp[1][i] = {min(dp[1][i].f,dp[1][i-1].f + 1),max(dp[1][i].s,dp[1][i-1].s + 1)};   
        if (a[i] >= b[i - 1]) dp[1][i] = {min(dp[1][i].f,dp[2][i-1].f + 1),max(dp[1][i].s,dp[2][i-1].s + 1)};    
        if (b[i] >= a[i - 1]) dp[2][i] = {min(dp[2][i].f,dp[1][i-1].f),max(dp[2][i].s,dp[1][i-1].s)}; 
        if (b[i] >= b[i - 1]) dp[2][i] = {min(dp[2][i].f,dp[2][i-1].f),max(dp[2][i].s,dp[2][i-1].s)};    
    }
    int c=0;
    if (dp[1][2*n].f <= n && dp[1][2*n].s >= n) c=1;
    if (dp[2][2*n].f <= n && dp[2][2*n].s >= n) c=1;
    if (!c) {cout<<-1; return 0;}
    
    string s = "";
    int cnta = n,l=1e9;
    
    for (int i=2*n;i>=1;i--){
        if (a[i] <= l && dp[1][i].f <= cnta && dp[1][i].s >= cnta) cnta--,l=a[i],s+='A';
        else l = b[i],s+='B';
    }
    reverse(s.begin(),s.end());
    cout<<s;
}

Compilation message

building4.cpp:10:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   10 | main (){
      | ^~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 3 ms 332 KB Output is correct
10 Correct 2 ms 332 KB Output is correct
11 Correct 2 ms 332 KB Output is correct
12 Correct 2 ms 460 KB Output is correct
13 Correct 2 ms 460 KB Output is correct
14 Correct 2 ms 460 KB Output is correct
15 Correct 2 ms 392 KB Output is correct
16 Correct 2 ms 332 KB Output is correct
17 Correct 2 ms 460 KB Output is correct
18 Correct 2 ms 460 KB Output is correct
19 Correct 2 ms 460 KB Output is correct
20 Correct 2 ms 460 KB Output is correct
21 Correct 2 ms 460 KB Output is correct
22 Correct 2 ms 460 KB Output is correct
23 Correct 2 ms 460 KB Output is correct
24 Correct 2 ms 460 KB Output is correct
25 Correct 2 ms 460 KB Output is correct
26 Correct 2 ms 460 KB Output is correct
27 Correct 2 ms 460 KB Output is correct
28 Correct 2 ms 332 KB Output is correct
29 Correct 2 ms 460 KB Output is correct
30 Correct 2 ms 332 KB Output is correct
31 Correct 2 ms 460 KB Output is correct
32 Correct 2 ms 332 KB Output is correct
33 Correct 2 ms 460 KB Output is correct
34 Correct 267 ms 24448 KB Output is correct
35 Correct 299 ms 25420 KB Output is correct
36 Correct 261 ms 28248 KB Output is correct
37 Correct 273 ms 25492 KB Output is correct
38 Correct 287 ms 25416 KB Output is correct
39 Correct 270 ms 41412 KB Output is correct
40 Correct 317 ms 27740 KB Output is correct
41 Correct 262 ms 35532 KB Output is correct
42 Correct 316 ms 28184 KB Output is correct
43 Correct 312 ms 27148 KB Output is correct
44 Correct 294 ms 27200 KB Output is correct
45 Correct 313 ms 27920 KB Output is correct
46 Correct 264 ms 27288 KB Output is correct
47 Correct 274 ms 27160 KB Output is correct
48 Correct 266 ms 33468 KB Output is correct
49 Correct 280 ms 27180 KB Output is correct
50 Correct 281 ms 27196 KB Output is correct
51 Correct 295 ms 27996 KB Output is correct
52 Correct 253 ms 33524 KB Output is correct
53 Correct 208 ms 33572 KB Output is correct
54 Correct 210 ms 33504 KB Output is correct
55 Correct 199 ms 33236 KB Output is correct
56 Correct 286 ms 27828 KB Output is correct
57 Correct 257 ms 40216 KB Output is correct
58 Correct 249 ms 40452 KB Output is correct
59 Correct 248 ms 40500 KB Output is correct
60 Correct 231 ms 38420 KB Output is correct
61 Correct 292 ms 40940 KB Output is correct
62 Correct 242 ms 40368 KB Output is correct
63 Correct 262 ms 40872 KB Output is correct
64 Correct 235 ms 39424 KB Output is correct
65 Correct 255 ms 40940 KB Output is correct