oj.uz

Submission #1055396

# Submission time Handle Problem Language Result Execution time Memory
1055396 2024-08-12T18:41:34 Z YassirSalama Crossing (JOI21_crossing) C++17
26 / 100
 1041 ms 136836 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
map<char,int> mp;
#define all(v) v.begin(),v.end()
struct Hash {
    vector<int> v;
    int P,mod;
    const int maxn=2e5+100;
    int pref[(int)2e5+100];
    struct Node{
        int val;
        int lz;
        Node* left,*right;
        Node() : left(nullptr),right(nullptr){}
    };
    int f(int a){
        a%=mod;
        if(a<0) a+=mod;
        return a%=mod;
    }
    int sum(int l,int r){
        if(l==0) return pref[r];
        return f(pref[r]%mod-pref[l-1]%mod)%mod;
    }
    void push(Node* node,int l,int r){
        if(node->lz==0) return;
        node->val=f(node->lz*f(sum(l,r))%mod);
        if(l!=r){
            node->left->lz=node->lz;
            node->right->lz=node->lz;
        }
        node->lz=0;
    }
    void p(Node* node,int l,int r){
        push(node,l,r);
        int mid=(l+r)/2;
        if(l==r) return;
        push(node->left,l,mid);
        push(node->right,mid+1,r);
    }
    void build(Node* node,int l,int r,vector<int> &v){
        node->lz=0;
        if(l==r){
            node->val=v[l];
            return;
        }
        int mid=(l+r)/2;
        node->left=new Node();
        node->right=new Node();
        build(node->left,l,mid,v);
        build(node->right,mid+1,r,v);
        node->val=((node->left->val%mod)+(node->right->val%mod))%mod;
    }
    void update(Node* node,int l,int r,int ql,int qr,int x){
        p(node,l,r);
        if(ql<=l&&r<=qr){
            node->lz=x;p(node,l,r);
            return;
        }
        int mid=(l+r)>>1;
        if(ql<=mid){
            update(node->left,l,mid,ql,qr,x);
        }
        if(qr>mid) update(node->right,mid+1,r,ql,qr,x);
        node->val=((node->left->val%mod)+(node->right->val%mod))%mod;
    }
    int query(Node* node,int l,int r,int ql,int qr){
        if(ql<=l&&r<=qr) return node->val%mod;
        int mid=(l+r)/2;
        int ans=0;
        if(ql<=mid) ans=f(ans+query(node->left,l,mid,ql,qr)),ans%=mod;
        if(qr>mid) ans=f(ans+query(node->right,mid+1,r,ql,qr)),ans%=mod;
        return ans%mod;
    }
    vector<int> hsh(string s){
        int n=s.length();
        int c=1;
        vector<int> v(n);
        for(int i=0;i<n;i++){
            int x=mp[s[i]];
            v[i]=(x%mod*c%mod)%mod;
            c=(c%mod*P%mod)%mod;
        }
        return v;
    }
    Node* root;
    void b(string s,int p,int MOD){
        P=p;
        mod=MOD;
        v=hsh(s);
        for(int i=0;i<maxn;i++){
            pref[i]=binpow(P,i)%mod;
            if(i){
                pref[i]=f(pref[i]%mod+pref[i-1]%mod)%mod;
            }
        }
        root=new Node();
        int n=s.size();
        build(root,0,n-1,v);
    }
    int get(){
        return root->val%mod;
    }
    int binpow(int a,int b){
        int res=1;
        while(b){
            if(b&1) {
                res=(res%mod*a%mod)%mod;
            }
            a=(a%mod*a%mod)%mod;
            b>>=1;
        }
        return res;
    }
};
Hash a1,a2,a3,b1,b2,b3;
signed main(){
    mp['J']=1;mp['O']=4;mp['I']=7;
    ios_base::sync_with_stdio(0);cin.tie(0);
    int n;
    cin>>n;
    string s;
    cin>>s>>s>>s;
    int q;
    cin>>q;
    string t;
    cin>>t;
    a1.b(s,31,1e9+7);
    b1.b(t,31,1e9+7);
    a2.b(s,41,1e9+3);
    b2.b(t,41,1e9+3);
    a3.b(s,13,1000000009);
    b3.b(s,13,1000000009);
    puts((a1.get()==b1.get()&&a2.get()==b2.get()&&a3.get()==b3.get())?"Yes":"No");
    while(q--){
        int l,r;
        cin>>l>>r,--l,--r;char c;cin>>c;
        b1.update(b1.root,0,n-1,l,r,mp[c]);
        b2.update(b2.root,0,n-1,l,r,mp[c]);
        puts((a1.get()==b1.get()&&a2.get()==b2.get()&&a3.get()==b3.get())?"Yes":"No");
    }
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 265 ms 10196 KB Output is correct
2 Correct 284 ms 10320 KB Output is correct
3 Correct 349 ms 10328 KB Output is correct
4 Correct 262 ms 10324 KB Output is correct
5 Correct 238 ms 10324 KB Output is correct
6 Correct 248 ms 10320 KB Output is correct
7 Correct 260 ms 10452 KB Output is correct
8 Correct 247 ms 10320 KB Output is correct
9 Correct 249 ms 10324 KB Output is correct
10 Correct 247 ms 10320 KB Output is correct
11 Correct 251 ms 10464 KB Output is correct
12 Correct 247 ms 10324 KB Output is correct
13 Correct 255 ms 10324 KB Output is correct
14 Correct 247 ms 10320 KB Output is correct
15 Correct 248 ms 10320 KB Output is correct
16 Correct 250 ms 10392 KB Output is correct
17 Correct 251 ms 10464 KB Output is correct
18 Correct 339 ms 10324 KB Output is correct

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 265 ms 10196 KB Output is correct
2 Correct 284 ms 10320 KB Output is correct
3 Correct 349 ms 10328 KB Output is correct
4 Correct 262 ms 10324 KB Output is correct
5 Correct 238 ms 10324 KB Output is correct
6 Correct 248 ms 10320 KB Output is correct
7 Correct 260 ms 10452 KB Output is correct
8 Correct 247 ms 10320 KB Output is correct
9 Correct 249 ms 10324 KB Output is correct
10 Correct 247 ms 10320 KB Output is correct
11 Correct 251 ms 10464 KB Output is correct
12 Correct 247 ms 10324 KB Output is correct
13 Correct 255 ms 10324 KB Output is correct
14 Correct 247 ms 10320 KB Output is correct
15 Correct 248 ms 10320 KB Output is correct
16 Correct 250 ms 10392 KB Output is correct
17 Correct 251 ms 10464 KB Output is correct
18 Correct 339 ms 10324 KB Output is correct
19 Correct 869 ms 133156 KB Output is correct
20 Correct 1018 ms 133116 KB Output is correct
21 Correct 486 ms 125704 KB Output is correct
22 Correct 488 ms 113896 KB Output is correct
23 Correct 331 ms 16764 KB Output is correct
24 Correct 330 ms 16464 KB Output is correct
25 Correct 507 ms 132968 KB Output is correct
26 Correct 538 ms 133116 KB Output is correct
27 Correct 631 ms 133120 KB Output is correct
28 Correct 644 ms 132988 KB Output is correct
29 Correct 608 ms 130048 KB Output is correct
30 Correct 381 ms 16724 KB Output is correct
31 Correct 623 ms 133128 KB Output is correct
32 Correct 588 ms 122052 KB Output is correct
33 Correct 339 ms 16464 KB Output is correct
34 Correct 621 ms 133124 KB Output is correct
35 Correct 463 ms 101720 KB Output is correct
36 Correct 331 ms 16468 KB Output is correct
37 Correct 336 ms 16464 KB Output is correct
38 Correct 895 ms 133120 KB Output is correct
39 Correct 366 ms 133116 KB Output is correct
40 Correct 490 ms 94192 KB Output is correct
41 Correct 1041 ms 136836 KB Output is correct
42 Correct 281 ms 136192 KB Output is correct

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 265 ms 10196 KB Output is correct
2 Correct 284 ms 10320 KB Output is correct
3 Correct 349 ms 10328 KB Output is correct
4 Correct 262 ms 10324 KB Output is correct
5 Correct 238 ms 10324 KB Output is correct
6 Correct 248 ms 10320 KB Output is correct
7 Correct 260 ms 10452 KB Output is correct
8 Correct 247 ms 10320 KB Output is correct
9 Correct 249 ms 10324 KB Output is correct
10 Correct 247 ms 10320 KB Output is correct
11 Correct 251 ms 10464 KB Output is correct
12 Correct 247 ms 10324 KB Output is correct
13 Correct 255 ms 10324 KB Output is correct
14 Correct 247 ms 10320 KB Output is correct
15 Correct 248 ms 10320 KB Output is correct
16 Correct 250 ms 10392 KB Output is correct
17 Correct 251 ms 10464 KB Output is correct
18 Correct 339 ms 10324 KB Output is correct
19 Correct 278 ms 10320 KB Output is correct
20 Correct 361 ms 10480 KB Output is correct
21 Incorrect 246 ms 10452 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #4
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 265 ms 10196 KB Output is correct
2 Correct 284 ms 10320 KB Output is correct
3 Correct 349 ms 10328 KB Output is correct
4 Correct 262 ms 10324 KB Output is correct
5 Correct 238 ms 10324 KB Output is correct
6 Correct 248 ms 10320 KB Output is correct
7 Correct 260 ms 10452 KB Output is correct
8 Correct 247 ms 10320 KB Output is correct
9 Correct 249 ms 10324 KB Output is correct
10 Correct 247 ms 10320 KB Output is correct
11 Correct 251 ms 10464 KB Output is correct
12 Correct 247 ms 10324 KB Output is correct
13 Correct 255 ms 10324 KB Output is correct
14 Correct 247 ms 10320 KB Output is correct
15 Correct 248 ms 10320 KB Output is correct
16 Correct 250 ms 10392 KB Output is correct
17 Correct 251 ms 10464 KB Output is correct
18 Correct 339 ms 10324 KB Output is correct
19 Correct 869 ms 133156 KB Output is correct
20 Correct 1018 ms 133116 KB Output is correct
21 Correct 486 ms 125704 KB Output is correct
22 Correct 488 ms 113896 KB Output is correct
23 Correct 331 ms 16764 KB Output is correct
24 Correct 330 ms 16464 KB Output is correct
25 Correct 507 ms 132968 KB Output is correct
26 Correct 538 ms 133116 KB Output is correct
27 Correct 631 ms 133120 KB Output is correct
28 Correct 644 ms 132988 KB Output is correct
29 Correct 608 ms 130048 KB Output is correct
30 Correct 381 ms 16724 KB Output is correct
31 Correct 623 ms 133128 KB Output is correct
32 Correct 588 ms 122052 KB Output is correct
33 Correct 339 ms 16464 KB Output is correct
34 Correct 621 ms 133124 KB Output is correct
35 Correct 463 ms 101720 KB Output is correct
36 Correct 331 ms 16468 KB Output is correct
37 Correct 336 ms 16464 KB Output is correct
38 Correct 895 ms 133120 KB Output is correct
39 Correct 366 ms 133116 KB Output is correct
40 Correct 490 ms 94192 KB Output is correct
41 Correct 1041 ms 136836 KB Output is correct
42 Correct 281 ms 136192 KB Output is correct
43 Correct 278 ms 10320 KB Output is correct
44 Correct 361 ms 10480 KB Output is correct
45 Incorrect 246 ms 10452 KB Output isn't correct
46 Halted 0 ms 0 KB -