Submission #1208909

#	Time	Username	Problem	Language	Result	Execution time	Memory
1208909		ezzzay	Bliskost (COI23_bliskost)	C++20	57 / 100	1071 ms	13376 KiB

Main

#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define int long long
const int N=2e6+5;
const int P=1e9+7;
int bit[N];
void update(int idx, int val){
    while(idx<N){
        bit[idx]+=val;
        idx+= idx & -idx;
    }
}
int find(int idx){
    int s=0;
    while(idx>0){
        s+=bit[idx];
        idx-= idx & -idx;
    }
    return s;
}
signed main(){
    int n,q;
    cin>>n>>q;
    string s,t;
    cin>>s>>t;
    for(int i=1;i<=n;i++){
        int c= (t[i-1]-s[i-1]+26)%26;
        if(n%2== i%2){
            update(i,c);
        }
        else{
            update(i,-c);
        }
    }
    if((find(n-1)%26+260+(t[n-1]-s[n-1]+26)%26)%26==0){
        cout<<"da"<<endl;
    }
    else{
        cout<<"ne"<<endl;;
    }
    
    while(q--){
        int i;
        char p;
        cin>>i>>p;
        int c= (t[i-1]-s[i-1]+26)%26;
        if(n%2== i%2){
            update(i,-c);
        }
        else{
            update(i,+c);
        }
        
        s[i-1]=p;

         c= (t[i-1]-s[i-1]+26)%26;
        if(n%2== i%2){
            update(i,c);
        }
        else{
            update(i,-c);
        }
        if((find(n-1)%26+260+(t[n-1]-s[n-1]+26)%26)%26==0){
            cout<<"da"<<endl;
        }
        else{
            cout<<"ne"<<endl;;
        }
    }
    
}

• Subtask 1: 7 / 7
• Subtask 2: 8 / 8
• Subtask 3: 13 / 13
• Subtask 4: 12 / 12
• Subtask 5: 17 / 17
• Subtask 6: 0 / 43