oj.uz

Submission #211754

# Submission time Handle Problem Language Result Execution time Memory
211754 2020-03-21T07:13:12 Z nafis_shifat Building 4 (JOI20_building4) C++14
100 / 100
 1288 ms 34920 KB 
#include<bits/stdc++.h>
#define pii pair<int,int>
#define ll long long
using namespace std;
int main()
{
	
	int n;
	cin>>n;

	int dp1[2*n+1][2]={};
	int dp2[2*n+1][2]={};
    
    for(int i=0;i<=2*n;i++)dp1[i][0]=dp1[i][1]=1e9+9;
	memset(dp2,-1,sizeof(dp2));


	int a[2*n+1],b[2*n+1];

	for(int i=1;i<=2*n;i++)cin>>a[i];
	for(int i=1;i<=2*n;i++)cin>>b[i];

	dp1[1][0]=dp2[1][0]=1;
    dp1[1][1]=dp2[1][1]=0;




    for(int i=2;i<=2*n;i++)
    {
    	if(a[i-1]<=a[i])
    	{
    		dp1[i][0]=dp1[i-1][0]+1;
    		dp2[i][0]=dp2[i-1][0]+1;
    	}

    	if(b[i-1]<=a[i])
    	{
    		dp1[i][0]=min(dp1[i][0],dp1[i-1][1]+1);
    		dp2[i][0]=max(dp2[i][0],dp2[i-1][1]+1);
    	}

    	if(a[i-1]<=b[i])
    	{
    		dp1[i][1]=dp1[i-1][0];
    		dp2[i][1]=dp2[i-1][0];
    	}

    	if(b[i-1]<=b[i])
    	{
    		dp1[i][1]=min(dp1[i][1],dp1[i-1][1]);
    		dp2[i][1]=max(dp2[i][1],dp2[i-1][1]);

    	}
    	
    	
    	

    }
    
   // cout<<dp2[2*n][0]<<endl;


    int cr=2*n;

    int nx=0;

    int tx=n;


    vector<int> r;

    if(dp1[cr][0]<=n && dp2[cr][0]>=n)
    {
    	r.push_back(0);
    	tx--;
    	if(dp1[cr-1][0]<=tx && dp2[cr-1][0]>=tx && a[cr-1]<=a[cr])nx=0;
    	else nx=1;
    }
    else if(dp1[cr][1]<=n && dp2[cr][1]>=n)
    {
    	r.push_back(1);
    	if(dp1[cr-1][0]<=n && dp2[cr-1][0]>=n && a[cr-1]<=b[cr])nx=0;
    	else nx=1;
    }
    else
    {
    	cout<<-1<<endl;
    	return 0;
    }

    cr--;


    while(cr)
    {
    	r.push_back(nx);
    	if(nx==0 && tx>0)
    	{
    		tx--;
    		if(dp1[cr-1][0]<=tx && dp2[cr-1][0]>=tx && a[cr-1]<=a[cr])nx=0;
    		else nx=1;
    		cr--;
    		continue;
    	}
    	else
    	{
    		if(dp1[cr-1][0]<=tx && dp2[cr-1][0]>=tx && a[cr-1]<=b[cr])nx=0;
    		else nx=1;
    		cr--;
    		continue;

    	}
    }

    reverse(r.begin(),r.end());
    
    for(int i=0;i<r.size();i++)
    {
    	if(r[i]==0)cout<<"A";
    	else cout<<"B";
	}


	return 0;
}

Compilation message

building4.cpp: In function 'int main()':
building4.cpp:118:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<r.size();i++)
                 ~^~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 256 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 4 ms 256 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 13 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 10 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 512 KB Output is correct
13 Correct 10 ms 512 KB Output is correct
14 Correct 13 ms 512 KB Output is correct
15 Correct 10 ms 512 KB Output is correct
16 Correct 10 ms 512 KB Output is correct
17 Correct 11 ms 640 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 8 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 11 ms 512 KB Output is correct
25 Correct 8 ms 560 KB Output is correct
26 Correct 8 ms 512 KB Output is correct
27 Correct 8 ms 640 KB Output is correct
28 Correct 8 ms 512 KB Output is correct
29 Correct 8 ms 512 KB Output is correct
30 Correct 7 ms 512 KB Output is correct
31 Correct 8 ms 512 KB Output is correct
32 Correct 7 ms 384 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 4 ms 256 KB Output is correct
3 Correct 4 ms 256 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 13 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 10 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 512 KB Output is correct
13 Correct 10 ms 512 KB Output is correct
14 Correct 13 ms 512 KB Output is correct
15 Correct 10 ms 512 KB Output is correct
16 Correct 10 ms 512 KB Output is correct
17 Correct 11 ms 640 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 8 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 11 ms 512 KB Output is correct
25 Correct 8 ms 560 KB Output is correct
26 Correct 8 ms 512 KB Output is correct
27 Correct 8 ms 640 KB Output is correct
28 Correct 8 ms 512 KB Output is correct
29 Correct 8 ms 512 KB Output is correct
30 Correct 7 ms 512 KB Output is correct
31 Correct 8 ms 512 KB Output is correct
32 Correct 7 ms 384 KB Output is correct
33 Correct 8 ms 512 KB Output is correct
34 Correct 1205 ms 31536 KB Output is correct
35 Correct 1178 ms 27596 KB Output is correct
36 Correct 1175 ms 26588 KB Output is correct
37 Correct 1219 ms 28564 KB Output is correct
38 Correct 1177 ms 28380 KB Output is correct
39 Correct 1127 ms 27380 KB Output is correct
40 Correct 1233 ms 33732 KB Output is correct
41 Correct 1167 ms 27736 KB Output is correct
42 Correct 1247 ms 32808 KB Output is correct
43 Correct 1288 ms 33736 KB Output is correct
44 Correct 1284 ms 34228 KB Output is correct
45 Correct 1276 ms 34144 KB Output is correct
46 Correct 1256 ms 33440 KB Output is correct
47 Correct 1232 ms 29148 KB Output is correct
48 Correct 1221 ms 34140 KB Output is correct
49 Correct 1252 ms 34140 KB Output is correct
50 Correct 1243 ms 33764 KB Output is correct
51 Correct 1244 ms 33828 KB Output is correct
52 Correct 706 ms 32092 KB Output is correct
53 Correct 709 ms 32092 KB Output is correct
54 Correct 693 ms 31916 KB Output is correct
55 Correct 677 ms 31792 KB Output is correct
56 Correct 1270 ms 33500 KB Output is correct
57 Correct 1029 ms 34272 KB Output is correct
58 Correct 1024 ms 34536 KB Output is correct
59 Correct 1026 ms 34920 KB Output is correct
60 Correct 978 ms 33116 KB Output is correct
61 Correct 1038 ms 34324 KB Output is correct
62 Correct 1037 ms 34076 KB Output is correct
63 Correct 1048 ms 34396 KB Output is correct
64 Correct 996 ms 32732 KB Output is correct
65 Correct 1048 ms 33820 KB Output is correct