Submission #1143835

#	Time	Username	Problem	Language	Result	Execution time	Memory
1143835		Noproblem29	Crossing (JOI21_crossing)	C++20	100 / 100	198 ms	20816 KiB

Main

#include<bits/stdc++.h>
using namespace std;
#ifndef BADGNU
#pragma GCC target("sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#endif
#pragma GCC optimize("Ofast,unroll-loops,fast-math,O3")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp> 
using namespace __gnu_pbds;
#define ll long long
#define int ll
#define ld long double
#define y1 cheza
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<class T> using ordered_set = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
template<class T> using ordered_multiset = tree<T,null_type,less_equal<T>,rb_tree_tag,tree_order_statistics_node_update>;
const int N=2e5+100;
const int M=5001;
const int B=447;
const int mod=998244353;
const ll INF=1e18;
const int dx[]={1,-1,0,0};
const int dy[]={0,0,1,-1};
const char pidr[]={'X','J','O','I'};
const double eps=1e-6;
string operator^(const string&x,const string&y){
    string res=x;
    for(int i=0;i<res.size();i++){
        if(res[i]==y[i])continue;
        res[i]^=y[i];
    }
    return res;
}
int which(char x){
    if(x=='J')return 1;
    if(x=='O')return 2;
    if(x=='I')return 3;
    return 0;
}
void compess(string&x){
    for(auto &i:x){
        i=which(i);
    }   
}
int n;
string s[3];
int q;
string t0;
int t[N*4];
int add[N*4];
int pw[N];
int pref[N];
void build(int v,int tl,int tr){
    add[v]=-1;
    if(tl==tr){
        t[v]=(pw[tl]*t0[tl-1])%mod;
        return;
    }
    int mid=(tl+tr)>>1ll;
    build(v*2,tl,mid);
    build(v*2+1,mid+1,tr);
    t[v]=(t[v*2]+t[v*2+1])%mod;
}
void push(int v,int tl,int tr){
    if(add[v]==-1)return;
    if(tl!=tr){
        add[v*2]=add[v];
        add[v*2+1]=add[v];
    }
    t[v]=(pref[tr]-pref[tl-1]+2*mod)%mod;
    t[v]=(t[v]*add[v])%mod;
    add[v]=-1;
}
void upd(int v,int tl,int tr,int l,int r,int x){
    push(v,tl,tr);
    if(tl>r||tr<l)return;
    if(l<=tl&&tr<=r){
        add[v]=x;
        push(v,tl,tr);
        return;
    }
    int mid=(tl+tr)>>1ll;
    upd(v*2,tl,mid,l,r,x);
    upd(v*2+1,mid+1,tr,l,r,x);
    t[v]=(t[v*2]+t[v*2+1])%mod;
}
vector<int>st;
bool exun(int x){
    for(auto i:st){
        if(i==x)return 1;
    }
    return 0;
}
void test(){
    cin>>n;
    vector<string>v;
    for(int i=0;i<=2;i++){
        cin>>s[i];
        compess(s[i]);
        v.push_back(s[i]);
    }
    while(1ll){
        int cur=v.size();
        for(int i=0;i<cur;i++){
            for(int j=i+1;j<cur;j++){
                v.push_back(v[i]^v[j]);
            }
        }
        sort(v.begin(),v.end());
        v.resize(unique(v.begin(),v.end())-v.begin());
        if(v.size()==cur)break;
    }
    
    for(auto a:v){
        int cur=0;
        for(int j=0;j<n;j++){
            cur=(cur+pw[j+1]*a[j])%mod;
        }
        st.push_back(cur);
    }
    sort(st.begin(),st.end());
    cin>>q;
    cin>>t0;
    compess(t0);
    build(1,1,n);
    cout<<(exun(t[1])?"Yes":"No")<<'\n';
    for(int l,r;q--;){
        char c;
        cin>>l>>r>>c;
        c=which(c);
        upd(1,1,n,l,r,c);
        cout<<(exun(t[1])?"Yes":"No")<<'\n';
    }
}



/*

*/
signed main(){
    pw[0]=1;
    pw[1]=148826;
    for(int j=2;j<=2e5;j++){
        pw[j]=(pw[j-1]*pw[1])%mod;
    }
    for(int j=1;j<=2e5;j++){
        pref[j]=(pref[j-1]+pw[j])%mod;
    }
    
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    // cout.tie(nullptr);
    int t2=1;
    // cin>>t2;
    for(int i=1;i<=t2;i++){
        test();
    }
}

• Subtask 1: 3 / 3
• Subtask 2: 23 / 23
• Subtask 3: 23 / 23
• Subtask 4: 51 / 51