제출 #1128936

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1128936		ivaziva	Bliskost (COI23_bliskost)	C++20	0 / 100	0 ms	324 KiB

Main

#include <bits/stdc++.h>

using namespace std;

#define MAXN 1000001

int n,q;
string s1,s2;

int main()
{
    cin>>n>>q;cin>>s1>>s2;int sum=0;
    for (int i=0;i<n;i++)
    {
        int val=s2[i]-s1[i];sum+=val;
        if (val<0) sum+='z'-'a'+1;
    }
    if (sum%2==0) cout<<"da"<<endl;
    else cout<<"ne"<<endl;
    for (int z=0;z<q;z++)
    {
        int p;cin>>p;char c;cin>>c;
        int val1=s2[p-1]-s1[p-1];
        if (val1<0) val1+='z'-'a'+1;
        int val2=s2[p-1]-c;
        if (val2<0) val2+='z'-'a'+1;
        sum+=val2-val1;s1[p-1]=c;
        if (sum%2==0) cout<<"da"<<endl;
        else cout<<"ne"<<endl;
    }
}

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