제출 #948087

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
948087		Abito	Bliskost (COI23_bliskost)	C++17	28 / 100	24 ms	10196 KiB

Main

#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define ppb pop_back
#define ep insert
#define endl '\n'
#define elif else if
#define pow pwr
#define sqrt sqrtt
#define int long long
#define ll long long
typedef unsigned long long ull;
using namespace std;
const int N=1e6+5;
int n,q,a[N];
char s[N],z[N];
int32_t main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
    cin>>n>>q;
    for (int i=1;i<=n;i++) cin>>s[i];
    for (int i=1;i<=n;i++) cin>>z[i];
    for (int i=1;i<=n;i++) a[i]=((z[i]-'a')-(s[i]-'a')+26)%26;
    int p=0;
    for (int i=1;i<n;i++) p=26-a[i]-p;
    p+=26*1e10;
    p%=26;
    for (int Q=0;Q<=q;Q++){
        if (Q){
            int i;char c;
            cin>>i>>c;
            s[i]=c;
            int x=a[i];
            a[i]=((z[i]-'a')-(s[i]-'a')+26)%26;
            p=(p+(a[i]-x+26)%26)%26;
        }
        //cout<<p<<endl;
        if ((p+a[n])%26) cout<<"ne"<<endl;
        else cout<<"da"<<endl;
    }
    return 0;
}

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