oj.uz

답안 #1055383

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1055383 2024-08-12T18:33:36 Z YassirSalama Crossing (JOI21_crossing) C++17
3 / 100
 1709 ms 126756 KB 
#include<bits/stdc++.h>
using namespace std;
map<char,__int128_t> mp;
#define all(v) v.begin(),v.end()
struct Hash {
    vector<__int128_t> v;
    __int128_t P,mod;
    const __int128_t maxn=2e5+100;
    __int128_t pref[(__int128_t)2e5+100];
    struct Node{
        __int128_t val;
        __int128_t lz;
        Node* left,*right;
        Node() : left(nullptr),right(nullptr){}
    };
    __int128_t f(__int128_t a){
        a%=mod;
        if(a<0) a+=mod;
        return a%=mod;
    }
    __int128_t sum(__int128_t l,__int128_t r){
        if(l==0) return pref[r];
        return f(pref[r]%mod-pref[l-1]%mod)%mod;
    }
    void push(Node* node,__int128_t l,__int128_t 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,__int128_t l,__int128_t r){
        push(node,l,r);
        __int128_t mid=(l+r)/2;
        if(l==r) return;
        push(node->left,l,mid);
        push(node->right,mid+1,r);
    }
    void build(Node* node,__int128_t l,__int128_t r,vector<__int128_t> &v){
        if(l==r){
            node->val=v[l];
            return;
        }
        __int128_t 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,__int128_t l,__int128_t r,__int128_t ql,__int128_t qr,__int128_t x){
        p(node,l,r);
        if(ql<=l&&r<=qr){
            node->lz=x;p(node,l,r);
            return;
        }
        __int128_t 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;
    }
    __int128_t query(Node* node,__int128_t l,__int128_t r,__int128_t ql,__int128_t qr){
        if(ql<=l&&r<=qr) return node->val%mod;
        __int128_t mid=(l+r)/2;
        __int128_t 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<__int128_t> hsh(string s){
        __int128_t n=s.length();
        __int128_t c=1;
        vector<__int128_t> v(n);
        for(__int128_t i=0;i<n;i++){
            __int128_t x=mp[s[i]];
            v[i]=(x*c%mod)%mod;
            c=(c*P%mod)%mod;
        }
        return v;
    }
    Node* root;
    void b(string s,__int128_t p,__int128_t MOD){
        P=p;
        mod=MOD;
        v=hsh(s);
        for(__int128_t i=0;i<maxn;i++){
            pref[i]=binpow(P,i);
            if(i){
                pref[i]=f(pref[i]+pref[i-1]%mod)%mod;
            }
        }
        root=new Node();
        __int128_t n=s.size();
        build(root,0,n-1,v);
    }
    __int128_t get(){
        return root->val;
    }
    __int128_t binpow(__int128_t a,__int128_t b){
        __int128_t res=1;
        while(b){
            if(b&1) {
                res=(res*a%mod)%mod;
            }
            a=(a*a%mod)%mod;
            b>>=1;
        }
        return res;
    }
};
int 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;
    Hash a1;a1.b(s,31,1e9+7);
    Hash b1;b1.b(t,31,1e9+7);
    Hash a2;a2.b(s,41,1e9+3);
    Hash b2;b2.b(t,41,1e9+3);

    puts((a1.get()==b1.get()&&a2.get()==b2.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())?"Yes":"No");
    }
}

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 312 ms 13496 KB Output is correct
2 Correct 365 ms 13504 KB Output is correct
3 Correct 459 ms 13488 KB Output is correct
4 Correct 265 ms 13396 KB Output is correct
5 Correct 290 ms 13392 KB Output is correct
6 Correct 265 ms 13492 KB Output is correct
7 Correct 258 ms 13484 KB Output is correct
8 Correct 289 ms 13396 KB Output is correct
9 Correct 267 ms 13392 KB Output is correct
10 Correct 274 ms 13504 KB Output is correct
11 Correct 279 ms 13488 KB Output is correct
12 Correct 267 ms 13396 KB Output is correct
13 Correct 280 ms 13484 KB Output is correct
14 Correct 273 ms 13396 KB Output is correct
15 Correct 270 ms 13484 KB Output is correct
16 Correct 286 ms 13492 KB Output is correct
17 Correct 281 ms 13396 KB Output is correct
18 Correct 473 ms 13396 KB Output is correct

