oj.uz

답안 #212738

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
212738 2020-03-24T08:29:05 Z someone_aa 건물 4 (JOI20_building4) C++17
100 / 100
 1237 ms 45676 KB 
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
using namespace std;
const int maxn = 500100;
const int inf = 1e7;
int a[2*maxn], b[2*maxn];
int dpmax[2*maxn][2], dpmin[2*maxn][2];
int n;

int main() {
	cin>>n;
	for(int i=1;i<=2*n;i++) {
		cin>>a[i];
	}
	for(int i=1;i<=2*n;i++) {
		cin>>b[i];
	}

	dpmin[1][0] = dpmax[1][0] = 1;
	dpmin[1][1] = dpmax[1][1] = 0;

	for(int i=2;i<=2*n;i++) {
		dpmin[i][0] = inf;
		dpmax[i][0] = 0;
		if(a[i] >= a[i-1]) {
			dpmin[i][0] = min(dpmin[i-1][0] + 1, dpmin[i][0]);
			dpmax[i][0] = max(dpmax[i-1][0] + 1, dpmax[i][0]);
		}
		if(a[i] >= b[i-1]) {
			dpmin[i][0] = min(dpmin[i][0], dpmin[i-1][1] + 1);
			dpmax[i][0] = max(dpmax[i][0], dpmax[i-1][1] + 1);
		}

		dpmin[i][1] = inf;
		dpmax[i][1] = 0;
		if(b[i] >= b[i-1]) {
			dpmin[i][1] = min(dpmin[i-1][1], dpmin[i][1]);
			dpmax[i][1] = max(dpmax[i-1][1], dpmax[i][1]);
		}
		if(b[i] >= a[i-1]) {
			dpmin[i][1] = min(dpmin[i][1], dpmin[i-1][0]);
			dpmax[i][1] = max(dpmax[i][1], dpmax[i-1][0]);
		}
	}

	if(!(dpmin[2*n][0]<=n && dpmax[2*n][0]>=n) && !(dpmin[2*n][1]<=n && dpmax[2*n][1]>=n)) {
		cout<<"-1\n";
		return 0;
	}


	if(dpmin[2*n][0] <= n && dpmax[2*n][0]>=n) {
		// last is "A"
		string result = "A";
		int lft = n - 1;
		bool lst = false;
		for(int i=2*n-1;i>=1;i--) {

			// if we put B on this position, can we put lft A's behind me

			/*cout<<"At position: "<<i<<" there are "<<lft<<"\n";
			cout<<"With A: "<<dpmin[i][0]<<" and "<<dpmax[i][0]<<"\n";
			cout<<"With B: "<<dpmin[i][1]<<" and "<<dpmax[i][1]<<"\n"; */

			bool nlst;
			if(!lst) {
				if(b[i] <= a[i+1] && dpmin[i][1] <= lft && dpmax[i][1] >= lft) {
					result += 'B';
					nlst = true;
					//cout<<"Adding B\n";
				}
				else if(a[i] <= a[i+1] && dpmin[i][0] <= lft && dpmax[i][0] >= lft && lft >= 1) {
					result += 'A';
					nlst = false;
					lft--;
					//cout<<"Adding A\n";
				}
			}
			else {
				if(b[i] <= b[i+1] && dpmin[i][1] <= lft && dpmax[i][1] >= lft) {
					result += 'B';
					nlst = true;
					//cout<<"Adding B\n";
				}
				else if(a[i] <= b[i+1] && dpmin[i][0] <= lft && dpmax[i][0] >= lft && lft >= 1) {
					result += 'A';
					nlst = false;
					lft--;
					//cout<<"Adding A\n";
				}
			}
			lst = nlst;
		}

		reverse(result.begin(), result.end());
		cout<<result<<"\n";
	}
	else if(dpmin[2*n][1] <= n && dpmax[2*n][1]>=n) {
		// last is "A"
		string result = "B";
		int lft = n;
		bool lst = true;
		for(int i=2*n-1;i>=1;i--) {

			// if we put B on this position, can we put lft A's behind me

			/*cout<<"At position: "<<i<<" there are "<<lft<<"\n";
			cout<<"With A: "<<dpmin[i][0]<<" and "<<dpmax[i][0]<<"\n";
			cout<<"With B: "<<dpmin[i][1]<<" and "<<dpmax[i][1]<<"\n"; */

			bool nlst;
			if(!lst) {
				if(b[i] <= a[i+1] && dpmin[i][1] <= lft && dpmax[i][1] >= lft) {
					result += 'B';
					nlst = true;
					//cout<<"Adding B\n";
				}
				else if(a[i] <= a[i+1] && dpmin[i][0] <= lft && dpmax[i][0] >= lft && lft >= 1) {
					result += 'A';
					nlst = false;
					lft--;
					//cout<<"Adding A\n";
				}
			}
			else {
				if(b[i] <= b[i+1] && dpmin[i][1] <= lft && dpmax[i][1] >= lft) {
					result += 'B';
					nlst = true;
					//cout<<"Adding B\n";
				}
				else if(a[i] <= b[i+1] && dpmin[i][0] <= lft && dpmax[i][0] >= lft && lft >= 1) {
					result += 'A';
					nlst = false;
					lft--;
					//cout<<"Adding A\n";
				}
			}
			lst = nlst;
		}

		reverse(result.begin(), result.end());
		cout<<result<<"\n";
	}
}

