oj.uz

Submission #776677

# Submission time Handle Problem Language Result Execution time Memory
776677 2023-07-08T06:55:56 Z bachhoangxuan Crossing (JOI21_crossing) C++17
100 / 100
 220 ms 20476 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;
int c[]={1,3,9,8,20,24,22,14,16};
int n,s[3][maxn],f[3][maxn],cr[maxn];
namespace Segtree{
    int tree[4*maxn],lazy[4*maxn],num[3][4*maxn];
    void getnew(int id,int val){
        lazy[id]=val;
        tree[id]=num[val][id];
    }
    void pushdown(int id){
        if(lazy[id]==-1) return;
        getnew(id<<1,lazy[id]);
        getnew(id<<1|1,lazy[id]);
        lazy[id]=-1;
    }
    void build(int l,int r,int id){
        lazy[id]=-1;
        if(l==r){
            for(int i=0;i<3;i++) num[i][id]=f[i][l];
            tree[id]=f[cr[l]][l];
            return;
        }
        int mid=(l+r)>>1;
        build(l,mid,id<<1);build(mid+1,r,id<<1|1);
        tree[id]=tree[id<<1]&tree[id<<1|1];
        for(int i=0;i<3;i++) num[i][id]=num[i][id<<1]&num[i][id<<1|1];
    }
    void update(int l,int r,int id,int tl,int tr,int val){
        if(tr<l || r<tl) return;
        if(tl<=l && r<=tr){
            getnew(id,val);
            return;
        }
        pushdown(id);
        int mid=(l+r)>>1;
        update(l,mid,id<<1,tl,tr,val);update(mid+1,r,id<<1|1,tl,tr,val);
        tree[id]=tree[id<<1]&tree[id<<1|1];
    }

}
void solve(){
    cin >> n;
    for(int i=0;i<3;i++){
        for(int j=1;j<=n;j++){
            char ch;cin >> ch;
            s[i][j]=(ch=='J'?0:(ch=='O'?1:2));
        }
    }
    for(int i=1;i<=n;i++){
        for(int j=0;j<9;j++){
            int p=(s[0][i]*c[j]+s[1][i]*(c[j]/3)+s[2][i]*(c[j]/9))%3;
            f[p][i]+=(1<<j);
        }
    }
    int q;cin >> q;
    for(int i=1;i<=n;i++){
        char ch;cin >> ch;
        cr[i]=(ch=='J'?0:(ch=='O'?1:2));
    }
    Segtree::build(1,n,1);
    cout << (Segtree::tree[1]?"Yes":"No") << '\n';
    for(int i=1;i<=q;i++){
        int l,r;char ch;cin >> l >> r >> ch;
        int cc=(ch=='J'?0:(ch=='O'?1:2));
        Segtree::update(1,n,1,l,r,cc);
        cout << (Segtree::tree[1]?"Yes":"No") << '\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
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 2428 KB Output is correct
2 Correct 66 ms 2468 KB Output is correct
3 Correct 50 ms 2372 KB Output is correct
4 Correct 46 ms 2432 KB Output is correct
5 Correct 63 ms 2356 KB Output is correct
6 Correct 57 ms 2308 KB Output is correct
7 Correct 54 ms 2412 KB Output is correct
8 Correct 48 ms 2500 KB Output is correct
9 Correct 49 ms 2448 KB Output is correct
10 Correct 48 ms 2500 KB Output is correct
11 Correct 56 ms 2508 KB Output is correct
12 Correct 49 ms 2508 KB Output is correct
13 Correct 58 ms 2416 KB Output is correct
14 Correct 52 ms 2496 KB Output is correct
15 Correct 59 ms 2520 KB Output is correct
16 Correct 49 ms 2488 KB Output is correct
17 Correct 56 ms 2520 KB Output is correct
18 Correct 48 ms 2420 KB Output is correct

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 2428 KB Output is correct
2 Correct 66 ms 2468 KB Output is correct
3 Correct 50 ms 2372 KB Output is correct
4 Correct 46 ms 2432 KB Output is correct
5 Correct 63 ms 2356 KB Output is correct
6 Correct 57 ms 2308 KB Output is correct
7 Correct 54 ms 2412 KB Output is correct
8 Correct 48 ms 2500 KB Output is correct
9 Correct 49 ms 2448 KB Output is correct
10 Correct 48 ms 2500 KB Output is correct
11 Correct 56 ms 2508 KB Output is correct
12 Correct 49 ms 2508 KB Output is correct
13 Correct 58 ms 2416 KB Output is correct
14 Correct 52 ms 2496 KB Output is correct
15 Correct 59 ms 2520 KB Output is correct
16 Correct 49 ms 2488 KB Output is correct
17 Correct 56 ms 2520 KB Output is correct
18 Correct 48 ms 2420 KB Output is correct
19 Correct 220 ms 20280 KB Output is correct
20 Correct 150 ms 20268 KB Output is correct
21 Correct 124 ms 19732 KB Output is correct
22 Correct 125 ms 19060 KB Output is correct
23 Correct 81 ms 4392 KB Output is correct
24 Correct 79 ms 4152 KB Output is correct
25 Correct 134 ms 20276 KB Output is correct
26 Correct 152 ms 20304 KB Output is correct
27 Correct 173 ms 20460 KB Output is correct
28 Correct 163 ms 20348 KB Output is correct
29 Correct 126 ms 20132 KB Output is correct
30 Correct 77 ms 4240 KB Output is correct
31 Correct 162 ms 20312 KB Output is correct
32 Correct 124 ms 19624 KB Output is correct
33 Correct 74 ms 4160 KB Output is correct
34 Correct 135 ms 20368 KB Output is correct
35 Correct 106 ms 18424 KB Output is correct
36 Correct 89 ms 4172 KB Output is correct
37 Correct 74 ms 4236 KB Output is correct
38 Correct 129 ms 18548 KB Output is correct
39 Correct 99 ms 20344 KB Output is correct
40 Correct 132 ms 12432 KB Output is correct
41 Correct 161 ms 19020 KB Output is correct
42 Correct 53 ms 18152 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 2428 KB Output is correct
2 Correct 66 ms 2468 KB Output is correct
3 Correct 50 ms 2372 KB Output is correct
4 Correct 46 ms 2432 KB Output is correct
5 Correct 63 ms 2356 KB Output is correct
6 Correct 57 ms 2308 KB Output is correct
7 Correct 54 ms 2412 KB Output is correct
8 Correct 48 ms 2500 KB Output is correct
9 Correct 49 ms 2448 KB Output is correct
10 Correct 48 ms 2500 KB Output is correct
11 Correct 56 ms 2508 KB Output is correct
12 Correct 49 ms 2508 KB Output is correct
13 Correct 58 ms 2416 KB Output is correct
14 Correct 52 ms 2496 KB Output is correct
15 Correct 59 ms 2520 KB Output is correct
16 Correct 49 ms 2488 KB Output is correct
17 Correct 56 ms 2520 KB Output is correct
18 Correct 48 ms 2420 KB Output is correct
19 Correct 50 ms 2432 KB Output is correct
20 Correct 52 ms 2308 KB Output is correct
21 Correct 56 ms 2508 KB Output is correct
22 Correct 43 ms 2256 KB Output is correct
23 Correct 68 ms 2428 KB Output is correct
24 Correct 47 ms 2428 KB Output is correct
25 Correct 67 ms 2476 KB Output is correct
26 Correct 54 ms 2388 KB Output is correct
27 Correct 69 ms 2508 KB Output is correct
28 Correct 44 ms 2320 KB Output is correct
29 Correct 51 ms 2412 KB Output is correct
30 Correct 62 ms 2316 KB Output is correct
31 Correct 62 ms 2528 KB Output is correct
32 Correct 48 ms 2432 KB Output is correct
33 Correct 57 ms 2516 KB Output is correct
34 Correct 45 ms 2368 KB Output is correct
35 Correct 49 ms 2508 KB Output is correct
36 Correct 57 ms 2424 KB Output is correct
37 Correct 51 ms 2436 KB Output is correct
38 Correct 49 ms 2440 KB Output is correct
39 Correct 65 ms 2524 KB Output is correct
40 Correct 51 ms 2496 KB Output is correct
41 Correct 49 ms 2492 KB Output is correct
42 Correct 57 ms 2412 KB Output is correct
43 Correct 47 ms 2456 KB Output is correct
44 Correct 55 ms 2484 KB Output is correct

Subtask #4
51.0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 2428 KB Output is correct
2 Correct 66 ms 2468 KB Output is correct
3 Correct 50 ms 2372 KB Output is correct
4 Correct 46 ms 2432 KB Output is correct
5 Correct 63 ms 2356 KB Output is correct
6 Correct 57 ms 2308 KB Output is correct
7 Correct 54 ms 2412 KB Output is correct
8 Correct 48 ms 2500 KB Output is correct
9 Correct 49 ms 2448 KB Output is correct
10 Correct 48 ms 2500 KB Output is correct
11 Correct 56 ms 2508 KB Output is correct
12 Correct 49 ms 2508 KB Output is correct
13 Correct 58 ms 2416 KB Output is correct
14 Correct 52 ms 2496 KB Output is correct
15 Correct 59 ms 2520 KB Output is correct
16 Correct 49 ms 2488 KB Output is correct
17 Correct 56 ms 2520 KB Output is correct
18 Correct 48 ms 2420 KB Output is correct
19 Correct 220 ms 20280 KB Output is correct
20 Correct 150 ms 20268 KB Output is correct
21 Correct 124 ms 19732 KB Output is correct
22 Correct 125 ms 19060 KB Output is correct
23 Correct 81 ms 4392 KB Output is correct
24 Correct 79 ms 4152 KB Output is correct
25 Correct 134 ms 20276 KB Output is correct
26 Correct 152 ms 20304 KB Output is correct
27 Correct 173 ms 20460 KB Output is correct
28 Correct 163 ms 20348 KB Output is correct
29 Correct 126 ms 20132 KB Output is correct
30 Correct 77 ms 4240 KB Output is correct
31 Correct 162 ms 20312 KB Output is correct
32 Correct 124 ms 19624 KB Output is correct
33 Correct 74 ms 4160 KB Output is correct
34 Correct 135 ms 20368 KB Output is correct
35 Correct 106 ms 18424 KB Output is correct
36 Correct 89 ms 4172 KB Output is correct
37 Correct 74 ms 4236 KB Output is correct
38 Correct 129 ms 18548 KB Output is correct
39 Correct 99 ms 20344 KB Output is correct
40 Correct 132 ms 12432 KB Output is correct
41 Correct 161 ms 19020 KB Output is correct
42 Correct 53 ms 18152 KB Output is correct
43 Correct 50 ms 2432 KB Output is correct
44 Correct 52 ms 2308 KB Output is correct
45 Correct 56 ms 2508 KB Output is correct
46 Correct 43 ms 2256 KB Output is correct
47 Correct 68 ms 2428 KB Output is correct
48 Correct 47 ms 2428 KB Output is correct
49 Correct 67 ms 2476 KB Output is correct
50 Correct 54 ms 2388 KB Output is correct
51 Correct 69 ms 2508 KB Output is correct
52 Correct 44 ms 2320 KB Output is correct
53 Correct 51 ms 2412 KB Output is correct
54 Correct 62 ms 2316 KB Output is correct
55 Correct 62 ms 2528 KB Output is correct
56 Correct 48 ms 2432 KB Output is correct
57 Correct 57 ms 2516 KB Output is correct
58 Correct 45 ms 2368 KB Output is correct
59 Correct 49 ms 2508 KB Output is correct
60 Correct 57 ms 2424 KB Output is correct
61 Correct 51 ms 2436 KB Output is correct
62 Correct 49 ms 2440 KB Output is correct
63 Correct 65 ms 2524 KB Output is correct
64 Correct 51 ms 2496 KB Output is correct
65 Correct 49 ms 2492 KB Output is correct
66 Correct 57 ms 2412 KB Output is correct
67 Correct 47 ms 2456 KB Output is correct
68 Correct 55 ms 2484 KB Output is correct
69 Correct 143 ms 19040 KB Output is correct
70 Correct 146 ms 20288 KB Output is correct
71 Correct 73 ms 4168 KB Output is correct
72 Correct 84 ms 4376 KB Output is correct
73 Correct 73 ms 4276 KB Output is correct
74 Correct 128 ms 19020 KB Output is correct
75 Correct 91 ms 4240 KB Output is correct
76 Correct 141 ms 20352 KB Output is correct
77 Correct 111 ms 19088 KB Output is correct
78 Correct 74 ms 4244 KB Output is correct
79 Correct 73 ms 4164 KB Output is correct
80 Correct 103 ms 18244 KB Output is correct
81 Correct 74 ms 4144 KB Output is correct
82 Correct 146 ms 20356 KB Output is correct
83 Correct 125 ms 19772 KB Output is correct
84 Correct 74 ms 4172 KB Output is correct
85 Correct 74 ms 4192 KB Output is correct
86 Correct 139 ms 18584 KB Output is correct
87 Correct 143 ms 20300 KB Output is correct
88 Correct 81 ms 4176 KB Output is correct
89 Correct 126 ms 19340 KB Output is correct
90 Correct 135 ms 20336 KB Output is correct
91 Correct 78 ms 4236 KB Output is correct
92 Correct 112 ms 18432 KB Output is correct
93 Correct 73 ms 4172 KB Output is correct
94 Correct 79 ms 4296 KB Output is correct
95 Correct 73 ms 4208 KB Output is correct
96 Correct 137 ms 18512 KB Output is correct
97 Correct 99 ms 20312 KB Output is correct
98 Correct 100 ms 12984 KB Output is correct
99 Correct 164 ms 20476 KB Output is correct
100 Correct 57 ms 19732 KB Output is correct