Submission #248529

# Submission time Handle Problem Language Result Execution time Memory
248529 2020-07-12T15:47:28 Z MladenP Building 4 (JOI20_building4) C++17
100 / 100
320 ms 45548 KB
#include<bits/stdc++.h>
#define PRINT(x) cerr<<#x<<'='<<x<<endl;
#define NL(x) " \n"[(x)]
#define lld long long
#define pil pair<int,lld>
#define pli pair<lld,int>
#define pll pair<lld,lld>
#define pii pair<int,int>
#define pb push_back
#define fi first
#define se second
#define mid (l+r)/2
#define endl '\n'
#define all(a) begin(a),end(a)
#define sz(a) int((a).size())
#define LINF 1000000000000000LL
#define INF 1000000000
#define EPS 1e-9
using namespace std;
#define MAXN 500010
int A[2*MAXN], B[2*MAXN];
string rez;
pii Ai[2*MAXN], Bi[2*MAXN];
pii unija(pii A, pii B) {
    return {min(A.fi, B.fi), max(A.se, B.se)};
}
bool in(int x, pii A) {
    return (A.fi <= x && x <= A.se);
}
int main() {
    ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);cerr.tie(0);
    int N; 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++) Ai[i] = Bi[i] = {INF, -INF};
    Ai[2*N] = {1, 1}; Bi[2*N] = {0, 0};
    for(int i = 2*N-1; i >= 1; i--) {
        if(A[i] <= A[i+1]) Ai[i] = unija(Ai[i], Ai[i+1]);
        if(A[i] <= B[i+1]) Ai[i] = unija(Ai[i], Bi[i+1]);
        Ai[i] = {Ai[i].fi+1, Ai[i].se+1};

        if(B[i] <= A[i+1]) Bi[i] = unija(Bi[i], Ai[i+1]);
        if(B[i] <= B[i+1]) Bi[i] = unija(Bi[i], Bi[i+1]);
    }
    int cnt = N, prev = 0;
    for(int i = 1; i <= 2*N; i++) {
        if(prev <= A[i] && in(cnt, Ai[i])) {
            rez += "A";
            prev = A[i];
            cnt--;
        } else if(prev <= B[i] && in(cnt, Bi[i])) {
            rez += "B";
            prev = B[i];
        } else {
            cout << -1 << endl;
            return 0;
        }
    }
    cout << rez;
    return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 512 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 2 ms 512 KB Output is correct
12 Correct 1 ms 512 KB Output is correct
13 Correct 2 ms 512 KB Output is correct
14 Correct 1 ms 512 KB Output is correct
15 Correct 1 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 1 ms 512 KB Output is correct
21 Correct 1 ms 512 KB Output is correct
22 Correct 1 ms 512 KB Output is correct
23 Correct 2 ms 512 KB Output is correct
24 Correct 2 ms 512 KB Output is correct
25 Correct 1 ms 512 KB Output is correct
26 Correct 1 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 2 ms 512 KB Output is correct
33 Correct 1 ms 512 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 512 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 2 ms 512 KB Output is correct
12 Correct 1 ms 512 KB Output is correct
13 Correct 2 ms 512 KB Output is correct
14 Correct 1 ms 512 KB Output is correct
15 Correct 1 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 1 ms 512 KB Output is correct
21 Correct 1 ms 512 KB Output is correct
22 Correct 1 ms 512 KB Output is correct
23 Correct 2 ms 512 KB Output is correct
24 Correct 2 ms 512 KB Output is correct
25 Correct 1 ms 512 KB Output is correct
26 Correct 1 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 2 ms 512 KB Output is correct
33 Correct 1 ms 512 KB Output is correct
34 Correct 294 ms 23416 KB Output is correct
35 Correct 276 ms 24112 KB Output is correct
36 Correct 278 ms 41392 KB Output is correct
37 Correct 291 ms 42160 KB Output is correct
38 Correct 280 ms 42176 KB Output is correct
39 Correct 271 ms 41392 KB Output is correct
40 Correct 312 ms 44952 KB Output is correct
41 Correct 276 ms 42416 KB Output is correct
42 Correct 314 ms 43824 KB Output is correct
43 Correct 312 ms 45336 KB Output is correct
44 Correct 311 ms 45292 KB Output is correct
45 Correct 313 ms 45268 KB Output is correct
46 Correct 317 ms 45532 KB Output is correct
47 Correct 303 ms 44520 KB Output is correct
48 Correct 310 ms 44264 KB Output is correct
49 Correct 316 ms 45164 KB Output is correct
50 Correct 320 ms 44496 KB Output is correct
51 Correct 306 ms 44508 KB Output is correct
52 Correct 176 ms 33516 KB Output is correct
53 Correct 188 ms 33516 KB Output is correct
54 Correct 178 ms 33632 KB Output is correct
55 Correct 171 ms 33260 KB Output is correct
56 Correct 312 ms 45548 KB Output is correct
57 Correct 253 ms 40396 KB Output is correct
58 Correct 264 ms 40556 KB Output is correct
59 Correct 250 ms 40516 KB Output is correct
60 Correct 260 ms 38452 KB Output is correct
61 Correct 282 ms 41232 KB Output is correct
62 Correct 263 ms 40560 KB Output is correct
63 Correct 284 ms 40940 KB Output is correct
64 Correct 264 ms 39556 KB Output is correct
65 Correct 278 ms 41068 KB Output is correct