#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vb = vector<bool>;
using vvb = vector<vb>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vc = vector<char>;
using vvc = vector<vc>;
using vs = vector<string>;
const ll mod = 1e9 + 7,inf = 1e18;
#define pb push_back
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
void setIO()
{
fast;
}
int main()
{
setIO();
int n;
cin>>n;
int m = 2 * n;
vi a(m + 1),b(m + 1);
for (int i = 1;i<=m;i++)cin>>a[i];for (int i = 1;i<=m;i++)cin>>b[i];
vvi l(m + 1,vi(2,1e9)),h(m + 1,vi(2,-1e9));
l[0][0] = l[0][1] = h[0][0] = h[0][1] = 0;
for (int i = 1;i<=m;i++){
if (a[i] >= a[i - 1])
l[i][0] = min(l[i][0],l[i - 1][0] + 1),
h[i][0] = max(h[i][0],h[i - 1][0] + 1);
if (a[i] >= b[i - 1])
l[i][0] = min(l[i][0],l[i - 1][1] + 1),
h[i][0] = max(h[i][0],h[i - 1][1] + 1);
if (b[i] >= a[i - 1])
l[i][1] = min(l[i][1],l[i - 1][0]),
h[i][1] = max(h[i][1],h[i - 1][0]);
if (b[i] >= b[i - 1])
l[i][1] = min(l[i][1],l[i - 1][1]),
h[i][1] = max(h[i][1],h[i - 1][1]);
}
int i = m;
if (l[i][0] <= n && n <= h[i][0]){
vi out;
int choice = 0;
int numReq = n;
while (i >= 1){
out.pb(choice);
if (choice == 0)numReq--;
bool is = (choice == 0 ? a[i] >= a[i - 1] : b[i] >= a[i - 1]);
if (l[i - 1][0] <= numReq && numReq <= h[i - 1][0] && is)
choice = 0;
else
choice = 1;
i--;
}
reverse(out.begin(),out.end());
for(auto it:out)cout<<(it ? "B" : "A");
}
else if (l[i][1] <= n && n <= h[i][1]){
vi out;
//out.pb(1);
int choice = 1;
int numReq = n;
while (i >= 1){
out.pb(choice);
if (choice == 0)numReq--;
bool is = (choice == 0 ? a[i] >= a[i - 1] : b[i] >= a[i - 1]);
if (l[i - 1][0] <= numReq && numReq <= h[i - 1][0] && is)
choice = 0;
else
choice = 1;
i--;
}
reverse(out.begin(),out.end());
for (auto it:out)cout<<(it == 0 ? "A" : "B");
}
else{
cout<<-1;
}
return 0;
}
Compilation message
building4.cpp: In function 'int main()':
building4.cpp:27:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
27 | for (int i = 1;i<=m;i++)cin>>a[i];for (int i = 1;i<=m;i++)cin>>b[i];
| ^~~
building4.cpp:27:39: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
27 | for (int i = 1;i<=m;i++)cin>>a[i];for (int i = 1;i<=m;i++)cin>>b[i];
| ^~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Output is correct |
| 2 |
Correct |
0 ms |
204 KB |
Output is correct |
| 3 |
Correct |
0 ms |
204 KB |
Output is correct |
| 4 |
Correct |
1 ms |
204 KB |
Output is correct |
| 5 |
Correct |
2 ms |
716 KB |
Output is correct |
| 6 |
Correct |
2 ms |
716 KB |
Output is correct |
| 7 |
Correct |
2 ms |
716 KB |
Output is correct |
| 8 |
Correct |
2 ms |
708 KB |
Output is correct |
| 9 |
Correct |
2 ms |
716 KB |
Output is correct |
| 10 |
Correct |
2 ms |
716 KB |
Output is correct |
| 11 |
Correct |
2 ms |
832 KB |
Output is correct |
| 12 |
Correct |
3 ms |
836 KB |
Output is correct |
| 13 |
Correct |
2 ms |
844 KB |
Output is correct |
| 14 |
Correct |
2 ms |
844 KB |
Output is correct |
| 15 |
Correct |
2 ms |
836 KB |
Output is correct |
| 16 |
Correct |
2 ms |
844 KB |
Output is correct |
| 17 |
Correct |
3 ms |
844 KB |
Output is correct |
| 18 |
Correct |
2 ms |
844 KB |
Output is correct |
| 19 |
Correct |
3 ms |
844 KB |
Output is correct |
| 20 |
Correct |
2 ms |
844 KB |
Output is correct |
| 21 |
Correct |
2 ms |
844 KB |
Output is correct |
| 22 |
Correct |
2 ms |
828 KB |
Output is correct |
| 23 |
Correct |
2 ms |
844 KB |
Output is correct |
| 24 |
Correct |
2 ms |
844 KB |
Output is correct |
| 25 |
Correct |
2 ms |
844 KB |
Output is correct |
| 26 |
Correct |
2 ms |
844 KB |
Output is correct |
| 27 |
Correct |
2 ms |
844 KB |
Output is correct |
| 28 |
Correct |
2 ms |
716 KB |
Output is correct |
| 29 |
Correct |
2 ms |
844 KB |
Output is correct |
| 30 |
Correct |
2 ms |
716 KB |
Output is correct |
| 31 |
Correct |
2 ms |
844 KB |
Output is correct |
| 32 |
Correct |
2 ms |
716 KB |
Output is correct |
| 33 |
Correct |
2 ms |
844 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Output is correct |
| 2 |
Correct |
0 ms |
204 KB |
Output is correct |
| 3 |
Correct |
0 ms |
204 KB |
Output is correct |
| 4 |
Correct |
1 ms |
204 KB |
Output is correct |
| 5 |
Correct |
2 ms |
716 KB |
Output is correct |
| 6 |
Correct |
2 ms |
716 KB |
Output is correct |
| 7 |
Correct |
2 ms |
716 KB |
Output is correct |
| 8 |
Correct |
2 ms |
708 KB |
Output is correct |
| 9 |
Correct |
2 ms |
716 KB |
Output is correct |
| 10 |
Correct |
2 ms |
716 KB |
Output is correct |
| 11 |
Correct |
2 ms |
832 KB |
Output is correct |
| 12 |
Correct |
3 ms |
836 KB |
Output is correct |
| 13 |
Correct |
2 ms |
844 KB |
Output is correct |
| 14 |
Correct |
2 ms |
844 KB |
Output is correct |
| 15 |
Correct |
2 ms |
836 KB |
Output is correct |
| 16 |
Correct |
2 ms |
844 KB |
Output is correct |
| 17 |
Correct |
3 ms |
844 KB |
Output is correct |
| 18 |
Correct |
2 ms |
844 KB |
Output is correct |
| 19 |
Correct |
3 ms |
844 KB |
Output is correct |
| 20 |
Correct |
2 ms |
844 KB |
Output is correct |
| 21 |
Correct |
2 ms |
844 KB |
Output is correct |
| 22 |
Correct |
2 ms |
828 KB |
Output is correct |
| 23 |
Correct |
2 ms |
844 KB |
Output is correct |
| 24 |
Correct |
2 ms |
844 KB |
Output is correct |
| 25 |
Correct |
2 ms |
844 KB |
Output is correct |
| 26 |
Correct |
2 ms |
844 KB |
Output is correct |
| 27 |
Correct |
2 ms |
844 KB |
Output is correct |
| 28 |
Correct |
2 ms |
716 KB |
Output is correct |
| 29 |
Correct |
2 ms |
844 KB |
Output is correct |
| 30 |
Correct |
2 ms |
716 KB |
Output is correct |
| 31 |
Correct |
2 ms |
844 KB |
Output is correct |
| 32 |
Correct |
2 ms |
716 KB |
Output is correct |
| 33 |
Correct |
2 ms |
844 KB |
Output is correct |
| 34 |
Correct |
394 ms |
134856 KB |
Output is correct |
| 35 |
Correct |
416 ms |
131784 KB |
Output is correct |
| 36 |
Correct |
414 ms |
129648 KB |
Output is correct |
| 37 |
Correct |
429 ms |
132276 KB |
Output is correct |
| 38 |
Correct |
415 ms |
132276 KB |
Output is correct |
| 39 |
Correct |
410 ms |
132192 KB |
Output is correct |
| 40 |
Correct |
432 ms |
141104 KB |
Output is correct |
| 41 |
Correct |
411 ms |
134448 KB |
Output is correct |
| 42 |
Correct |
421 ms |
137528 KB |
Output is correct |
| 43 |
Correct |
445 ms |
142140 KB |
Output is correct |
| 44 |
Correct |
456 ms |
142116 KB |
Output is correct |
| 45 |
Correct |
445 ms |
142120 KB |
Output is correct |
| 46 |
Correct |
432 ms |
142124 KB |
Output is correct |
| 47 |
Correct |
433 ms |
141164 KB |
Output is correct |
| 48 |
Correct |
424 ms |
140972 KB |
Output is correct |
| 49 |
Correct |
429 ms |
141740 KB |
Output is correct |
| 50 |
Correct |
444 ms |
141228 KB |
Output is correct |
| 51 |
Correct |
454 ms |
141224 KB |
Output is correct |
| 52 |
Correct |
384 ms |
130352 KB |
Output is correct |
| 53 |
Correct |
373 ms |
130352 KB |
Output is correct |
| 54 |
Correct |
395 ms |
130356 KB |
Output is correct |
| 55 |
Correct |
362 ms |
130120 KB |
Output is correct |
| 56 |
Correct |
453 ms |
142248 KB |
Output is correct |
| 57 |
Correct |
400 ms |
136628 KB |
Output is correct |
| 58 |
Correct |
433 ms |
137328 KB |
Output is correct |
| 59 |
Correct |
399 ms |
137260 KB |
Output is correct |
| 60 |
Correct |
367 ms |
129452 KB |
Output is correct |
| 61 |
Correct |
398 ms |
137772 KB |
Output is correct |
| 62 |
Correct |
384 ms |
135708 KB |
Output is correct |
| 63 |
Correct |
394 ms |
137772 KB |
Output is correct |
| 64 |
Correct |
393 ms |
133012 KB |
Output is correct |
| 65 |
Correct |
402 ms |
137768 KB |
Output is correct |
