#include <stdio.h>
#define N 1000000
int min(int a, int b) { return a < b ? a : b; }
int max(int a, int b) { return a > b ? a : b; }
int main() {
static int aa[N], bb[N], lla[N], rra[N], llb[N], rrb[N];
static char cc[N + 1];
int n, i, k;
scanf("%d", &n), n *= 2;
for (i = 0; i < n; i++)
scanf("%d", &aa[i]);
for (i = 0; i < n; i++)
scanf("%d", &bb[i]);
if (aa[0] <= bb[0])
lla[0] = 0, rra[0] = 0, llb[0] = 0, rrb[0] = 1;
else
lla[0] = 0, rra[0] = 1, llb[0] = 1, rrb[0] = 1;
for (i = 0; i + 1 < n; i++) {
lla[i + 1] = n + 1, rra[i + 1] = -1, llb[i + 1] = n + 1, rrb[i + 1] = -1;
if (lla[i] <= rra[i]) {
if (aa[i] <= aa[i + 1])
lla[i + 1] = min(lla[i + 1], lla[i]), rra[i + 1] = max(rra[i + 1], rra[i]);
if (aa[i] <= bb[i + 1])
llb[i + 1] = min(llb[i + 1], lla[i] + 1), rrb[i + 1] = max(rrb[i + 1], rra[i] + 1);
}
if (llb[i] <= rrb[i]) {
if (bb[i] <= aa[i + 1])
lla[i + 1] = min(lla[i + 1], llb[i]), rra[i + 1] = max(rra[i + 1], rrb[i]);
if (bb[i] <= bb[i + 1])
llb[i + 1] = min(llb[i + 1], llb[i] + 1), rrb[i + 1] = max(rrb[i + 1], rrb[i] + 1);
}
if (aa[i + 1] <= bb[i + 1])
llb[i + 1] = min(llb[i + 1], lla[i + 1]), rrb[i + 1] = max(rrb[i + 1], rra[i + 1]);
else
lla[i + 1] = min(lla[i + 1], llb[i + 1]), rra[i + 1] = max(rra[i + 1], rrb[i + 1]);
}
k = n / 2;
if (!(lla[n - 1] <= k && k <= rra[n - 1] || llb[n - 1] <= k && k <= rrb[n - 1])) {
printf("-1\n");
return 0;
}
for (i = n - 1; i >= 0; i--)
if (aa[i] <= bb[i]) {
if (lla[i] <= k && k <= rra[i] && (i + 1 == n || aa[i] <= (cc[i + 1] == 'A' ? aa[i + 1] : bb[i + 1])))
cc[i] = 'A';
else
cc[i] = 'B', k--;
} else {
if (llb[i] <= k && k <= rrb[i] && (i + 1 == n || bb[i] <= (cc[i + 1] == 'A' ? aa[i + 1] : bb[i + 1])))
cc[i] = 'B', k--;
else
cc[i] = 'A';
}
printf("%s\n", cc);
return 0;
}
Compilation message
building4.c: In function 'main':
building4.c:42:24: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
42 | if (!(lla[n - 1] <= k && k <= rra[n - 1] || llb[n - 1] <= k && k <= rrb[n - 1])) {
| ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
building4.c:13:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
13 | scanf("%d", &n), n *= 2;
| ^~~~~~~~~~~~~~~
building4.c:15:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
15 | scanf("%d", &aa[i]);
| ^~~~~~~~~~~~~~~~~~~
building4.c:17:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
17 | scanf("%d", &bb[i]);
| ^~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
340 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Correct |
0 ms |
340 KB |
Output is correct |
| 4 |
Correct |
0 ms |
212 KB |
Output is correct |
| 5 |
Correct |
1 ms |
340 KB |
Output is correct |
| 6 |
Correct |
2 ms |
308 KB |
Output is correct |
| 7 |
Correct |
1 ms |
340 KB |
Output is correct |
| 8 |
Correct |
2 ms |
340 KB |
Output is correct |
| 9 |
Correct |
2 ms |
340 KB |
Output is correct |
| 10 |
Correct |
1 ms |
468 KB |
Output is correct |
| 11 |
Correct |
1 ms |
432 KB |
Output is correct |
| 12 |
Correct |
2 ms |
468 KB |
Output is correct |
| 13 |
Correct |
2 ms |
468 KB |
Output is correct |
| 14 |
Correct |
2 ms |
440 KB |
Output is correct |
| 15 |
Correct |
2 ms |
512 KB |
Output is correct |
| 16 |
Correct |
2 ms |
468 KB |
Output is correct |
| 17 |
Correct |
3 ms |
468 KB |
Output is correct |
| 18 |
Correct |
2 ms |
468 KB |
Output is correct |
| 19 |
Correct |
1 ms |
512 KB |
Output is correct |
| 20 |
Correct |
1 ms |
436 KB |
Output is correct |
| 21 |
Correct |
2 ms |
468 KB |
Output is correct |
| 22 |
Correct |
1 ms |
340 KB |
Output is correct |
| 23 |
Correct |
1 ms |
468 KB |
Output is correct |
| 24 |
Correct |
2 ms |
468 KB |
Output is correct |
| 25 |
Correct |
1 ms |
468 KB |
Output is correct |
| 26 |
Correct |
1 ms |
468 KB |
Output is correct |
| 27 |
Correct |
1 ms |
436 KB |
Output is correct |
| 28 |
Correct |
1 ms |
348 KB |
Output is correct |
| 29 |
Correct |
2 ms |
596 KB |
Output is correct |
| 30 |
Correct |
1 ms |
340 KB |
Output is correct |
| 31 |
Correct |
1 ms |
436 KB |
Output is correct |
| 32 |
Correct |
1 ms |
348 KB |
Output is correct |
| 33 |
Correct |
1 ms |
432 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
340 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Correct |
0 ms |
340 KB |
Output is correct |
| 4 |
Correct |
0 ms |
212 KB |
Output is correct |
| 5 |
Correct |
1 ms |
340 KB |
Output is correct |
| 6 |
Correct |
2 ms |
308 KB |
Output is correct |
| 7 |
Correct |
1 ms |
340 KB |
Output is correct |
| 8 |
Correct |
2 ms |
340 KB |
Output is correct |
| 9 |
Correct |
2 ms |
340 KB |
Output is correct |
| 10 |
Correct |
1 ms |
468 KB |
Output is correct |
| 11 |
Correct |
1 ms |
432 KB |
Output is correct |
| 12 |
Correct |
2 ms |
468 KB |
Output is correct |
| 13 |
Correct |
2 ms |
468 KB |
Output is correct |
| 14 |
Correct |
2 ms |
440 KB |
Output is correct |
| 15 |
Correct |
2 ms |
512 KB |
Output is correct |
| 16 |
Correct |
2 ms |
468 KB |
Output is correct |
| 17 |
Correct |
3 ms |
468 KB |
Output is correct |
| 18 |
Correct |
2 ms |
468 KB |
Output is correct |
| 19 |
Correct |
1 ms |
512 KB |
Output is correct |
| 20 |
Correct |
1 ms |
436 KB |
Output is correct |
| 21 |
Correct |
2 ms |
468 KB |
Output is correct |
| 22 |
Correct |
1 ms |
340 KB |
Output is correct |
| 23 |
Correct |
1 ms |
468 KB |
Output is correct |
| 24 |
Correct |
2 ms |
468 KB |
Output is correct |
| 25 |
Correct |
1 ms |
468 KB |
Output is correct |
| 26 |
Correct |
1 ms |
468 KB |
Output is correct |
| 27 |
Correct |
1 ms |
436 KB |
Output is correct |
| 28 |
Correct |
1 ms |
348 KB |
Output is correct |
| 29 |
Correct |
2 ms |
596 KB |
Output is correct |
| 30 |
Correct |
1 ms |
340 KB |
Output is correct |
| 31 |
Correct |
1 ms |
436 KB |
Output is correct |
| 32 |
Correct |
1 ms |
348 KB |
Output is correct |
| 33 |
Correct |
1 ms |
432 KB |
Output is correct |
| 34 |
Correct |
274 ms |
42412 KB |
Output is correct |
| 35 |
Correct |
254 ms |
41812 KB |
Output is correct |
| 36 |
Correct |
254 ms |
41360 KB |
Output is correct |
| 37 |
Correct |
267 ms |
42092 KB |
Output is correct |
| 38 |
Correct |
283 ms |
41892 KB |
Output is correct |
| 39 |
Correct |
252 ms |
41164 KB |
Output is correct |
| 40 |
Correct |
260 ms |
44608 KB |
Output is correct |
| 41 |
Correct |
268 ms |
42100 KB |
Output is correct |
| 42 |
Correct |
296 ms |
43584 KB |
Output is correct |
| 43 |
Correct |
310 ms |
45080 KB |
Output is correct |
| 44 |
Correct |
316 ms |
44980 KB |
Output is correct |
| 45 |
Correct |
269 ms |
45180 KB |
Output is correct |
| 46 |
Correct |
268 ms |
45160 KB |
Output is correct |
| 47 |
Correct |
259 ms |
44152 KB |
Output is correct |
| 48 |
Correct |
260 ms |
44004 KB |
Output is correct |
| 49 |
Correct |
279 ms |
44808 KB |
Output is correct |
| 50 |
Correct |
280 ms |
44236 KB |
Output is correct |
| 51 |
Correct |
266 ms |
44248 KB |
Output is correct |
| 52 |
Correct |
201 ms |
33228 KB |
Output is correct |
| 53 |
Correct |
209 ms |
33484 KB |
Output is correct |
| 54 |
Correct |
191 ms |
33356 KB |
Output is correct |
| 55 |
Correct |
187 ms |
33144 KB |
Output is correct |
| 56 |
Correct |
254 ms |
45260 KB |
Output is correct |
| 57 |
Correct |
227 ms |
40004 KB |
Output is correct |
| 58 |
Correct |
233 ms |
40264 KB |
Output is correct |
| 59 |
Correct |
242 ms |
40364 KB |
Output is correct |
| 60 |
Correct |
223 ms |
38316 KB |
Output is correct |
| 61 |
Correct |
228 ms |
40780 KB |
Output is correct |
| 62 |
Correct |
224 ms |
40140 KB |
Output is correct |
| 63 |
Correct |
236 ms |
40892 KB |
Output is correct |
| 64 |
Correct |
226 ms |
39276 KB |
Output is correct |
| 65 |
Correct |
233 ms |
40724 KB |
Output is correct |
