#include <bits/stdc++.h>
#define int long long
using namespace std;
const long long N = 2e5 + 5;
int a[N];
void solve()
{
int n, q;
string s, t;
cin >> n >> q >> s >> t;
int sum = 0;
for (int i = 0; i < n; i++)
{
sum += s[i] - t[i] + 26;
}
cout << ((sum % 2 == 0) ? "da" : "ne") << endl;
int k;
char c;
for (int i = 0; i < q; i++)
{
cin >> k >> c;
k--;
sum -= s[k] - t[k];
sum += 26;
s[k] = c;
sum += s[k] - t[k];
sum += 26;
cout << ((sum % 2 == 0) ? "da" : "ne") << endl;
}
}
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
int t = 1;
// cin >> t;
for (int i = 1; i <= t; i++)
{
// cout << "Case #" << i << ':' << ' ';
solve();
cout << endl;
}
return 0;
}
| # | 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... |