oj.uz

Submission #767370

# Submission time Handle Problem Language Result Execution time Memory
767370 2023-06-26T17:13:47 Z bachhoangxuan Building 4 (JOI20_building4) C++17
100 / 100
 240 ms 84544 KB 
// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
//#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<pii,int>
#define mpp make_pair
#define fi first
#define se second
//const int inf=1e18;
const int mod=1e9+7;
const int maxn=200005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=500005;
const int maxl=20;
const int maxa=250000;
const int root=3;
/*
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
*/
const int base=101;

void solve(){
    int n;cin >> n;n*=2;
    vector<int> a(n),b(n);
    for(int i=0;i<n;i++) cin >> a[i];
    for(int i=0;i<n;i++) cin >> b[i];
    vector<vector<pii>> rn(n,vector<pii>(2,mpp(-1,-1)));
    auto add = [&](pii a,pii b){
        if(a==mpp(-1,-1)) return b;
        else if(b==mpp(-1,-1)) return a;
        else return mpp(min(a.fi,b.fi),max(a.se,b.se));
    };
    rn[0][0]={0,0};rn[0][1]={1,1};
    for(int i=1;i<n;i++){
        if(a[i-1]<=a[i]) rn[i][0]=add(rn[i][0],rn[i-1][0]);
        if(a[i-1]<=b[i]) rn[i][1]=add(rn[i][1],rn[i-1][0]);
        if(b[i-1]<=a[i]) rn[i][0]=add(rn[i][0],rn[i-1][1]);
        if(b[i-1]<=b[i]) rn[i][1]=add(rn[i][1],rn[i-1][1]);
        if(rn[i][1]!=mpp(-1,-1)) rn[i][1].fi++,rn[i][1].se++;
    }
    int c=0,cur=n/2;
    while(c<=1 && (rn[n-1][c].se<n/2 || rn[n-1][c].fi>n/2)) c++;
    if(c==2){
        cout << -1 << '\n';
        return;
    }
    string ans;
    for(int i=n-1;i>=0;i--){
        ans+=char('A'+c);cur-=c;
        if(i==0) break;
        if(rn[i-1][0].fi<=cur && cur<=rn[i-1][0].se && a[i-1]<=(c?b[i]:a[i])) c=0;
        else c=1;
    }
    reverse(ans.begin(),ans.end());
    cout << ans << '\n';
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

Subtask #1
11.0 / 11.0

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

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 592 KB Output is correct
8 Correct 2 ms 596 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 2 ms 596 KB Output is correct
12 Correct 2 ms 596 KB Output is correct
13 Correct 2 ms 596 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 2 ms 596 KB Output is correct
17 Correct 1 ms 596 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 1 ms 588 KB Output is correct
20 Correct 1 ms 596 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 1 ms 592 KB Output is correct
23 Correct 1 ms 592 KB Output is correct
24 Correct 1 ms 596 KB Output is correct
25 Correct 1 ms 596 KB Output is correct
26 Correct 1 ms 596 KB Output is correct
27 Correct 2 ms 596 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 2 ms 596 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 596 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 1 ms 596 KB Output is correct
34 Correct 203 ms 80836 KB Output is correct
35 Correct 199 ms 78160 KB Output is correct
36 Correct 196 ms 76876 KB Output is correct
37 Correct 206 ms 78564 KB Output is correct
38 Correct 193 ms 78432 KB Output is correct
39 Correct 186 ms 77912 KB Output is correct
40 Correct 223 ms 83600 KB Output is correct
41 Correct 200 ms 79484 KB Output is correct
42 Correct 201 ms 81544 KB Output is correct
43 Correct 211 ms 84280 KB Output is correct
44 Correct 224 ms 84280 KB Output is correct
45 Correct 212 ms 84288 KB Output is correct
46 Correct 199 ms 84284 KB Output is correct
47 Correct 224 ms 83392 KB Output is correct
48 Correct 240 ms 83252 KB Output is correct
49 Correct 203 ms 84024 KB Output is correct
50 Correct 218 ms 83424 KB Output is correct
51 Correct 211 ms 83516 KB Output is correct
52 Correct 173 ms 72584 KB Output is correct
53 Correct 157 ms 72640 KB Output is correct
54 Correct 181 ms 72692 KB Output is correct
55 Correct 147 ms 72392 KB Output is correct
56 Correct 209 ms 84544 KB Output is correct
57 Correct 182 ms 79116 KB Output is correct
58 Correct 217 ms 79568 KB Output is correct
59 Correct 179 ms 79560 KB Output is correct
60 Correct 169 ms 75172 KB Output is correct
61 Correct 193 ms 80056 KB Output is correct
62 Correct 180 ms 78868 KB Output is correct
63 Correct 221 ms 80060 KB Output is correct
64 Correct 174 ms 77232 KB Output is correct
65 Correct 182 ms 80048 KB Output is correct