이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<ll, ll>
#define pii pair<int, int>
#define fs first
#define sc second
#define pb push_back
void solve(){
int n,q;
cin>>n>>q;
string s1,s2;
cin>>s1>>s2;
int s=0;
for(int i=0;i<n;i++){
if(i%2)s+=s1[i]-s2[i];
else s+=s2[i]-s1[i];
}
if(s%26)cout<<"ne\n";
else cout<<"da\n";
while(q--){
int x;
char c;
cin>>x>>c;
x--;
if(x%2)s-=s1[x]-s2[x];
else s-=s2[x]-s1[x];
s1[x]=c;
if(x%2)s+=s1[x]-s2[x];
else s+=s2[x]-s1[x];
if(s%26)cout<<"ne\n";
else cout<<"da\n";
}
}
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
solve();
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |