oj.uz

Submission #388674

# Submission time Handle Problem Language Result Execution time Memory
388674 2021-04-12T14:42:51 Z ogibogi2004 Building 4 (JOI20_building4) C++14
100 / 100
 980 ms 45396 KB 
#include<bits/stdc++.h>
using namespace std;
const int MAXN=1e6+6;
int a[MAXN][2];
int n;
int dpmin[MAXN][2];
int dpmax[MAXN][2];
string ans="";
int main()
{
	cin>>n;
	for(int i=1;i<=2*n;i++)cin>>a[i][0];
	for(int i=1;i<=2*n;i++)cin>>a[i][1];
	dpmin[1][1]=1;
	dpmin[1][0]=0;
	dpmax[1][1]=1;
	dpmax[1][0]=0;
	for(int i=2;i<=2*n;i++)
	{
		dpmin[i][0]=MAXN;
		dpmin[i][1]=MAXN;
		if(a[i][0]>=a[i-1][0])
		{
			dpmin[i][0]=min(dpmin[i][0],dpmin[i-1][0]);
			dpmax[i][0]=max(dpmax[i][0],dpmax[i-1][0]);
		}
		if(a[i][0]>=a[i-1][1])
		{
			dpmin[i][0]=min(dpmin[i][0],dpmin[i-1][1]);
			dpmax[i][0]=max(dpmax[i][0],dpmax[i-1][1]);
		}
		if(a[i][1]>=a[i-1][0])
		{
			dpmin[i][1]=min(dpmin[i][1],dpmin[i-1][0]+1);
			dpmax[i][1]=max(dpmax[i][1],dpmax[i-1][0]+1);
		}
		if(a[i][1]>=a[i-1][1])
		{
			dpmin[i][1]=min(dpmin[i][1],dpmin[i-1][1]+1);
			dpmax[i][1]=max(dpmax[i][1],dpmax[i-1][1]+1);
		}
		//cout<<dpmax[i][1]<<" "<<dpmax[i][0]<<" "<<dpmin[i][1]<<" "<<dpmin[i][0]<<endl;
	}
	int t,cnt;
	if(dpmax[2*n][0]>=n&&dpmin[2*n][0]<=n)
	{
		ans+='A';
		t=0;
		cnt=0;
	}
	else if(dpmax[2*n][1]>=n&&dpmin[2*n][1]<=n)
	{
		ans+='B';
		t=1;
		cnt=1;
	}
	else
	{
		cout<<"-1\n";
		return 0;
	}
	for(int i=2*n-1;i>=1;i--)
	{
		if(a[i+1][t]>=a[i][0]&&dpmin[i][0]<=n-cnt&&dpmax[i][0]>=n-cnt)
		{
			t=0;
			ans+='A';
		}
		else
		{
			t=1;
			ans+='B';
			cnt++;
		}
	}
	reverse(ans.begin(),ans.end());
	cout<<ans<<endl;
return 0;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 4 ms 336 KB Output is correct
6 Correct 5 ms 332 KB Output is correct
7 Correct 3 ms 460 KB Output is correct
8 Correct 4 ms 460 KB Output is correct
9 Correct 4 ms 400 KB Output is correct
10 Correct 4 ms 460 KB Output is correct
11 Correct 4 ms 448 KB Output is correct
12 Correct 4 ms 412 KB Output is correct
13 Correct 4 ms 460 KB Output is correct
14 Correct 4 ms 460 KB Output is correct
15 Correct 4 ms 460 KB Output is correct
16 Correct 4 ms 404 KB Output is correct
17 Correct 4 ms 460 KB Output is correct
18 Correct 4 ms 464 KB Output is correct
19 Correct 4 ms 460 KB Output is correct
20 Correct 2 ms 460 KB Output is correct
21 Correct 3 ms 460 KB Output is correct
22 Correct 3 ms 448 KB Output is correct
23 Correct 2 ms 460 KB Output is correct
24 Correct 4 ms 460 KB Output is correct
25 Correct 3 ms 460 KB Output is correct
26 Correct 4 ms 460 KB Output is correct
27 Correct 3 ms 460 KB Output is correct
28 Correct 3 ms 332 KB Output is correct
29 Correct 3 ms 460 KB Output is correct
30 Correct 3 ms 328 KB Output is correct
31 Correct 3 ms 460 KB Output is correct
32 Correct 3 ms 332 KB Output is correct
33 Correct 3 ms 460 KB Output is correct
34 Correct 902 ms 42344 KB Output is correct
35 Correct 802 ms 42036 KB Output is correct
36 Correct 791 ms 41340 KB Output is correct
37 Correct 805 ms 42276 KB Output is correct
38 Correct 794 ms 42072 KB Output is correct
39 Correct 763 ms 41340 KB Output is correct
40 Correct 843 ms 44688 KB Output is correct
41 Correct 796 ms 42232 KB Output is correct
42 Correct 832 ms 43848 KB Output is correct
43 Correct 862 ms 45264 KB Output is correct
44 Correct 864 ms 45368 KB Output is correct
45 Correct 906 ms 45244 KB Output is correct
46 Correct 860 ms 45140 KB Output is correct
47 Correct 822 ms 44364 KB Output is correct
48 Correct 819 ms 44080 KB Output is correct
49 Correct 861 ms 44920 KB Output is correct
50 Correct 837 ms 44516 KB Output is correct
51 Correct 844 ms 44436 KB Output is correct
52 Correct 492 ms 33444 KB Output is correct
53 Correct 494 ms 33464 KB Output is correct
54 Correct 481 ms 33472 KB Output is correct
55 Correct 480 ms 33184 KB Output is correct
56 Correct 980 ms 45396 KB Output is correct
57 Correct 739 ms 40328 KB Output is correct
58 Correct 786 ms 40428 KB Output is correct
59 Correct 760 ms 40532 KB Output is correct
60 Correct 718 ms 38628 KB Output is correct
61 Correct 754 ms 40820 KB Output is correct
62 Correct 722 ms 40272 KB Output is correct
63 Correct 720 ms 40868 KB Output is correct
64 Correct 689 ms 39536 KB Output is correct
65 Correct 761 ms 40896 KB Output is correct