Submission #212292

# Submission time Handle Problem Language Result Execution time Memory
212292 2020-03-22T16:40:42 Z dennisstar Building 4 (JOI20_building4) C++17
100 / 100
336 ms 25964 KB
#include <bits/stdc++.h>
#define pb push_back
using namespace std;

const int INF = 1<<20;

int main() {
	cin.tie(0)->sync_with_stdio(0);
	int N; cin>>N; N*=2;
	string S;
	vector<int> A(N), B(N), mxa(N), mna(N), mxb(N), mnb(N);
	for (auto &i:A) cin>>i;
	for (auto &i:B) cin>>i;
	mxa[0]=mna[0]=1, mxb[0]=mnb[0]=0;
	for (int i=1; i<N; i++) {
		mxa[i]=mxb[i]=-INF;
		mna[i]=mnb[i]=INF;
		if (A[i-1]<=A[i]) mxa[i]=max(mxa[i], mxa[i-1]+1), mna[i]=min(mna[i], mna[i-1]+1);
		if (A[i-1]<=B[i]) mxb[i]=max(mxb[i], mxa[i-1]+0), mnb[i]=min(mnb[i], mna[i-1]+0);
		if (B[i-1]<=A[i]) mxa[i]=max(mxa[i], mxb[i-1]+1), mna[i]=min(mna[i], mnb[i-1]+1);
		if (B[i-1]<=B[i]) mxb[i]=max(mxb[i], mxb[i-1]+0), mnb[i]=min(mnb[i], mnb[i-1]+0);
	}

	int c;
	if (mna[N-1]<=N/2&&N/2<=mxa[N-1]) S.pb('A'), c=1;
	else if (mnb[N-1]<=N/2&&N/2<=mxb[N-1]) S.pb('B'), c=0;
	else { cout<<"-1\n"; return 0; }

	for (int i=N-2; i>=0; i--) {
		int x=N/2-c;
		if (S.back()=='A') {
			if (A[i]<=A[i+1]&&mna[i]<=x&&x<=mxa[i]) S.pb('A'), c++;
			else S.pb('B');
		}
		else {
			if (A[i]<=B[i+1]&&mna[i]<=x&&x<=mxa[i]) S.pb('A'), c++;
			else S.pb('B');
		}
	}
	reverse(S.begin(), S.end());
	cout<<S<<'\n';
	return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 6 ms 384 KB Output is correct
6 Correct 6 ms 384 KB Output is correct
7 Correct 7 ms 384 KB Output is correct
8 Correct 6 ms 384 KB Output is correct
9 Correct 6 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 6 ms 384 KB Output is correct
12 Correct 6 ms 512 KB Output is correct
13 Correct 6 ms 384 KB Output is correct
14 Correct 7 ms 384 KB Output is correct
15 Correct 6 ms 384 KB Output is correct
16 Correct 6 ms 512 KB Output is correct
17 Correct 6 ms 384 KB Output is correct
18 Correct 6 ms 512 KB Output is correct
19 Correct 6 ms 512 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 6 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 6 ms 384 KB Output is correct
25 Correct 6 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 5 ms 384 KB Output is correct
29 Correct 5 ms 384 KB Output is correct
30 Correct 5 ms 512 KB Output is correct
31 Correct 6 ms 384 KB Output is correct
32 Correct 5 ms 384 KB Output is correct
33 Correct 5 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 6 ms 384 KB Output is correct
6 Correct 6 ms 384 KB Output is correct
7 Correct 7 ms 384 KB Output is correct
8 Correct 6 ms 384 KB Output is correct
9 Correct 6 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 6 ms 384 KB Output is correct
12 Correct 6 ms 512 KB Output is correct
13 Correct 6 ms 384 KB Output is correct
14 Correct 7 ms 384 KB Output is correct
15 Correct 6 ms 384 KB Output is correct
16 Correct 6 ms 512 KB Output is correct
17 Correct 6 ms 384 KB Output is correct
18 Correct 6 ms 512 KB Output is correct
19 Correct 6 ms 512 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 6 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 6 ms 384 KB Output is correct
25 Correct 6 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 5 ms 384 KB Output is correct
29 Correct 5 ms 384 KB Output is correct
30 Correct 5 ms 512 KB Output is correct
31 Correct 6 ms 384 KB Output is correct
32 Correct 5 ms 384 KB Output is correct
33 Correct 5 ms 384 KB Output is correct
34 Correct 315 ms 23544 KB Output is correct
35 Correct 312 ms 24240 KB Output is correct
36 Correct 278 ms 23728 KB Output is correct
37 Correct 286 ms 24240 KB Output is correct
38 Correct 299 ms 24240 KB Output is correct
39 Correct 283 ms 24368 KB Output is correct
40 Correct 314 ms 25916 KB Output is correct
41 Correct 305 ms 24752 KB Output is correct
42 Correct 316 ms 25136 KB Output is correct
43 Correct 329 ms 25964 KB Output is correct
44 Correct 326 ms 25964 KB Output is correct
45 Correct 319 ms 25964 KB Output is correct
46 Correct 325 ms 25964 KB Output is correct
47 Correct 304 ms 25964 KB Output is correct
48 Correct 321 ms 25964 KB Output is correct
49 Correct 316 ms 25964 KB Output is correct
50 Correct 307 ms 25964 KB Output is correct
51 Correct 320 ms 25964 KB Output is correct
52 Correct 205 ms 25964 KB Output is correct
53 Correct 206 ms 25964 KB Output is correct
54 Correct 188 ms 25964 KB Output is correct
55 Correct 223 ms 25964 KB Output is correct
56 Correct 336 ms 25964 KB Output is correct
57 Correct 293 ms 25836 KB Output is correct
58 Correct 300 ms 25940 KB Output is correct
59 Correct 288 ms 25964 KB Output is correct
60 Correct 312 ms 24452 KB Output is correct
61 Correct 281 ms 25964 KB Output is correct
62 Correct 278 ms 25580 KB Output is correct
63 Correct 288 ms 25964 KB Output is correct
64 Correct 288 ms 25136 KB Output is correct
65 Correct 317 ms 25964 KB Output is correct