oj.uz

Submission #623026

# Submission time Handle Problem Language Result Execution time Memory
623026 2022-08-05T05:38:20 Z radal Building 4 (JOI20_building4) C++17
100 / 100
 253 ms 45356 KB 
#include <bits/stdc++.h>
#pragma GCC target("sse,sse2,avx2")
#pragma GCC optimize("unroll-loops,O2")
#define rep(i,l,r) for (int i = l; i < r; i++)
#define repr(i,r,l) for (int i = r; i >= l; i--)
#define X first
#define Y second
#define all(x) (x).begin() , (x).end()
#define pb push_back
#define endl '\n'
#define debug(x) cerr << #x << " : " << x << endl;
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pll;
constexpr int N = 1e6+10,mod = 998244353,inf = 1e9+10,sq = 700;
inline int mkay(int a,int b){
    if (a+b >= mod) return a+b-mod;
    if (a+b < 0) return a+b+mod;
    return a+b;
}
 
inline int poww(int a,int k){
    if (k < 0) return 0;
    int z = 1;
    while (k){
        if (k&1) z = 1ll*z*a%mod;
        a = 1ll*a*a%mod;
        k /= 2;
    } 
    return z; 
}
int n,a[N],b[N];
int mx[N][2],mi[N][2];
int main(){
    ios :: sync_with_stdio(0); cin.tie(0);
    cin >> n;
    n *= 2;
    rep(i,0,n) cin >> a[i];
    rep(i,0,n) cin >> b[i];
    int cur = 0;
    rep(i,0,n){
        if (max(a[i],b[i]) < cur){
            cout << -1 << endl;
            return 0;
        }
        if (min(a[i],b[i]) >= cur){
            cur = min(a[i],b[i]);
        }
        else cur = max(a[i],b[i]);
    }
    mx[n-1][0] = mi[n-1][0] = 1;
    mx[n-1][1] = mi[n-1][1] = -1;
    repr(i,n-2,0){
        mx[i][0] = mx[i][1] = -inf;
        mi[i][0] = mi[i][1] = inf;
        if (a[i] <= a[i+1]){
            mx[i][0] = max(mx[i][0],mx[i+1][0]+1);
            mi[i][0] = min(mi[i][0],mi[i+1][0]+1);
        }
        if (a[i] <= b[i+1]){
            mx[i][0] = max(mx[i][0],mx[i+1][1]+1);
            mi[i][0] = min(mi[i][0],mi[i+1][1]+1);
        }
        if (b[i] <= a[i+1]){
            mx[i][1] = max(mx[i][1],mx[i+1][0]-1);
            mi[i][1] = min(mi[i][1],mi[i+1][0]-1);
        }
        if (b[i] <= b[i+1]){
            mx[i][1] = max(mx[i][1],mx[i+1][1]-1);
            mi[i][1] = min(mi[i][1],mi[i+1][1]-1);
        }
    }
    if ((mi[0][0] > 0 || mx[0][0] < 0) && (mi[0][1] > 0 || mx[0][1] < 0)){
        cout << -1;
        return 0;
    }
    cur = 0;
    int s = 0;
    string ans = "";
    rep(i,0,n){
        if (min(a[i],b[i]) < cur){
            cur = max(a[i],b[i]);
            if (a[i] == cur){
                s++;
                ans += 'A';
            }
            else{
                s--;
                ans += 'B';
            }
            continue;
        }
        if (i == n-1){
            if (s == -1) ans += 'A';
            else ans += 'B';
            continue;
        }
        if ((a[i+1] < a[i] || mi[i+1][0] > -s-1 || mx[i+1][0] < -s-1) && (b[i+1] < a[i] || mi[i+1][1] > -s-1 || mx[i+1][1] < -s-1)){
            ans += 'B';
            s--;
            cur = b[i];
        }
        else{
            ans += 'A';
            s++;
            cur = a[i];
        }
    }
    cout << ans;
    return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 2 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 2 ms 464 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 468 KB Output is correct

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 2 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 2 ms 464 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 189 ms 7968 KB Output is correct
35 Correct 213 ms 41956 KB Output is correct
36 Correct 237 ms 41352 KB Output is correct
37 Correct 202 ms 42136 KB Output is correct
38 Correct 189 ms 42116 KB Output is correct
39 Correct 194 ms 41404 KB Output is correct
40 Correct 206 ms 44752 KB Output is correct
41 Correct 192 ms 42440 KB Output is correct
42 Correct 234 ms 43744 KB Output is correct
43 Correct 236 ms 45184 KB Output is correct
44 Correct 232 ms 45160 KB Output is correct
45 Correct 253 ms 45164 KB Output is correct
46 Correct 217 ms 45084 KB Output is correct
47 Correct 211 ms 44028 KB Output is correct
48 Correct 218 ms 43924 KB Output is correct
49 Correct 219 ms 44952 KB Output is correct
50 Correct 221 ms 44200 KB Output is correct
51 Correct 235 ms 44256 KB Output is correct
52 Correct 154 ms 33612 KB Output is correct
53 Correct 162 ms 33584 KB Output is correct
54 Correct 142 ms 33448 KB Output is correct
55 Correct 151 ms 33212 KB Output is correct
56 Correct 219 ms 45356 KB Output is correct
57 Correct 185 ms 40384 KB Output is correct
58 Correct 199 ms 40468 KB Output is correct
59 Correct 192 ms 40572 KB Output is correct
60 Correct 172 ms 38452 KB Output is correct
61 Correct 192 ms 40992 KB Output is correct
62 Correct 207 ms 40436 KB Output is correct
63 Correct 180 ms 40952 KB Output is correct
64 Correct 192 ms 39544 KB Output is correct
65 Correct 189 ms 40880 KB Output is correct