제출 #1320197

#제출 시각아이디문제언어결과실행 시간메모리
1320197eshanahmedBliskost (COI23_bliskost)C++20
0 / 100
0 ms332 KiB
// ﷽
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll  MOD=26;


void solve(){
     ll n,q;
     cin>>n>>q;
     string a,b;
     cin>>a>>b;
     for(auto i=0;i<=q;i++){
        ll ls=0;
        vector<ll> dif;
        for(auto i=0;i<n;i++){
            ll temp=b[i]-a[i];
            if(temp<0){
               dif.push_back(26-abs(temp));
            }
            else{
               dif.push_back(temp);;
            }
        }
        ll sum=0;
        for(auto i=0;i<n;i++){
           if(i%2==0){
               sum+=dif[i];
           }
           else{
               sum-=dif[i];
           }
        }
        cout<<(sum==0 ? "da":"ne")<<endl;
        if(i!=q){
           ll ind;char temp;cin>>ind>>temp;ind--;
           a[ind]=temp;
        }
     }

}
int main(){
   ll n=1;
   while(n--){
     solve();
   }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...