oj.uz

Submission #954536

# Submission time Handle Problem Language Result Execution time Memory
954536 2024-03-28T06:19:07 Z LCJLY Building 4 (JOI20_building4) C++14
100 / 100
 285 ms 145980 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define int long long 
#define ld long double
#define show(x,y) cout << y << " " << #x << endl;
#define show2(x,y,i,j) cout << y << " " << #x << "  " << j << " " << #i << endl;
#define show3(x,y,i,j,p,q) cout << y << " " << #x << "  " << j << " " << #i << "  " << q << " " << #p << endl;
#define show4(x,y) for(auto it:y) cout << it << " "; cout << #x << endl;
typedef pair<int,int>pii;
typedef pair<pii,pii>pi2;
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
 
int n;
int a[1000005];
int b[1000005];
pii memo[1000005][2];

pii dp(int index, bool amos){
	if(index>2*n){
		return memo[index][amos]={0,0};
	}
	if(memo[index][amos].first!=-1) return memo[index][amos];
	pii ans={INT_MAX,INT_MIN};
	if(amos){
		if(a[index]>=a[index-1]){
			pii hold=dp(index+1,true);
			if(hold.first<=hold.second){
				ans.first=min(ans.first,hold.first+1);
				ans.second=max(ans.second,hold.second+1);
			}
		}
		if(b[index]>=a[index-1]){
			pii hold=dp(index+1,false);
			if(hold.first<=hold.second){
				ans.first=min(ans.first,hold.first);
				ans.second=max(ans.second,hold.second);
			}
		}
	}
	else{
		if(a[index]>=b[index-1]){
			pii hold=dp(index+1,true);
			if(hold.first<=hold.second){
				ans.first=min(ans.first,hold.first+1);
				ans.second=max(ans.second,hold.second+1);
			}
		}
		if(b[index]>=b[index-1]){
			pii hold=dp(index+1,false);
			if(hold.first<=hold.second){
				ans.first=min(ans.first,hold.first);
				ans.second=max(ans.second,hold.second);
			}
		}
	}
	return memo[index][amos]=ans;
}

void dfs(int index, bool amos, int need){
	if(index>2*n) return;
	pii take={INT_MAX,INT_MIN};
	pii take2={INT_MAX,INT_MIN};
	
	if(amos){
		if(a[index]>=a[index-1]){
			take=memo[index+1][true];
			take.first++;
			take.second++;
		}
		if(b[index]>=a[index-1]){
			take2=memo[index+1][false];
		}
	}
	else{
		if(a[index]>=b[index-1]){
			take=memo[index+1][true];
			take.first++;
			take.second++;
		}
		if(b[index]>=b[index-1]){
			take2=memo[index+1][false];
		}
	}
	
	if(take.first<=need&&take.second>=need){
		cout << "A";
		dfs(index+1,true,need-1);
	}
	else{
		cout << "B";
		dfs(index+1,false,need);
	}
}
 
void solve(){
	cin >> n;
	
	for(int x=1;x<=2*n;x++){
		cin >> a[x];
	}
	
	for(int x=1;x<=2*n;x++){
		cin >> b[x];
	}
	
	memset(memo,-1,sizeof(memo));
	pii hold=dp(1,0);
	
	if(hold.first<=n&&hold.second>=n){
		dfs(1,0,n);
	}
	else{
		cout << -1;
	}
}	
 