Compilation message

building4.cpp: In function 'int main()':
building4.cpp:114:4: warning: 'nlst' may be used uninitialized in this function [-Wmaybe-uninitialized]
    if(!lst) {
    ^~
building4.cpp:68:4: warning: 'nlst' may be used uninitialized in this function [-Wmaybe-uninitialized]
    if(!lst) {
    ^~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 9 ms 512 KB Output is correct
6 Correct 9 ms 512 KB Output is correct
7 Correct 9 ms 512 KB Output is correct
8 Correct 10 ms 512 KB Output is correct
9 Correct 9 ms 512 KB Output is correct
10 Correct 9 ms 512 KB Output is correct
11 Correct 9 ms 512 KB Output is correct
12 Correct 10 ms 512 KB Output is correct
13 Correct 10 ms 512 KB Output is correct
14 Correct 9 ms 512 KB Output is correct
15 Correct 9 ms 384 KB Output is correct
16 Correct 9 ms 512 KB Output is correct
17 Correct 9 ms 512 KB Output is correct
18 Correct 10 ms 512 KB Output is correct
19 Correct 10 ms 512 KB Output is correct
20 Correct 7 ms 512 KB Output is correct
21 Correct 7 ms 512 KB Output is correct
22 Correct 7 ms 512 KB Output is correct
23 Correct 7 ms 640 KB Output is correct
24 Correct 10 ms 512 KB Output is correct
25 Correct 8 ms 512 KB Output is correct
26 Correct 7 ms 512 KB Output is correct
27 Correct 8 ms 512 KB Output is correct
28 Correct 7 ms 512 KB Output is correct
29 Correct 8 ms 512 KB Output is correct
30 Correct 7 ms 512 KB Output is correct
31 Correct 8 ms 512 KB Output is correct
32 Correct 7 ms 512 KB Output is correct
33 Correct 8 ms 512 KB Output is correct

Subtask #2
89.0 / 89.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 9 ms 512 KB Output is correct
6 Correct 9 ms 512 KB Output is correct
7 Correct 9 ms 512 KB Output is correct
8 Correct 10 ms 512 KB Output is correct
9 Correct 9 ms 512 KB Output is correct
10 Correct 9 ms 512 KB Output is correct
11 Correct 9 ms 512 KB Output is correct
12 Correct 10 ms 512 KB Output is correct
13 Correct 10 ms 512 KB Output is correct
14 Correct 9 ms 512 KB Output is correct
15 Correct 9 ms 384 KB Output is correct
16 Correct 9 ms 512 KB Output is correct
17 Correct 9 ms 512 KB Output is correct
18 Correct 10 ms 512 KB Output is correct
19 Correct 10 ms 512 KB Output is correct
20 Correct 7 ms 512 KB Output is correct
21 Correct 7 ms 512 KB Output is correct
22 Correct 7 ms 512 KB Output is correct
23 Correct 7 ms 640 KB Output is correct
24 Correct 10 ms 512 KB Output is correct
25 Correct 8 ms 512 KB Output is correct
26 Correct 7 ms 512 KB Output is correct
27 Correct 8 ms 512 KB Output is correct
28 Correct 7 ms 512 KB Output is correct
29 Correct 8 ms 512 KB Output is correct
30 Correct 7 ms 512 KB Output is correct
31 Correct 8 ms 512 KB Output is correct
32 Correct 7 ms 512 KB Output is correct
33 Correct 8 ms 512 KB Output is correct
34 Correct 1194 ms 42880 KB Output is correct
35 Correct 1144 ms 42160 KB Output is correct
36 Correct 1116 ms 41392 KB Output is correct
37 Correct 1153 ms 42288 KB Output is correct
38 Correct 1133 ms 42416 KB Output is correct
39 Correct 1081 ms 41392 KB Output is correct
40 Correct 1195 ms 45036 KB Output is correct
41 Correct 1113 ms 42520 KB Output is correct
42 Correct 1160 ms 43820 KB Output is correct
43 Correct 1235 ms 45488 KB Output is correct
44 Correct 1214 ms 45344 KB Output is correct
45 Correct 1237 ms 45544 KB Output is correct
46 Correct 1208 ms 45460 KB Output is correct
47 Correct 1161 ms 44640 KB Output is correct
48 Correct 1168 ms 44268 KB Output is correct
49 Correct 1195 ms 45156 KB Output is correct
50 Correct 1197 ms 44776 KB Output is correct
51 Correct 1190 ms 44640 KB Output is correct
52 Correct 656 ms 33772 KB Output is correct
53 Correct 661 ms 33900 KB Output is correct
54 Correct 650 ms 33588 KB Output is correct
55 Correct 652 ms 33260 KB Output is correct
56 Correct 1218 ms 45676 KB Output is correct
57 Correct 976 ms 40296 KB Output is correct
58 Correct 983 ms 40688 KB Output is correct
59 Correct 977 ms 40684 KB Output is correct
60 Correct 947 ms 38572 KB Output is correct
61 Correct 991 ms 41068 KB Output is correct
62 Correct 995 ms 40424 KB Output is correct
63 Correct 1004 ms 41068 KB Output is correct
64 Correct 979 ms 39852 KB Output is correct
65 Correct 1027 ms 41064 KB Output is correct