oj.uz

Submission #312176

# Submission time Handle Problem Language Result Execution time Memory
312176 2020-10-12T14:52:02 Z vipghn2003 Building 4 (JOI20_building4) C++14
100 / 100
 367 ms 73976 KB 
#include<bits/stdc++.h>
#define pii pair<int,int>
#define fi first
#define se second
#define mp make_pair
using namespace std;

const int N=1e6+5;
int n,a[N][2];
pii dp[N][2];
bool vis[N][2];

void calc(int i,int j)
{
    if(vis[i][j]) return ;
    vis[i][j]=true;
    dp[i][j].fi=1e9;
    dp[i][j].se=-1e9;
    if(a[i][j]<=a[i+1][0])
    {
        calc(i+1,0);
        dp[i][j].fi=min(dp[i][j].fi,dp[i+1][0].fi);
        dp[i][j].se=max(dp[i][j].se,dp[i+1][0].se);
    }
    if(a[i][j]<=a[i+1][1])
    {
        calc(i+1,1);
        dp[i][j].fi=min(dp[i][j].fi,dp[i+1][1].fi+1);
        dp[i][j].se=max(dp[i][j].se,dp[i+1][1].se+1);
    }
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cin>>n;
    n*=2;
    for(int j=0;j<2;j++)
    {
        for(int i=1;i<=n;i++) cin>>a[i][j];
    }
    vis[n][0]=true;
    vis[n][1]=true;
    calc(0,0);
    if(dp[0][0].fi>n/2||dp[0][0].se<n/2) return cout<<-1,0;
    int need=n/2;
    int last=0;
    for(int i=1;i<=n;i++)
    {
        if(a[i][0]>=a[i-1][last]&&dp[i][0].fi<=need&&dp[i][0].se>=need)
        {
            last=0;
            cout<<"A";
        }
        else
        {
            last=1;
            need--;
            cout<<"B";
        }
    }
}

Subtask #1
11.0 / 11.0

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

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 640 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Correct 1 ms 640 KB Output is correct
9 Correct 1 ms 640 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 2 ms 640 KB Output is correct
12 Correct 2 ms 640 KB Output is correct
13 Correct 2 ms 640 KB Output is correct
14 Correct 2 ms 640 KB Output is correct
15 Correct 2 ms 640 KB Output is correct
16 Correct 1 ms 640 KB Output is correct
17 Correct 2 ms 640 KB Output is correct
18 Correct 2 ms 640 KB Output is correct
19 Correct 2 ms 640 KB Output is correct
20 Correct 1 ms 640 KB Output is correct
21 Correct 2 ms 640 KB Output is correct
22 Correct 1 ms 640 KB Output is correct
23 Correct 1 ms 640 KB Output is correct
24 Correct 2 ms 640 KB Output is correct
25 Correct 1 ms 640 KB Output is correct
26 Correct 2 ms 640 KB Output is correct
27 Correct 1 ms 640 KB Output is correct
28 Correct 2 ms 640 KB Output is correct
29 Correct 1 ms 640 KB Output is correct
30 Correct 1 ms 640 KB Output is correct
31 Correct 2 ms 640 KB Output is correct
32 Correct 1 ms 640 KB Output is correct
33 Correct 2 ms 640 KB Output is correct
34 Correct 219 ms 8056 KB Output is correct
35 Correct 307 ms 68472 KB Output is correct
36 Correct 292 ms 67320 KB Output is correct
37 Correct 302 ms 68812 KB Output is correct
38 Correct 294 ms 68600 KB Output is correct
39 Correct 291 ms 69112 KB Output is correct
40 Correct 313 ms 73404 KB Output is correct
41 Correct 309 ms 70140 KB Output is correct
42 Correct 305 ms 71420 KB Output is correct
43 Correct 324 ms 73720 KB Output is correct
44 Correct 319 ms 73776 KB Output is correct
45 Correct 323 ms 73848 KB Output is correct
46 Correct 307 ms 73976 KB Output is correct
47 Correct 317 ms 73848 KB Output is correct
48 Correct 305 ms 73920 KB Output is correct
49 Correct 367 ms 73816 KB Output is correct
50 Correct 320 ms 73848 KB Output is correct
51 Correct 328 ms 73848 KB Output is correct
52 Correct 252 ms 73848 KB Output is correct
53 Correct 249 ms 73720 KB Output is correct
54 Correct 241 ms 73720 KB Output is correct
55 Correct 241 ms 73720 KB Output is correct
56 Correct 329 ms 73696 KB Output is correct
57 Correct 283 ms 73336 KB Output is correct
58 Correct 290 ms 73848 KB Output is correct
59 Correct 280 ms 73724 KB Output is correct
60 Correct 265 ms 69368 KB Output is correct
61 Correct 290 ms 73848 KB Output is correct
62 Correct 278 ms 72788 KB Output is correct
63 Correct 283 ms 73720 KB Output is correct
64 Correct 270 ms 71288 KB Output is correct
65 Correct 281 ms 73848 KB Output is correct