#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e6 + 10;
const int inf = 1e9 + 1;
int a[maxn], b[maxn];
pair<int,int> A[maxn], B[maxn];
int seg[4*maxn], lazy[4*maxn];
vector<pair<int,pair<int,int>>> vec;
pair<int,int> get(int id, int L, int R, int x){
pair<int,int> ret = {-1,-1};
for (auto it : vec){
if (it.first > x)
continue;
if (ret == make_pair(-1,-1))
ret = it.second;
else{
ret.first = min(ret.first, it.second.first);
ret.second = max(ret.second, it.second.second);
}
}
return ret;
}
void change(int id, int L, int R, int l, int r, int val){
if (val == inf){
vec.clear();
return;
}
vec.push_back({val,{l,r}});
}
int main(){
ios_base::sync_with_stdio(false);
int n;
cin >> n;
for (int i = 0; i < 2*n; i++)
cin >> a[i];
for (int i = 0; i < 2*n; i++)
cin >> b[i];
for (int i = 1; i < 2*n; i++)
if (max(a[i],b[i]) < min(a[i-1],b[i-1]))
return cout << -1 << endl, 0;
change(1, 0, 2*n+1, 0, 1, 0);
for (int i = 0; i < 2*n; i++){
auto ita = get(1, 0, 2*n+1, a[i]);
auto itb = get(1, 0, 2*n+1, b[i]);
A[i] = ita, B[i] = itb;
if (ita == make_pair(-1,-1) and itb == make_pair(-1,-1))
return cout << -1 << endl, 0;
if (a[i] < b[i]){
if (ita == make_pair(-1,-1)){
change(1, 0, 2*n+1, 0, 2*n+1, inf);
change(1, 0, 2*n+1, itb.first+1, itb.second+1, b[i]);
continue;
}
change(1, 0, 2*n+1, 0, 2*n+1, inf);
change(1, 0, 2*n+1, itb.first+1, itb.second+1, b[i]);
change(1, 0, 2*n+1, ita.first, ita.second, a[i]);
}
else{
if (itb == make_pair(-1,-1)){
change(1, 0, 2*n+1, 0, 2*n+1, inf);
change(1, 0, 2*n+1, ita.first, ita.second, a[i]);
continue;
}
change(1, 0, 2*n+1, 0, 2*n+1, inf);
change(1, 0, 2*n+1, ita.first, ita.second, a[i]);
change(1, 0, 2*n+1, itb.first+1, itb.second+1, b[i]);
}
}
auto it = get(1, 0, 2*n+1, inf-1);
if (it.first == -1 or it.first > n or it.second <= n)
return cout << -1 << endl, 0;
int now = n;
string s;
int last = inf;
for (int i = 2*n-1; i >= 0; i--){
if (b[i] <= last and (A[i].first == -1 or A[i].first > now or A[i].second <= now or a[i] > last)){
s += 'B';
now --;
last = b[i];
continue;
}
s += 'A';
last = a[i];
}
reverse(s.begin(),s.end());
cout << s << endl;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
384 KB |
Output is correct |
| 2 |
Correct |
0 ms |
384 KB |
Output is correct |
| 3 |
Correct |
0 ms |
384 KB |
Output is correct |
| 4 |
Correct |
0 ms |
384 KB |
Output is correct |
| 5 |
Correct |
1 ms |
384 KB |
Output is correct |
| 6 |
Correct |
2 ms |
512 KB |
Output is correct |
| 7 |
Correct |
1 ms |
384 KB |
Output is correct |
| 8 |
Correct |
2 ms |
512 KB |
Output is correct |
| 9 |
Correct |
2 ms |
512 KB |
Output is correct |
| 10 |
Correct |
1 ms |
512 KB |
Output is correct |
| 11 |
Correct |
2 ms |
512 KB |
Output is correct |
| 12 |
Correct |
2 ms |
512 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 |
3 ms |
512 KB |
Output is correct |
| 20 |
Correct |
1 ms |
512 KB |
Output is correct |
| 21 |
Correct |
2 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 |
3 ms |
512 KB |
Output is correct |
| 25 |
Correct |
1 ms |
512 KB |
Output is correct |
| 26 |
Correct |
2 ms |
512 KB |
Output is correct |
| 27 |
Correct |
1 ms |
512 KB |
Output is correct |
| 28 |
Correct |
1 ms |
512 KB |
Output is correct |
| 29 |
Correct |
1 ms |
512 KB |
Output is correct |
| 30 |
Correct |
1 ms |
512 KB |
Output is correct |
| 31 |
Correct |
1 ms |
512 KB |
Output is correct |
| 32 |
Correct |
1 ms |
512 KB |
Output is correct |
| 33 |
Correct |
1 ms |
512 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
384 KB |
Output is correct |
| 2 |
Correct |
0 ms |
384 KB |
Output is correct |
| 3 |
Correct |
0 ms |
384 KB |
Output is correct |
| 4 |
Correct |
0 ms |
384 KB |
Output is correct |
| 5 |
Correct |
1 ms |
384 KB |
Output is correct |
| 6 |
Correct |
2 ms |
512 KB |
Output is correct |
| 7 |
Correct |
1 ms |
384 KB |
Output is correct |
| 8 |
Correct |
2 ms |
512 KB |
Output is correct |
| 9 |
Correct |
2 ms |
512 KB |
Output is correct |
| 10 |
Correct |
1 ms |
512 KB |
Output is correct |
| 11 |
Correct |
2 ms |
512 KB |
Output is correct |
| 12 |
Correct |
2 ms |
512 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 |
3 ms |
512 KB |
Output is correct |
| 20 |
Correct |
1 ms |
512 KB |
Output is correct |
| 21 |
Correct |
2 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 |
3 ms |
512 KB |
Output is correct |
| 25 |
Correct |
1 ms |
512 KB |
Output is correct |
| 26 |
Correct |
2 ms |
512 KB |
Output is correct |
| 27 |
Correct |
1 ms |
512 KB |
Output is correct |
| 28 |
Correct |
1 ms |
512 KB |
Output is correct |
| 29 |
Correct |
1 ms |
512 KB |
Output is correct |
| 30 |
Correct |
1 ms |
512 KB |
Output is correct |
| 31 |
Correct |
1 ms |
512 KB |
Output is correct |
| 32 |
Correct |
1 ms |
512 KB |
Output is correct |
| 33 |
Correct |
1 ms |
512 KB |
Output is correct |
| 34 |
Correct |
296 ms |
8156 KB |
Output is correct |
| 35 |
Correct |
317 ms |
24264 KB |
Output is correct |
| 36 |
Correct |
323 ms |
23748 KB |
Output is correct |
| 37 |
Correct |
321 ms |
24256 KB |
Output is correct |
| 38 |
Correct |
320 ms |
24240 KB |
Output is correct |
| 39 |
Correct |
314 ms |
24496 KB |
Output is correct |
| 40 |
Correct |
337 ms |
25964 KB |
Output is correct |
| 41 |
Correct |
323 ms |
24880 KB |
Output is correct |
| 42 |
Correct |
331 ms |
25284 KB |
Output is correct |
| 43 |
Correct |
365 ms |
26224 KB |
Output is correct |
| 44 |
Correct |
354 ms |
26092 KB |
Output is correct |
| 45 |
Correct |
348 ms |
26092 KB |
Output is correct |
| 46 |
Correct |
344 ms |
26092 KB |
Output is correct |
| 47 |
Correct |
343 ms |
26188 KB |
Output is correct |
| 48 |
Correct |
330 ms |
26092 KB |
Output is correct |
| 49 |
Correct |
336 ms |
26092 KB |
Output is correct |
| 50 |
Correct |
345 ms |
26092 KB |
Output is correct |
| 51 |
Correct |
341 ms |
26080 KB |
Output is correct |
| 52 |
Correct |
223 ms |
28652 KB |
Output is correct |
| 53 |
Correct |
255 ms |
28656 KB |
Output is correct |
| 54 |
Correct |
217 ms |
28652 KB |
Output is correct |
| 55 |
Correct |
211 ms |
28652 KB |
Output is correct |
| 56 |
Correct |
339 ms |
26092 KB |
Output is correct |
| 57 |
Correct |
295 ms |
27372 KB |
Output is correct |
| 58 |
Correct |
320 ms |
27628 KB |
Output is correct |
| 59 |
Correct |
350 ms |
27500 KB |
Output is correct |
| 60 |
Correct |
284 ms |
26032 KB |
Output is correct |
| 61 |
Correct |
307 ms |
27628 KB |
Output is correct |
| 62 |
Correct |
296 ms |
27116 KB |
Output is correct |
| 63 |
Correct |
297 ms |
27500 KB |
Output is correct |
| 64 |
Correct |
364 ms |
26728 KB |
Output is correct |
| 65 |
Correct |
301 ms |
27500 KB |
Output is correct |
