oj.uz

답안 #919655

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
919655 2024-02-01T10:56:47 Z OAleksa 건물 4 (JOI20_building4) C++14
100 / 100
 197 ms 100428 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define f first
#define s second
const int N = 1e6 + 69;
const int inf = 1e9;
int n, a[N], b[N];
int mna1[N], mxa1[N], mna2[N], mxa2[N];
int mnb1[N], mxb1[N], mnb2[N], mxb2[N];
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int tt = 1;
  //cin >> tt;
  while (tt--) {
  	cin >> n;
  	n *= 2;
  	for (int i = 1;i <= n;i++)
  		cin >> a[i];
  	for (int i = 1;i <= n;i++)
  		cin >> b[i];
  	for (int i = 1;i <= n;i++) {
  		mna1[i] = mna2[i] = mnb1[i] = mnb2[i] = inf;
  		mxa1[i] = mxa2[i] = mxb1[i] = mxb2[i] = -inf;
  	}
  	mna1[1] = mxa1[1] = mnb2[1] = mxb2[1] = 1;
  	mna2[1] = mxa2[1] = mnb1[1] = mxb1[1] = 0;
  	for (int i = 2;i <= n;i++) {
  		if (a[i] >= a[i - 1]) {
  			mxa1[i] = max(mxa1[i], mxa1[i - 1] + 1);
  			mna1[i] = min(mna1[i], mna1[i - 1] + 1);
  			mxb1[i] = max(mxb1[i], mxb1[i - 1]);
  			mnb1[i] = min(mnb1[i], mnb1[i - 1]);
  		}
  		if (a[i] >= b[i - 1]) {
  			mxa1[i] = max(mxa1[i], mxa2[i - 1] + 1);
  			mna1[i] = min(mna1[i], mna2[i - 1] + 1);
  			mxb1[i] = max(mxb1[i], mxb2[i - 1]);
  			mnb1[i] = min(mnb1[i], mnb2[i - 1]);
  		}
  		if (b[i] >= a[i - 1]) {
  			mxa2[i] = max(mxa2[i], mxa1[i - 1]);
  			mna2[i] = min(mna2[i], mna1[i - 1]);
  			mxb2[i] = max(mxb2[i], mxb1[i - 1] + 1);
  			mnb2[i] = min(mnb2[i], mnb1[i - 1] + 1);
  		}
  		if (b[i] >= b[i - 1]) {
  			mxa2[i] = max(mxa2[i], mxa2[i - 1]);
  			mna2[i] = min(mna2[i], mna2[i - 1]);
  			mxb2[i] = max(mxb2[i], mxb2[i - 1] + 1);
  			mnb2[i] = min(mnb2[i], mnb2[i - 1] + 1);
  		}
  	}
  	if (((mna1[n] > n / 2 || mxa1[n] < n / 2) && (mnb1[n] > n / 2 || mxb1[n] < n / 2)) && ((mna2[n] > n / 2 || mxa2[n] < n / 2) && (mnb2[n] > n / 2 || mxb2[n] < n / 2)))
  		cout << "-1";
  	else {
  		string ans;
  		int x = n / 2, y = n / 2, lst = inf;
  		for (int i = n;i >= 1;i--) {
  			if (mna1[i] <= x && mxa1[i] >= x && a[i] <= lst) {
  				ans += 'A';
  				x--;
  				lst = a[i];
  			}
  			else if (mnb2[i] <= y && mxb2[i] >= y && b[i] <= lst) {
  				ans += 'B';
  				y--;
  				lst = b[i];
  			}
  		}
  		reverse(ans.begin(), ans.end());
  		cout << ans;
  	}
  }
  return 0;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
89.0 / 89.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 18776 KB Output is correct
2 Correct 5 ms 18780 KB Output is correct
3 Correct 3 ms 18776 KB Output is correct
4 Correct 3 ms 18776 KB Output is correct
5 Correct 4 ms 18776 KB Output is correct
6 Correct 4 ms 18780 KB Output is correct
7 Correct 4 ms 18776 KB Output is correct
8 Correct 3 ms 18780 KB Output is correct
9 Correct 3 ms 18776 KB Output is correct
10 Correct 4 ms 19032 KB Output is correct
11 Correct 4 ms 20828 KB Output is correct
12 Correct 4 ms 20824 KB Output is correct
13 Correct 4 ms 20824 KB Output is correct
14 Correct 4 ms 20824 KB Output is correct
15 Correct 4 ms 20828 KB Output is correct
16 Correct 4 ms 20824 KB Output is correct
17 Correct 5 ms 20824 KB Output is correct
18 Correct 4 ms 20828 KB Output is correct
19 Correct 4 ms 20824 KB Output is correct
20 Correct 4 ms 20824 KB Output is correct
21 Correct 4 ms 20824 KB Output is correct
22 Correct 3 ms 20824 KB Output is correct
23 Correct 4 ms 20824 KB Output is correct
24 Correct 4 ms 20824 KB Output is correct
25 Correct 4 ms 20828 KB Output is correct
26 Correct 4 ms 20828 KB Output is correct
27 Correct 4 ms 20824 KB Output is correct
28 Correct 3 ms 18776 KB Output is correct
29 Correct 3 ms 20828 KB Output is correct
30 Correct 3 ms 18780 KB Output is correct
31 Correct 3 ms 20824 KB Output is correct
32 Correct 3 ms 18776 KB Output is correct
33 Correct 4 ms 20828 KB Output is correct
34 Correct 176 ms 92624 KB Output is correct
35 Correct 171 ms 98468 KB Output is correct
36 Correct 174 ms 97980 KB Output is correct
37 Correct 185 ms 98492 KB Output is correct
38 Correct 167 ms 98596 KB Output is correct
39 Correct 163 ms 97576 KB Output is correct
40 Correct 177 ms 99656 KB Output is correct
41 Correct 168 ms 98316 KB Output is correct
42 Correct 193 ms 99228 KB Output is correct
43 Correct 195 ms 100168 KB Output is correct
44 Correct 191 ms 100152 KB Output is correct
45 Correct 188 ms 100168 KB Output is correct
46 Correct 190 ms 100176 KB Output is correct
47 Correct 186 ms 99096 KB Output is correct
48 Correct 182 ms 99036 KB Output is correct
49 Correct 193 ms 99912 KB Output is correct
50 Correct 189 ms 99300 KB Output is correct
51 Correct 197 ms 99144 KB Output is correct
52 Correct 140 ms 88372 KB Output is correct
53 Correct 132 ms 88392 KB Output is correct
54 Correct 126 ms 88392 KB Output is correct
55 Correct 123 ms 88136 KB Output is correct
56 Correct 178 ms 100428 KB Output is correct
57 Correct 150 ms 95296 KB Output is correct
58 Correct 163 ms 95420 KB Output is correct
59 Correct 158 ms 95304 KB Output is correct
60 Correct 154 ms 94476 KB Output is correct
61 Correct 160 ms 95828 KB Output is correct
62 Correct 162 ms 95336 KB Output is correct
63 Correct 167 ms 95928 KB Output is correct
64 Correct 157 ms 95140 KB Output is correct
65 Correct 155 ms 95676 KB Output is correct