oj.uz

Submission #892776

# Submission time Handle Problem Language Result Execution time Memory
892776 2023-12-25T23:37:58 Z amirhoseinfar1385 Building 4 (JOI20_building4) C++17
100 / 100
 161 ms 26008 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
#include<bits/stdc++.h>
using namespace std;
const int maxn=1000000+10;
int n;
int dpl[maxn][2],dpr[maxn][2],all[maxn][2];
string res;

void cal(int ind,int vas,int ted=n){
	while(true){
	if(vas==1){
		res.push_back('B');
		ted--;
	}
	else{
		res.push_back('A');
	}
	if(ind==0){
		return ;
	}
	if(all[ind-1][vas]<=all[ind][vas]&&dpl[ind-1][vas]<=ted&&dpr[ind-1][vas]>=ted){
		ind--;
	}
	else{
		vas^=1;
		ind--;
	}
	}
}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin>>n;
	n*=2;
	for(int i=0;i<n;i++){
		cin>>all[i][0];
	}
	for(int i=0;i<n;i++){
		cin>>all[i][1];
	}
	dpl[0][0]=dpr[0][0]=0;
	dpl[0][1]=dpr[0][1]=1;
	for(int i=1;i<n;i++){
		for(int j=0;j<2;j++){
			dpl[i][j]=maxn+10;
			dpr[i][j]=-1;
			if(dpr[i-1][j]!=-1&&all[i-1][j]<=all[i][j]){
				dpl[i][j]=dpl[i-1][j];
				dpr[i][j]=dpr[i-1][j];
			}
			if(dpr[i-1][j^1]!=-1&&all[i-1][j^1]<=all[i][j]){
				dpl[i][j]=min(dpl[i][j],dpl[i-1][j^1]);
				dpr[i][j]=max(dpr[i][j],dpr[i-1][j^1]);
			}
			if(dpr[i][j]!=-1&&j==1){
				dpr[i][j]++;
				dpl[i][j]++;
			}
		//	cout<<i<<" "<<j<<" "<<dpl[i][j]<<" "<<dpr[i][j]<<"\n";
		}
	}
	n/=2;
	if(n>=dpl[2*n-1][0]&&n<=dpr[2*n-1][0]){
		cal(2*n-1,0);
		reverse(res.begin(),res.end());
		cout<<res<<"\n";
		return 0;
	}
	if(n>=dpl[2*n-1][1]&&n<=dpr[2*n-1][1]){
		cal(2*n-1,1);
		reverse(res.begin(),res.end());
		cout<<res<<"\n";
		return 0;
	}
	cout<<-1<<"\n";
	return 0;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4440 KB Output is correct
5 Correct 2 ms 4444 KB Output is correct
6 Correct 2 ms 4444 KB Output is correct
7 Correct 1 ms 4440 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 2 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 2 ms 4684 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct
22 Correct 1 ms 4444 KB Output is correct
23 Correct 1 ms 4444 KB Output is correct
24 Correct 1 ms 4600 KB Output is correct
25 Correct 1 ms 4444 KB Output is correct
26 Correct 1 ms 4440 KB Output is correct
27 Correct 1 ms 4444 KB Output is correct
28 Correct 2 ms 4444 KB Output is correct
29 Correct 1 ms 4444 KB Output is correct
30 Correct 1 ms 4440 KB Output is correct
31 Correct 1 ms 4696 KB Output is correct
32 Correct 1 ms 4444 KB Output is correct
33 Correct 1 ms 4560 KB Output is correct
34 Correct 142 ms 23676 KB Output is correct
35 Correct 150 ms 25144 KB Output is correct
36 Correct 146 ms 25148 KB Output is correct
37 Correct 154 ms 25360 KB Output is correct
38 Correct 138 ms 25152 KB Output is correct
39 Correct 160 ms 25364 KB Output is correct
40 Correct 149 ms 25928 KB Output is correct
41 Correct 138 ms 25356 KB Output is correct
42 Correct 154 ms 25616 KB Output is correct
43 Correct 160 ms 25980 KB Output is correct
44 Correct 161 ms 25972 KB Output is correct
45 Correct 161 ms 26008 KB Output is correct
46 Correct 156 ms 25968 KB Output is correct
47 Correct 148 ms 25928 KB Output is correct
48 Correct 151 ms 25972 KB Output is correct
49 Correct 148 ms 25968 KB Output is correct
50 Correct 159 ms 25992 KB Output is correct
51 Correct 160 ms 25800 KB Output is correct
52 Correct 110 ms 25932 KB Output is correct
53 Correct 110 ms 25928 KB Output is correct
54 Correct 116 ms 25928 KB Output is correct
55 Correct 101 ms 25932 KB Output is correct
56 Correct 155 ms 25976 KB Output is correct
57 Correct 129 ms 25928 KB Output is correct
58 Correct 126 ms 25972 KB Output is correct
59 Correct 137 ms 25976 KB Output is correct
60 Correct 136 ms 25408 KB Output is correct
61 Correct 131 ms 25928 KB Output is correct
62 Correct 134 ms 25844 KB Output is correct
63 Correct 129 ms 25928 KB Output is correct
64 Correct 124 ms 25664 KB Output is correct
65 Correct 136 ms 25936 KB Output is correct