Submission #1019239

#	Time	Username	Problem	Language	Result	Execution time	Memory
1019239		MarwenElarbi	Bliskost (COI23_bliskost)	C++17	28 / 100	14 ms	8696 KiB

Main

#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define pb push_back
#define se second
#define fi first
#define optimise ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
const int nax=1e5+5;
int main() {
    optimise;
    int n,q;
    cin>>n>>q;
    string a,b;
    cin>>a>>b;
    int tab[n];
    multiset<int> st;
    for (int i = 0; i < n; ++i)
    {
        int cnt = (i ? tab[i-1] : 0);
        tab[i]=(b[i]-a[i]-cnt+26)%26;
    }
    cout << (tab[n-1]==0 ? "da" : "ne")<<endl;
    for (int i = 0; i < q; ++i)
    {
        int x;
        char y;
        cin>>x>>y;
        x--;
        a[i]=y;
        tab[i]=(-(i ? tab[i-1] : 0)+b[i]-a[i]+26)%26;
        for (int j = i+1; j < n; ++j)
        {
            tab[j]=(b[j]-a[j]-tab[j-1]+26)%26;
            //cout <<tab[j]<<" ";
        }//cout <<endl;
        cout << (tab[n-1]==0 ? "da" : "ne")<<endl;
    }
}

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