This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
namespace MX {
constexpr int A = 26;
}
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int N, Q;
std::cin >> N >> Q;
std::string A;
std::cin >> A;
std::string B;
std::cin >> B;
int odd = 0, eve = 0;
auto clean = [&]() {
odd += MX::A;
odd %= MX::A;
eve += MX::A;
eve %= MX::A;
};
for (int i = 0; i < N; i++) {
(i % 2 ? odd : eve) += (B[i] - A[i] + MX::A) % MX::A;
clean();
}
std::cout << (odd == eve ? "da" : "ne") << "\n";
for (int q = 0; q < Q; q++) {
int p;
char c;
std::cin >> p >> c;
p--;
(p % 2 ? odd : eve) -= (B[p] - A[p]);
A[p] = c;
(p % 2 ? odd : eve) += (B[p] - A[p]);
clean();
std::cout << (odd == eve ? "da" : "ne") << "\n";
}
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... |