oj.uz

답안 #979457

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
979457 2024-05-11T04:14:12 Z happy_node 건물 4 (JOI20_building4) C++17
100 / 100
 209 ms 45388 KB 
#include <bits/stdc++.h>
using namespace std;

const int MX=1e6+5;

int N;
int A[MX][2], L[MX][2], R[MX][2];

int main() {
	cin.tie(0); ios_base::sync_with_stdio(0);

	int N;
	cin>>N;
	for(int i=0;i<2*N;i++) cin>>A[i][0];
	for(int i=0;i<2*N;i++) cin>>A[i][1];

	L[0][0]=0;
	R[0][0]=0;
	L[0][1]=1;
	R[0][1]=1;

	for(int i=1;i<2*N;i++) {
		for(int j=0;j<2;j++) {
			L[i][j]=1e9;
			R[i][j]=0;
		}
	}

	for(int i=1;i<2*N;i++) {
		for(int j=0;j<2;j++) {
			for(int k=0;k<2;k++) {
				if(A[i-1][k]<=A[i][j]) {
					L[i][j]=min(L[i][j],L[i-1][k]+j);
					R[i][j]=max(R[i][j],R[i-1][k]+j);
				}
			}
		}
	}

	if(L[2*N-1][0]<=N && N<=R[2*N-1][0]) {
		string ans="";
		ans+='A';
		int cur=N, prv=A[2*N-1][0];
		for(int i=2*N-2;i>=0;i--) {
			if(L[i][0]<=cur && cur<=R[i][0] && A[i][0]<=prv) {
				ans+='A';
				prv=A[i][0];
			} else {
				cur-=1;
				ans+='B';
				prv=A[i][1];
			}
		}
		reverse(ans.begin(),ans.end());
		cout<<ans<<'\n';
	} else if(L[2*N-1][1]<=N && N<=R[2*N-1][1]) {
		string ans="";
		ans+='B';
		int cur=N-1, prv=A[2*N-1][1];
		for(int i=2*N-2;i>=0;i--) {
			if(L[i][0]<=cur && cur<=R[i][0] && A[i][0]<=prv) {
				ans+='A';
				prv=A[i][0];
			} else {
				cur-=1;
				ans+='B';
				prv=A[i][1];
			}
		}
		reverse(ans.begin(),ans.end());
		cout<<ans<<'\n';
	} else {
		cout<<-1<<'\n';
	}

}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4444 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 1 ms 4440 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 2 ms 4444 KB Output is correct
8 Correct 3 ms 4444 KB Output is correct
9 Correct 1 ms 4580 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 2 ms 4696 KB Output is correct
12 Correct 1 ms 4700 KB Output is correct
13 Correct 3 ms 4696 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 2 ms 4440 KB Output is correct
16 Correct 2 ms 4452 KB Output is correct
17 Correct 1 ms 4572 KB Output is correct
18 Correct 2 ms 4436 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 1 ms 4440 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 2 ms 4440 KB Output is correct
25 Correct 1 ms 4444 KB Output is correct
26 Correct 2 ms 4440 KB Output is correct
27 Correct 1 ms 4444 KB Output is correct
28 Correct 1 ms 4444 KB Output is correct
29 Correct 1 ms 4444 KB Output is correct
30 Correct 1 ms 4444 KB Output is correct
31 Correct 2 ms 4700 KB Output is correct
32 Correct 2 ms 4444 KB Output is correct
33 Correct 1 ms 4440 KB Output is correct

Subtask #2
89.0 / 89.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4444 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 1 ms 4440 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 2 ms 4444 KB Output is correct
8 Correct 3 ms 4444 KB Output is correct
9 Correct 1 ms 4580 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 2 ms 4696 KB Output is correct
12 Correct 1 ms 4700 KB Output is correct
13 Correct 3 ms 4696 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 2 ms 4440 KB Output is correct
16 Correct 2 ms 4452 KB Output is correct
17 Correct 1 ms 4572 KB Output is correct
18 Correct 2 ms 4436 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 1 ms 4440 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 2 ms 4440 KB Output is correct
25 Correct 1 ms 4444 KB Output is correct
26 Correct 2 ms 4440 KB Output is correct
27 Correct 1 ms 4444 KB Output is correct
28 Correct 1 ms 4444 KB Output is correct
29 Correct 1 ms 4444 KB Output is correct
30 Correct 1 ms 4444 KB Output is correct
31 Correct 2 ms 4700 KB Output is correct
32 Correct 2 ms 4444 KB Output is correct
33 Correct 1 ms 4440 KB Output is correct
34 Correct 162 ms 42944 KB Output is correct
35 Correct 166 ms 43060 KB Output is correct
36 Correct 156 ms 42764 KB Output is correct
37 Correct 168 ms 43404 KB Output is correct
38 Correct 150 ms 43276 KB Output is correct
39 Correct 149 ms 42368 KB Output is correct
40 Correct 175 ms 45096 KB Output is correct
41 Correct 151 ms 43136 KB Output is correct
42 Correct 173 ms 44292 KB Output is correct
43 Correct 192 ms 45388 KB Output is correct
44 Correct 188 ms 45368 KB Output is correct
45 Correct 192 ms 45240 KB Output is correct
46 Correct 180 ms 45356 KB Output is correct
47 Correct 209 ms 44364 KB Output is correct
48 Correct 196 ms 44080 KB Output is correct
49 Correct 188 ms 44972 KB Output is correct
50 Correct 208 ms 44364 KB Output is correct
51 Correct 185 ms 44600 KB Output is correct
52 Correct 146 ms 33608 KB Output is correct
53 Correct 136 ms 33456 KB Output is correct
54 Correct 122 ms 33608 KB Output is correct
55 Correct 126 ms 33188 KB Output is correct
56 Correct 178 ms 45388 KB Output is correct
57 Correct 147 ms 40420 KB Output is correct
58 Correct 139 ms 40580 KB Output is correct
59 Correct 189 ms 40640 KB Output is correct
60 Correct 147 ms 39516 KB Output is correct
61 Correct 174 ms 41036 KB Output is correct
62 Correct 166 ms 40708 KB Output is correct
63 Correct 157 ms 41032 KB Output is correct
64 Correct 142 ms 40164 KB Output is correct
65 Correct 144 ms 40896 KB Output is correct