Subtask #2
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 312 ms 13496 KB Output is correct
2 Correct 365 ms 13504 KB Output is correct
3 Correct 459 ms 13488 KB Output is correct
4 Correct 265 ms 13396 KB Output is correct
5 Correct 290 ms 13392 KB Output is correct
6 Correct 265 ms 13492 KB Output is correct
7 Correct 258 ms 13484 KB Output is correct
8 Correct 289 ms 13396 KB Output is correct
9 Correct 267 ms 13392 KB Output is correct
10 Correct 274 ms 13504 KB Output is correct
11 Correct 279 ms 13488 KB Output is correct
12 Correct 267 ms 13396 KB Output is correct
13 Correct 280 ms 13484 KB Output is correct
14 Correct 273 ms 13396 KB Output is correct
15 Correct 270 ms 13484 KB Output is correct
16 Correct 286 ms 13492 KB Output is correct
17 Correct 281 ms 13396 KB Output is correct
18 Correct 473 ms 13396 KB Output is correct
19 Correct 1692 ms 126724 KB Output is correct
20 Correct 1709 ms 126712 KB Output is correct
21 Correct 626 ms 119936 KB Output is correct
22 Correct 688 ms 109036 KB Output is correct
23 Correct 410 ms 19360 KB Output is correct
24 Correct 405 ms 19280 KB Output is correct
25 Correct 672 ms 126716 KB Output is correct
26 Correct 765 ms 126712 KB Output is correct
27 Correct 997 ms 126720 KB Output is correct
28 Correct 1022 ms 126712 KB Output is correct
29 Correct 926 ms 123796 KB Output is correct
30 Correct 510 ms 19368 KB Output is correct
31 Correct 987 ms 126716 KB Output is correct
32 Correct 903 ms 116676 KB Output is correct
33 Correct 429 ms 19024 KB Output is correct
34 Correct 979 ms 126652 KB Output is correct
35 Correct 572 ms 97760 KB Output is correct
36 Correct 401 ms 19284 KB Output is correct
37 Correct 415 ms 19280 KB Output is correct
38 Correct 1480 ms 126720 KB Output is correct
39 Incorrect 379 ms 126756 KB Output isn't correct
40 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 312 ms 13496 KB Output is correct
2 Correct 365 ms 13504 KB Output is correct
3 Correct 459 ms 13488 KB Output is correct
4 Correct 265 ms 13396 KB Output is correct
5 Correct 290 ms 13392 KB Output is correct
6 Correct 265 ms 13492 KB Output is correct
7 Correct 258 ms 13484 KB Output is correct
8 Correct 289 ms 13396 KB Output is correct
9 Correct 267 ms 13392 KB Output is correct
10 Correct 274 ms 13504 KB Output is correct
11 Correct 279 ms 13488 KB Output is correct
12 Correct 267 ms 13396 KB Output is correct
13 Correct 280 ms 13484 KB Output is correct
14 Correct 273 ms 13396 KB Output is correct
15 Correct 270 ms 13484 KB Output is correct
16 Correct 286 ms 13492 KB Output is correct
17 Correct 281 ms 13396 KB Output is correct
18 Correct 473 ms 13396 KB Output is correct
19 Correct 339 ms 13488 KB Output is correct
20 Correct 453 ms 13652 KB Output is correct
21 Incorrect 287 ms 13396 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #4
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 312 ms 13496 KB Output is correct
2 Correct 365 ms 13504 KB Output is correct
3 Correct 459 ms 13488 KB Output is correct
4 Correct 265 ms 13396 KB Output is correct
5 Correct 290 ms 13392 KB Output is correct
6 Correct 265 ms 13492 KB Output is correct
7 Correct 258 ms 13484 KB Output is correct
8 Correct 289 ms 13396 KB Output is correct
9 Correct 267 ms 13392 KB Output is correct
10 Correct 274 ms 13504 KB Output is correct
11 Correct 279 ms 13488 KB Output is correct
12 Correct 267 ms 13396 KB Output is correct
13 Correct 280 ms 13484 KB Output is correct
14 Correct 273 ms 13396 KB Output is correct
15 Correct 270 ms 13484 KB Output is correct
16 Correct 286 ms 13492 KB Output is correct
17 Correct 281 ms 13396 KB Output is correct
18 Correct 473 ms 13396 KB Output is correct
19 Correct 1692 ms 126724 KB Output is correct
20 Correct 1709 ms 126712 KB Output is correct
21 Correct 626 ms 119936 KB Output is correct
22 Correct 688 ms 109036 KB Output is correct
23 Correct 410 ms 19360 KB Output is correct
24 Correct 405 ms 19280 KB Output is correct
25 Correct 672 ms 126716 KB Output is correct
26 Correct 765 ms 126712 KB Output is correct
27 Correct 997 ms 126720 KB Output is correct
28 Correct 1022 ms 126712 KB Output is correct
29 Correct 926 ms 123796 KB Output is correct
30 Correct 510 ms 19368 KB Output is correct
31 Correct 987 ms 126716 KB Output is correct
32 Correct 903 ms 116676 KB Output is correct
33 Correct 429 ms 19024 KB Output is correct
34 Correct 979 ms 126652 KB Output is correct
35 Correct 572 ms 97760 KB Output is correct
36 Correct 401 ms 19284 KB Output is correct
37 Correct 415 ms 19280 KB Output is correct
38 Correct 1480 ms 126720 KB Output is correct
39 Incorrect 379 ms 126756 KB Output isn't correct
40 Halted 0 ms 0 KB -