oj.uz

Submission #952982

# Submission time Handle Problem Language Result Execution time Memory
952982 2024-03-25T08:36:26 Z andrei_boaca Building 4 (JOI20_building4) C++17
100 / 100
 204 ms 45636 KB 
#include <bits/stdc++.h>

using namespace std;
struct date
{
    int l,r;
};
int n,a[1000005],b[1000005];
int last;
char sol[1000005];
date dp[2][1000005];  /// 0 -> A, 1 -> B
date plsput(date a, date b)
{
    if(a.l==-1)
        return b;
    a.l=min(a.l,b.l);
    a.r=max(a.r,b.r);
    return a;
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin>>n;
    n*=2;
    for(int i=1;i<=n;i++)
        cin>>a[i];
    for(int i=1;i<=n;i++)
        cin>>b[i];
    dp[0][1]={1,1};
    dp[1][1]={0,0};
    for(int i=2;i<=n;i++)
    {
        dp[0][i]={-1,-1};
        dp[1][i]={-1,-1};
        if(dp[0][i-1].l!=-1&&a[i]>=a[i-1])
            dp[0][i]=plsput(dp[0][i],{dp[0][i-1].l+1,dp[0][i-1].r+1});
        if(dp[1][i-1].l!=-1&&a[i]>=b[i-1])
            dp[0][i]=plsput(dp[0][i],{dp[1][i-1].l+1,dp[1][i-1].r+1});


        if(dp[0][i-1].l!=-1&&b[i]>=a[i-1])
            dp[1][i]=plsput(dp[1][i],{dp[0][i-1].l,dp[0][i-1].r});
        if(dp[1][i-1].l!=-1&&b[i]>=b[i-1])
            dp[1][i]=plsput(dp[1][i],{dp[1][i-1].l,dp[1][i-1].r});
    }
    int poz=n;
    int need=n/2;
    int last=2e9;
    while(poz>0)
    {
        if(dp[0][poz].l<=need&&dp[0][poz].r>=need&&a[poz]<=last)
        {
            last=a[poz];
            sol[poz]='A';
            need--;
            poz--;
            continue;
        }
        if(dp[1][poz].l<=need&&dp[1][poz].r>=need&&b[poz]<=last)
        {
            last=b[poz];
            sol[poz]='B';
            poz--;
            continue;
        }
        cout<<-1;
        return 0;
    }
    for(int i=1;i<=n;i++)
        cout<<sol[i];
    return 0;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8536 KB Output is correct
2 Correct 1 ms 6488 KB Output is correct
3 Correct 2 ms 8540 KB Output is correct
4 Correct 3 ms 8540 KB Output is correct
5 Correct 2 ms 6492 KB Output is correct
6 Correct 3 ms 8540 KB Output is correct
7 Correct 2 ms 8540 KB Output is correct
8 Correct 2 ms 8732 KB Output is correct
9 Correct 2 ms 8672 KB Output is correct
10 Correct 2 ms 8536 KB Output is correct
11 Correct 3 ms 8540 KB Output is correct
12 Correct 3 ms 8540 KB Output is correct
13 Correct 2 ms 8668 KB Output is correct
14 Correct 2 ms 8540 KB Output is correct
15 Correct 2 ms 8540 KB Output is correct
16 Correct 2 ms 6488 KB Output is correct
17 Correct 2 ms 8536 KB Output is correct
18 Correct 2 ms 8540 KB Output is correct
19 Correct 4 ms 8536 KB Output is correct
20 Correct 2 ms 8540 KB Output is correct
21 Correct 2 ms 8536 KB Output is correct
22 Correct 2 ms 8552 KB Output is correct
23 Correct 2 ms 8540 KB Output is correct
24 Correct 2 ms 8540 KB Output is correct
25 Correct 3 ms 8536 KB Output is correct
26 Correct 2 ms 8540 KB Output is correct
27 Correct 2 ms 8668 KB Output is correct
28 Correct 2 ms 8540 KB Output is correct
29 Correct 2 ms 8540 KB Output is correct
30 Correct 2 ms 8540 KB Output is correct
31 Correct 2 ms 8540 KB Output is correct
32 Correct 2 ms 8540 KB Output is correct
33 Correct 2 ms 8540 KB Output is correct
34 Correct 158 ms 43856 KB Output is correct
35 Correct 190 ms 43548 KB Output is correct
36 Correct 168 ms 42928 KB Output is correct
37 Correct 172 ms 43348 KB Output is correct
38 Correct 199 ms 43640 KB Output is correct
39 Correct 174 ms 42628 KB Output is correct
40 Correct 173 ms 44628 KB Output is correct
41 Correct 167 ms 43200 KB Output is correct
42 Correct 178 ms 44376 KB Output is correct
43 Correct 184 ms 45056 KB Output is correct
44 Correct 204 ms 45192 KB Output is correct
45 Correct 194 ms 45244 KB Output is correct
46 Correct 177 ms 45636 KB Output is correct
47 Correct 175 ms 44372 KB Output is correct
48 Correct 176 ms 43968 KB Output is correct
49 Correct 191 ms 44920 KB Output is correct
50 Correct 188 ms 44360 KB Output is correct
51 Correct 203 ms 44768 KB Output is correct
52 Correct 128 ms 33360 KB Output is correct
53 Correct 126 ms 33544 KB Output is correct
54 Correct 122 ms 33364 KB Output is correct
55 Correct 121 ms 33144 KB Output is correct
56 Correct 180 ms 45312 KB Output is correct
57 Correct 148 ms 40276 KB Output is correct
58 Correct 156 ms 40272 KB Output is correct
59 Correct 173 ms 40252 KB Output is correct
60 Correct 151 ms 39688 KB Output is correct
61 Correct 155 ms 40876 KB Output is correct
62 Correct 153 ms 40532 KB Output is correct
63 Correct 186 ms 40696 KB Output is correct
64 Correct 148 ms 40132 KB Output is correct
65 Correct 156 ms 41448 KB Output is correct