oj.uz

Submission #402307

# Submission time Handle Problem Language Result Execution time Memory
402307 2021-05-11T14:51:10 Z wiwiho Building 4 (JOI20_building4) C++14
100 / 100
 292 ms 19440 KB 
#include <bits/stdc++.h>
#include <bits/extc++.h>

#define StarBurstStream ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define iter(a) a.begin(), a.end()
#define riter(a) a.rbegin(), a.rend()
#define lsort(a) sort(iter(a))
#define gsort(a) sort(riter(a))
#define pb(a) push_back(a)
#define eb(a) emplace_back(a)
#define pf(a) push_front(a)
#define ef(a) emplace_front(a)
#define pob pop_back()
#define pof pop_front()
#define mp(a, b) make_pair(a, b)
#define F first
#define S second
#define mt make_tuple
#define gt(t, i) get<i>(t)
#define tomax(a, b) ((a) = max((a), (b)))
#define tomin(a, b) ((a) = min((a), (b)))
#define topos(a) ((a) = (((a) % MOD + MOD) % MOD))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define printv(a, b) {bool pvaspace=false; \
for(auto pva : a){ \
    if(pvaspace) b << " "; pvaspace=true;\
    b << pva;\
}\
b << "\n";}

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;
using tiii = tuple<int, int, int>;

const ll MOD = 1000000007;
const ll MAX = 2147483647;

template<typename A, typename B>
ostream& operator<<(ostream& o, pair<A, B> p){
    return o << '(' << p.F << ',' << p.S << ')';
}

ll ifloor(ll a, ll b){
    if(b < 0) a *= -1, b *= -1;
    if(a < 0) return (a - b + 1) / b;
    else return a / b;
}

ll iceil(ll a, ll b){
    if(b < 0) a *= -1, b *= -1;
    if(a > 0) return (a + b - 1) / b;
    else return a / b;
}

int main(){
    StarBurstStream

    int n;
    cin >> n;

    vector<vector<int>> a(2, vector<int>(2 * n + 1));
    vector<int> c(2 * n + 1);
    for(int i = 1; i <= 2 * n; i++) cin >> a[0][i];
    for(int i = 1; i <= 2 * n; i++) cin >> a[1][i];

    int lst = 0;
    int t = 0;
    for(int i = 1; i <= 2 * n; i++){
        int mn = a[0][i] <= a[1][i] ? 0 : 1;
        if(lst <= a[mn][i]) c[i] = mn;
        else if(lst <= a[!mn][i]) c[i] = !mn;
        else{
            cout << "-1\n";
            return 0;
        }
        lst = a[c[i]][i];
        if(c[i] == 0) t++;
        else t--;
    }
//    printv(c, cerr);

    int rp = 2 * n, tmp = 0;
    bool no = false;
    for(int i = 2 * n; i >= 1 && t != 0; i--){
        if(a[c[i]][i] > a[!c[i]][i]){
            no = true;
            continue;
        }
        if(i < 2 * n && a[!c[i]][i] <= a[c[i + 1]][i + 1]){
            rp = i;
            tmp = 0;
            no = false;
        }
        else if(i < 2 * n && a[!c[i]][i] > a[!c[i + 1]][i + 1]){
            no = true;
        }

        if(no) continue;
        if(c[i] == 0) tmp -= 2;
        else tmp += 2;
//        cerr << "test " << i << " " << c[i] << " " << tmp << " " << t << " " << rp << "\n";

        if((ll)tmp * t >= 0) continue;

        t += tmp;
        for(int j = i; j <= rp; j++) c[j] = !c[j];
        rp = i - 1;
        tmp = 0;
    }

    if(t != 0){
        cout << "-1\n";
        return 0;
    }

    for(int i = 1; i <= 2 * n; i++){
        if(c[i] == 0) cout << "A";
        else cout << "B";
    }
    cout << "\n";

    return 0;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 2 ms 324 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 2 ms 320 KB Output is correct
8 Correct 3 ms 332 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 2 ms 332 KB Output is correct
11 Correct 2 ms 332 KB Output is correct
12 Correct 2 ms 332 KB Output is correct
13 Correct 2 ms 320 KB Output is correct
14 Correct 2 ms 332 KB Output is correct
15 Correct 2 ms 324 KB Output is correct
16 Correct 2 ms 332 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 2 ms 332 KB Output is correct
19 Correct 2 ms 332 KB Output is correct
20 Correct 2 ms 332 KB Output is correct
21 Correct 2 ms 332 KB Output is correct
22 Correct 2 ms 332 KB Output is correct
23 Correct 2 ms 320 KB Output is correct
24 Correct 2 ms 332 KB Output is correct
25 Correct 2 ms 400 KB Output is correct
26 Correct 2 ms 320 KB Output is correct
27 Correct 2 ms 320 KB Output is correct
28 Correct 2 ms 332 KB Output is correct
29 Correct 2 ms 332 KB Output is correct
30 Correct 2 ms 332 KB Output is correct
31 Correct 2 ms 332 KB Output is correct
32 Correct 2 ms 332 KB Output is correct
33 Correct 2 ms 332 KB Output is correct
34 Correct 239 ms 12688 KB Output is correct
35 Correct 267 ms 12868 KB Output is correct
36 Correct 267 ms 12496 KB Output is correct
37 Correct 271 ms 12804 KB Output is correct
38 Correct 262 ms 12812 KB Output is correct
39 Correct 258 ms 13428 KB Output is correct
40 Correct 279 ms 13704 KB Output is correct
41 Correct 262 ms 13116 KB Output is correct
42 Correct 278 ms 13388 KB Output is correct
43 Correct 285 ms 13740 KB Output is correct
44 Correct 292 ms 13676 KB Output is correct
45 Correct 285 ms 13864 KB Output is correct
46 Correct 276 ms 13668 KB Output is correct
47 Correct 281 ms 13648 KB Output is correct
48 Correct 274 ms 13652 KB Output is correct
49 Correct 278 ms 13688 KB Output is correct
50 Correct 280 ms 13792 KB Output is correct
51 Correct 292 ms 13716 KB Output is correct
52 Correct 217 ms 19320 KB Output is correct
53 Correct 219 ms 19440 KB Output is correct
54 Correct 205 ms 19320 KB Output is correct
55 Correct 210 ms 19336 KB Output is correct
56 Correct 275 ms 13708 KB Output is correct
57 Correct 249 ms 19216 KB Output is correct
58 Correct 254 ms 19192 KB Output is correct
59 Correct 253 ms 19272 KB Output is correct
60 Correct 242 ms 18468 KB Output is correct
61 Correct 256 ms 19324 KB Output is correct
62 Correct 248 ms 18968 KB Output is correct
63 Correct 253 ms 19212 KB Output is correct
64 Correct 251 ms 18748 KB Output is correct
65 Correct 264 ms 19320 KB Output is correct