#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define all(x) x.begin(), x.end()
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
const int N = 1000000 + 10;
const int MOD = 1000000007;
const int LOG = 20;
const int INF = 1000000010;
const int delta = 11353;
pii dp[N][2];
int n, A[N], B[N], ans[N];
pii merge(pii x, pii y){
return {min(x.F, y.F), max(x.S, y.S)};
}
int32_t main(){
ios::sync_with_stdio(0); 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];
for (int i = 1; i <= 2 * n; i++) dp[i][0] = dp[i][1] = {-INF, -INF};
dp[0][0] = {0, 0};
for (int i = 1; i <= 2 * n; i++){
// if (min(A[i - 1], B[i - 1]) > max(A[i], B[i])) return cout << -1, 0;
if (A[i] >= B[i - 1] && A[i] >= A[i - 1]) dp[i][0] = merge(dp[i - 1][0], dp[i - 1][1]);
else if(A[i] >= B[i - 1]) dp[i][0] = dp[i - 1][1];
else if(A[i] >= A[i - 1]) dp[i][0] = dp[i - 1][0];
//if (dp[i][0].F < 0) A[i] = INF;
dp[i][0].F++, dp[i][0].S ++;
if (dp[i][0].F < 0) A[i] = INF;
if (B[i] >= B[i - 1] && B[i] >= A[i - 1]) dp[i][1] = merge(dp[i - 1][0], dp[i - 1][1]);
else if(B[i] >= B[i - 1]) dp[i][1] = dp[i - 1][1];
else if (B[i] >= A[i - 1]) dp[i][1] = dp[i - 1][0];
if (dp[i][1].F < 0) B[i] = INF;
//cout << dp[i][0].F << ' ' << dp[i][0].S << ' ' << dp[i][1].F << ' ' << dp[i][1].S << '\n';
}
if ((dp[2 * n][0].F <= n && dp[2 * n][0].S >= n) || (dp[2 * n][1].F <= n && dp[2 * n][1].S >= n)){
pair<pii, int> Now;
if (dp[2 * n][0].F <= n && dp[2 * n][0].S >= n) Now = {{2 * n, 0}, n};
else Now = {{2 * n, 1}, n};
while (Now.F.F != 0){
int id = Now.F.F, u = Now.S;
if (Now.F.S == 0){
if (A[id - 1] <= A[id]){
if (dp[id - 1][0].F <= (u - 1) && dp[id - 1][0].S >= (u - 1)) Now = {{id - 1, 0}, u - 1};
}
if (Now.F.F == id){
Now = {{id - 1, 1}, u - 1};
}
ans[id] = 0;
}else{
if (A[id - 1] <= B[id]){
if (dp[id - 1][0].F <= u && dp[id - 1][0].S >= u) Now = {{id - 1, 0}, u};
}
if (Now.F.F == id){
Now = {{id - 1, 1}, u};
}
ans[id] = 1;
}
}
for (int i = 1; i <= 2 * n; i++) cout << (ans[i]?"B":"A");
}
else cout << -1;
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
384 KB |
Output is correct |
| 2 |
Correct |
0 ms |
384 KB |
Output is correct |
| 3 |
Correct |
1 ms |
384 KB |
Output is correct |
| 4 |
Correct |
1 ms |
384 KB |
Output is correct |
| 5 |
Correct |
2 ms |
384 KB |
Output is correct |
| 6 |
Correct |
2 ms |
512 KB |
Output is correct |
| 7 |
Correct |
2 ms |
512 KB |
Output is correct |
| 8 |
Correct |
2 ms |
512 KB |
Output is correct |
| 9 |
Correct |
2 ms |
512 KB |
Output is correct |
| 10 |
Correct |
2 ms |
512 KB |
Output is correct |
| 11 |
Correct |
2 ms |
512 KB |
Output is correct |
| 12 |
Correct |
2 ms |
504 KB |
Output is correct |
| 13 |
Correct |
2 ms |
512 KB |
Output is correct |
| 14 |
Correct |
2 ms |
512 KB |
Output is correct |
| 15 |
Correct |
2 ms |
512 KB |
Output is correct |
| 16 |
Correct |
2 ms |
512 KB |
Output is correct |
| 17 |
Correct |
2 ms |
512 KB |
Output is correct |
| 18 |
Correct |
2 ms |
512 KB |
Output is correct |
| 19 |
Correct |
2 ms |
512 KB |
Output is correct |
| 20 |
Correct |
2 ms |
512 KB |
Output is correct |
| 21 |
Correct |
1 ms |
512 KB |
Output is correct |
| 22 |
Correct |
2 ms |
512 KB |
Output is correct |
| 23 |
Correct |
1 ms |
512 KB |
Output is correct |
| 24 |
Correct |
2 ms |
512 KB |
Output is correct |
| 25 |
Correct |
2 ms |
512 KB |
Output is correct |
| 26 |
Correct |
2 ms |
512 KB |
Output is correct |
| 27 |
Correct |
2 ms |
512 KB |
Output is correct |
| 28 |
Correct |
2 ms |
512 KB |
Output is correct |
| 29 |
Correct |
2 ms |
512 KB |
Output is correct |
| 30 |
Correct |
2 ms |
512 KB |
Output is correct |
| 31 |
Correct |
2 ms |
512 KB |
Output is correct |
| 32 |
Correct |
1 ms |
512 KB |
Output is correct |
| 33 |
Correct |
2 ms |
512 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
384 KB |
Output is correct |
| 2 |
Correct |
0 ms |
384 KB |
Output is correct |
| 3 |
Correct |
1 ms |
384 KB |
Output is correct |
| 4 |
Correct |
1 ms |
384 KB |
Output is correct |
| 5 |
Correct |
2 ms |
384 KB |
Output is correct |
| 6 |
Correct |
2 ms |
512 KB |
Output is correct |
| 7 |
Correct |
2 ms |
512 KB |
Output is correct |
| 8 |
Correct |
2 ms |
512 KB |
Output is correct |
| 9 |
Correct |
2 ms |
512 KB |
Output is correct |
| 10 |
Correct |
2 ms |
512 KB |
Output is correct |
| 11 |
Correct |
2 ms |
512 KB |
Output is correct |
| 12 |
Correct |
2 ms |
504 KB |
Output is correct |
| 13 |
Correct |
2 ms |
512 KB |
Output is correct |
| 14 |
Correct |
2 ms |
512 KB |
Output is correct |
| 15 |
Correct |
2 ms |
512 KB |
Output is correct |
| 16 |
Correct |
2 ms |
512 KB |
Output is correct |
| 17 |
Correct |
2 ms |
512 KB |
Output is correct |
| 18 |
Correct |
2 ms |
512 KB |
Output is correct |
| 19 |
Correct |
2 ms |
512 KB |
Output is correct |
| 20 |
Correct |
2 ms |
512 KB |
Output is correct |
| 21 |
Correct |
1 ms |
512 KB |
Output is correct |
| 22 |
Correct |
2 ms |
512 KB |
Output is correct |
| 23 |
Correct |
1 ms |
512 KB |
Output is correct |
| 24 |
Correct |
2 ms |
512 KB |
Output is correct |
| 25 |
Correct |
2 ms |
512 KB |
Output is correct |
| 26 |
Correct |
2 ms |
512 KB |
Output is correct |
| 27 |
Correct |
2 ms |
512 KB |
Output is correct |
| 28 |
Correct |
2 ms |
512 KB |
Output is correct |
| 29 |
Correct |
2 ms |
512 KB |
Output is correct |
| 30 |
Correct |
2 ms |
512 KB |
Output is correct |
| 31 |
Correct |
2 ms |
512 KB |
Output is correct |
| 32 |
Correct |
1 ms |
512 KB |
Output is correct |
| 33 |
Correct |
2 ms |
512 KB |
Output is correct |
| 34 |
Correct |
318 ms |
23768 KB |
Output is correct |
| 35 |
Correct |
372 ms |
27056 KB |
Output is correct |
| 36 |
Correct |
348 ms |
26616 KB |
Output is correct |
| 37 |
Correct |
356 ms |
27256 KB |
Output is correct |
| 38 |
Correct |
344 ms |
27128 KB |
Output is correct |
| 39 |
Correct |
346 ms |
27384 KB |
Output is correct |
| 40 |
Correct |
373 ms |
28920 KB |
Output is correct |
| 41 |
Correct |
341 ms |
31352 KB |
Output is correct |
| 42 |
Correct |
397 ms |
31340 KB |
Output is correct |
| 43 |
Correct |
387 ms |
31812 KB |
Output is correct |
| 44 |
Correct |
380 ms |
29176 KB |
Output is correct |
| 45 |
Correct |
380 ms |
31736 KB |
Output is correct |
| 46 |
Correct |
370 ms |
31608 KB |
Output is correct |
| 47 |
Correct |
366 ms |
32764 KB |
Output is correct |
| 48 |
Correct |
371 ms |
32760 KB |
Output is correct |
| 49 |
Correct |
370 ms |
32764 KB |
Output is correct |
| 50 |
Correct |
379 ms |
32760 KB |
Output is correct |
| 51 |
Correct |
370 ms |
32760 KB |
Output is correct |
| 52 |
Correct |
269 ms |
36344 KB |
Output is correct |
| 53 |
Correct |
268 ms |
36344 KB |
Output is correct |
| 54 |
Correct |
246 ms |
36344 KB |
Output is correct |
| 55 |
Correct |
246 ms |
36088 KB |
Output is correct |
| 56 |
Correct |
372 ms |
32760 KB |
Output is correct |
| 57 |
Correct |
335 ms |
38520 KB |
Output is correct |
| 58 |
Correct |
341 ms |
38524 KB |
Output is correct |
| 59 |
Correct |
333 ms |
38136 KB |
Output is correct |
| 60 |
Correct |
334 ms |
36472 KB |
Output is correct |
| 61 |
Correct |
348 ms |
38180 KB |
Output is correct |
| 62 |
Correct |
350 ms |
38064 KB |
Output is correct |
| 63 |
Correct |
346 ms |
38132 KB |
Output is correct |
| 64 |
Correct |
337 ms |
34680 KB |
Output is correct |
| 65 |
Correct |
336 ms |
37240 KB |
Output is correct |