int32_t main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	int t=1;
	//cin >> t;
	while(t--){
		solve();
	}
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 35420 KB Output is correct
2 Correct 9 ms 35420 KB Output is correct
3 Correct 5 ms 35420 KB Output is correct
4 Correct 5 ms 35420 KB Output is correct
5 Correct 8 ms 37468 KB Output is correct
6 Correct 6 ms 37924 KB Output is correct
7 Correct 6 ms 35812 KB Output is correct
8 Correct 6 ms 35676 KB Output is correct
9 Correct 6 ms 35676 KB Output is correct
10 Correct 6 ms 35676 KB Output is correct
11 Correct 6 ms 37720 KB Output is correct
12 Correct 8 ms 37724 KB Output is correct
13 Correct 6 ms 37904 KB Output is correct
14 Correct 6 ms 37972 KB Output is correct
15 Correct 6 ms 37724 KB Output is correct
16 Correct 7 ms 37724 KB Output is correct
17 Correct 8 ms 37724 KB Output is correct
18 Correct 6 ms 37724 KB Output is correct
19 Correct 6 ms 37724 KB Output is correct
20 Correct 7 ms 37856 KB Output is correct
21 Correct 6 ms 37724 KB Output is correct
22 Correct 6 ms 37720 KB Output is correct
23 Correct 6 ms 37720 KB Output is correct
24 Correct 9 ms 37928 KB Output is correct
25 Correct 6 ms 37724 KB Output is correct
26 Correct 6 ms 37724 KB Output is correct
27 Correct 6 ms 37852 KB Output is correct
28 Correct 6 ms 37724 KB Output is correct
29 Correct 6 ms 37892 KB Output is correct
30 Correct 6 ms 37724 KB Output is correct
31 Correct 6 ms 37724 KB Output is correct
32 Correct 5 ms 35672 KB Output is correct
33 Correct 6 ms 37724 KB Output is correct

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 35420 KB Output is correct
2 Correct 9 ms 35420 KB Output is correct
3 Correct 5 ms 35420 KB Output is correct
4 Correct 5 ms 35420 KB Output is correct
5 Correct 8 ms 37468 KB Output is correct
6 Correct 6 ms 37924 KB Output is correct
7 Correct 6 ms 35812 KB Output is correct
8 Correct 6 ms 35676 KB Output is correct
9 Correct 6 ms 35676 KB Output is correct
10 Correct 6 ms 35676 KB Output is correct
11 Correct 6 ms 37720 KB Output is correct
12 Correct 8 ms 37724 KB Output is correct
13 Correct 6 ms 37904 KB Output is correct
14 Correct 6 ms 37972 KB Output is correct
15 Correct 6 ms 37724 KB Output is correct
16 Correct 7 ms 37724 KB Output is correct
17 Correct 8 ms 37724 KB Output is correct
18 Correct 6 ms 37724 KB Output is correct
19 Correct 6 ms 37724 KB Output is correct
20 Correct 7 ms 37856 KB Output is correct
21 Correct 6 ms 37724 KB Output is correct
22 Correct 6 ms 37720 KB Output is correct
23 Correct 6 ms 37720 KB Output is correct
24 Correct 9 ms 37928 KB Output is correct
25 Correct 6 ms 37724 KB Output is correct
26 Correct 6 ms 37724 KB Output is correct
27 Correct 6 ms 37852 KB Output is correct
28 Correct 6 ms 37724 KB Output is correct
29 Correct 6 ms 37892 KB Output is correct
30 Correct 6 ms 37724 KB Output is correct
31 Correct 6 ms 37724 KB Output is correct
32 Correct 5 ms 35672 KB Output is correct
33 Correct 6 ms 37724 KB Output is correct
34 Correct 154 ms 66108 KB Output is correct
35 Correct 227 ms 138228 KB Output is correct
36 Correct 249 ms 136528 KB Output is correct
37 Correct 283 ms 138576 KB Output is correct
38 Correct 240 ms 138580 KB Output is correct
39 Correct 248 ms 138164 KB Output is correct
40 Correct 243 ms 145184 KB Output is correct
41 Correct 285 ms 140080 KB Output is correct
42 Correct 236 ms 142392 KB Output is correct
43 Correct 245 ms 145864 KB Output is correct
44 Correct 251 ms 145836 KB Output is correct
45 Correct 255 ms 145980 KB Output is correct
46 Correct 237 ms 145836 KB Output is correct
47 Correct 244 ms 144984 KB Output is correct
48 Correct 235 ms 144700 KB Output is correct
49 Correct 243 ms 145920 KB Output is correct
50 Correct 244 ms 144944 KB Output is correct
51 Correct 245 ms 144956 KB Output is correct
52 Correct 199 ms 134224 KB Output is correct
53 Correct 210 ms 134280 KB Output is correct
54 Correct 192 ms 134052 KB Output is correct
55 Correct 188 ms 133820 KB Output is correct
56 Correct 270 ms 145980 KB Output is correct
57 Correct 250 ms 140604 KB Output is correct
58 Correct 224 ms 140996 KB Output is correct
59 Correct 210 ms 141140 KB Output is correct
60 Correct 200 ms 135248 KB Output is correct
61 Correct 208 ms 141456 KB Output is correct
62 Correct 206 ms 140112 KB Output is correct
63 Correct 229 ms 141596 KB Output is correct
64 Correct 202 ms 138140 KB Output is correct
65 Correct 215 ms 141568 KB Output is correct