oj.uz

Submission #676626

# Submission time Handle Problem Language Result Execution time Memory
676626 2022-12-31T13:32:16 Z ensonlung Building 4 (JOI20_building4) C++17
0 / 100
 2000 ms 14272 KB 
#include <bits/stdc++.h>
using namespace std;
int n,a[200005],b[200005];
string s;
void dfs(int id,int as,int bs,string conf){
	if (id==2*n){
		cout<<conf<<"\n";
		exit(0);
	}
	int tmp=0;
	if (conf[id-1]=='A') tmp=a[id];
	else tmp=b[id]; 
	if (as<n && a[id+1]>=tmp) dfs(id+1,as+1,bs,conf+'A');
	if (bs<n && b[id+1]>=tmp) dfs(id+1,as,bs+1,conf+'B');
}
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cin>>n;
	for (int i=1;i<=2*n;i++) cin>>a[i];
	for (int i=1;i<=2*n;i++) cin>>b[i];
	dfs(1,1,0,"A");
	dfs(1,0,1,"B");
	cout<<"-1\n";
	return 0;
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 74 ms 14272 KB Output is correct
7 Correct 14 ms 11324 KB Output is correct
8 Execution timed out 2067 ms 6160 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #2
0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 74 ms 14272 KB Output is correct
7 Correct 14 ms 11324 KB Output is correct
8 Execution timed out 2067 ms 6160 KB Time limit exceeded
9 Halted 0 ms 0 KB -