제출 #1013277

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1013277		amine_aroua	Bliskost (COI23_bliskost)	C++17	100 / 100	160 ms	23876 KiB

Main

#include <bits/stdc++.h>
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
using namespace std;
#define int long long
#define nl '\n'
#define pb push_back

signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n , q;
    cin>>n>>q;
    string s , t;
    cin>>s>>t;
    s = '.' + s;
    t = '.' + t;
    vector<int> a(n);
    a[0] = 0;
    for(int i = 1 ; i <= n - 1 ; i++)
    {
        a[i] = (t[i] - s[i] - a[i - 1] + 2 * 26)%26;
    }
    if(a[n - 1] == (t[n] - s[n] + 26)%26)
        cout<<"da"<<nl;
    else
        cout<<"ne"<<nl;
    while(q--)
    {
        int i;
        char c;
        cin>>i>>c;
        int diff = (s[i] - c + 26)%26;
        s[i] = c;
        int j = n - 1;
        if(j >= i)
        {
            if((j - i)%2 == 0)
            {
                a[j] = (a[j] + diff)%26;
            }
            else
            {
                a[j] = (a[j] - diff + 26)%26;
            }
        }
        if(a[n - 1] == (t[n] - s[n] + 26)%26)
            cout<<"da"<<nl;
        else
            cout<<"ne"<<nl;
    }
}

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