#include <bits/stdc++.h>
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
*/
using namespace std;
// using namespace __gnu_pbds;
using namespace chrono;
// mt19937 rng((int) std::chrono::steady_clock::now().time_since_epoch().count());
/*
template <class T> using ordered_set = tree <T, null_type, less <T>, rb_tree_tag, tree_order_statistics_node_update>;
*/
//***************** CONSTANTS *****************
const int MXN = 500'000;
//***************** GLOBAL VARIABLES *****************
int A[2][2*MXN + 1], l[2][2*MXN + 1], r[2][2*MXN + 1];
//***************** AUXILIARY STRUCTS *****************
inline int readInt() {
int x = 0;
char ch = getchar_unlocked();
while (ch < '0' || ch > '9') ch = getchar_unlocked();
while (ch >= '0' && ch <= '9'){
x = (x << 3) + (x << 1) + ch - '0';
ch = getchar_unlocked();
}
return x;
}
//***************** MAIN BODY *****************
void solve(){
int N = readInt();
for(int j = 1; j >= 0; --j){
for(int i = 1; i <= 2*N; i++) A[j][i] = readInt();
}
for(int i = 1; i <= 2*N; i++){
for(int j = 0; j < 2; j++){
l[j][i] = 2*N + 1, r[j][i] = -1;
for(int k = 0; k < 2; k++)
if(A[j][i] >= A[k][i-1]){
l[j][i] = min(l[j][i], l[k][i-1] + j);
r[j][i] = max(r[j][i], r[k][i-1] + j);
}
}
}
int j = -1;
for(int k = 0; k < 2; k++)
if(l[k][2*N] <= N && r[k][2*N] >= N){
j = k;
}
if(j < 0){
cout << "-1\n";
return;
}
string ans(2*N, ' ');
int cnt = N;
for(int i = 2*N; i >= 1; --i){
ans[i - 1] = 'B' - j;
cnt -= j;
j = (A[j][i] >= A[1][i-1] && l[1][i-1] <= cnt && r[1][i-1] >= cnt);
}
cout << ans << '\n';
}
//***************** *****************
int32_t main(){
// ios_base::sync_with_stdio(NULL);
// cin.tie(NULL);
#ifdef LOCAL
auto begin = high_resolution_clock::now();
#endif
int tc = 1;
// cin >> tc;
for (int t = 0; t < tc; t++)
solve();
#ifdef LOCAL
auto end = high_resolution_clock::now();
cout << fixed << setprecision(4);
cout << "Execution Time: " << duration_cast<duration<double>>(end - begin).count() << "seconds" << endl;
#endif
return 0;
}
/*
If code gives a WA, check for the following :
1. I/O format
2. Are you clearing all global variables in between tests if multitests are a thing
3. Can you definitively prove the logic
4. If the code gives an inexplicable TLE, and you are sure you have the best possible complexity,
use faster io
*/
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
332 KB |
Output is correct |
| 2 |
Correct |
1 ms |
332 KB |
Output is correct |
| 3 |
Correct |
0 ms |
332 KB |
Output is correct |
| 4 |
Correct |
0 ms |
332 KB |
Output is correct |
| 5 |
Correct |
1 ms |
332 KB |
Output is correct |
| 6 |
Correct |
1 ms |
332 KB |
Output is correct |
| 7 |
Correct |
1 ms |
332 KB |
Output is correct |
| 8 |
Correct |
1 ms |
332 KB |
Output is correct |
| 9 |
Correct |
1 ms |
332 KB |
Output is correct |
| 10 |
Correct |
1 ms |
332 KB |
Output is correct |
| 11 |
Correct |
1 ms |
332 KB |
Output is correct |
| 12 |
Correct |
1 ms |
332 KB |
Output is correct |
| 13 |
Correct |
1 ms |
332 KB |
Output is correct |
| 14 |
Correct |
1 ms |
332 KB |
Output is correct |
| 15 |
Correct |
1 ms |
332 KB |
Output is correct |
| 16 |
Correct |
1 ms |
332 KB |
Output is correct |
| 17 |
Correct |
1 ms |
332 KB |
Output is correct |
| 18 |
Correct |
1 ms |
332 KB |
Output is correct |
| 19 |
Correct |
1 ms |
332 KB |
Output is correct |
| 20 |
Correct |
1 ms |
332 KB |
Output is correct |
| 21 |
Correct |
1 ms |
332 KB |
Output is correct |
| 22 |
Correct |
1 ms |
332 KB |
Output is correct |
| 23 |
Correct |
1 ms |
332 KB |
Output is correct |
| 24 |
Correct |
1 ms |
332 KB |
Output is correct |
| 25 |
Correct |
1 ms |
332 KB |
Output is correct |
| 26 |
Correct |
1 ms |
332 KB |
Output is correct |
| 27 |
Correct |
1 ms |
332 KB |
Output is correct |
| 28 |
Correct |
1 ms |
332 KB |
Output is correct |
| 29 |
Correct |
1 ms |
332 KB |
Output is correct |
| 30 |
Correct |
1 ms |
332 KB |
Output is correct |
| 31 |
Correct |
1 ms |
332 KB |
Output is correct |
| 32 |
Correct |
1 ms |
332 KB |
Output is correct |
| 33 |
Correct |
1 ms |
332 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
332 KB |
Output is correct |
| 2 |
Correct |
1 ms |
332 KB |
Output is correct |
| 3 |
Correct |
0 ms |
332 KB |
Output is correct |
| 4 |
Correct |
0 ms |
332 KB |
Output is correct |
| 5 |
Correct |
1 ms |
332 KB |
Output is correct |
| 6 |
Correct |
1 ms |
332 KB |
Output is correct |
| 7 |
Correct |
1 ms |
332 KB |
Output is correct |
| 8 |
Correct |
1 ms |
332 KB |
Output is correct |
| 9 |
Correct |
1 ms |
332 KB |
Output is correct |
| 10 |
Correct |
1 ms |
332 KB |
Output is correct |
| 11 |
Correct |
1 ms |
332 KB |
Output is correct |
| 12 |
Correct |
1 ms |
332 KB |
Output is correct |
| 13 |
Correct |
1 ms |
332 KB |
Output is correct |
| 14 |
Correct |
1 ms |
332 KB |
Output is correct |
| 15 |
Correct |
1 ms |
332 KB |
Output is correct |
| 16 |
Correct |
1 ms |
332 KB |
Output is correct |
| 17 |
Correct |
1 ms |
332 KB |
Output is correct |
| 18 |
Correct |
1 ms |
332 KB |
Output is correct |
| 19 |
Correct |
1 ms |
332 KB |
Output is correct |
| 20 |
Correct |
1 ms |
332 KB |
Output is correct |
| 21 |
Correct |
1 ms |
332 KB |
Output is correct |
| 22 |
Correct |
1 ms |
332 KB |
Output is correct |
| 23 |
Correct |
1 ms |
332 KB |
Output is correct |
| 24 |
Correct |
1 ms |
332 KB |
Output is correct |
| 25 |
Correct |
1 ms |
332 KB |
Output is correct |
| 26 |
Correct |
1 ms |
332 KB |
Output is correct |
| 27 |
Correct |
1 ms |
332 KB |
Output is correct |
| 28 |
Correct |
1 ms |
332 KB |
Output is correct |
| 29 |
Correct |
1 ms |
332 KB |
Output is correct |
| 30 |
Correct |
1 ms |
332 KB |
Output is correct |
| 31 |
Correct |
1 ms |
332 KB |
Output is correct |
| 32 |
Correct |
1 ms |
332 KB |
Output is correct |
| 33 |
Correct |
1 ms |
332 KB |
Output is correct |
| 34 |
Correct |
89 ms |
23344 KB |
Output is correct |
| 35 |
Correct |
92 ms |
23816 KB |
Output is correct |
| 36 |
Correct |
93 ms |
23492 KB |
Output is correct |
| 37 |
Correct |
97 ms |
23996 KB |
Output is correct |
| 38 |
Correct |
81 ms |
23952 KB |
Output is correct |
| 39 |
Correct |
82 ms |
24132 KB |
Output is correct |
| 40 |
Correct |
85 ms |
25540 KB |
Output is correct |
| 41 |
Correct |
76 ms |
24404 KB |
Output is correct |
| 42 |
Correct |
92 ms |
24912 KB |
Output is correct |
| 43 |
Correct |
99 ms |
25668 KB |
Output is correct |
| 44 |
Correct |
100 ms |
25736 KB |
Output is correct |
| 45 |
Correct |
102 ms |
25648 KB |
Output is correct |
| 46 |
Correct |
89 ms |
25704 KB |
Output is correct |
| 47 |
Correct |
87 ms |
25632 KB |
Output is correct |
| 48 |
Correct |
84 ms |
25732 KB |
Output is correct |
| 49 |
Correct |
86 ms |
25648 KB |
Output is correct |
| 50 |
Correct |
97 ms |
25668 KB |
Output is correct |
| 51 |
Correct |
96 ms |
25644 KB |
Output is correct |
| 52 |
Correct |
59 ms |
25692 KB |
Output is correct |
| 53 |
Correct |
58 ms |
25640 KB |
Output is correct |
| 54 |
Correct |
46 ms |
25672 KB |
Output is correct |
| 55 |
Correct |
53 ms |
25696 KB |
Output is correct |
| 56 |
Correct |
86 ms |
25656 KB |
Output is correct |
| 57 |
Correct |
69 ms |
25524 KB |
Output is correct |
| 58 |
Correct |
69 ms |
25796 KB |
Output is correct |
| 59 |
Correct |
68 ms |
25688 KB |
Output is correct |
| 60 |
Correct |
67 ms |
24200 KB |
Output is correct |
| 61 |
Correct |
71 ms |
25744 KB |
Output is correct |
| 62 |
Correct |
76 ms |
25384 KB |
Output is correct |
| 63 |
Correct |
70 ms |
25720 KB |
Output is correct |
| 64 |
Correct |
68 ms |
24788 KB |
Output is correct |
| 65 |
Correct |
71 ms |
25668 KB |
Output is correct |
