# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
998131 | MilosMilutinovic | Bliskost (COI23_bliskost) | C++14 | 181 ms | 16004 KiB |
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>
using namespace std;
const int N = 1e6 + 10;
int n, q;
char s[N], t[N];
int main() {
scanf("%d%d", &n, &q);
scanf("%s", s + 1);
scanf("%s", t + 1);
int d = 0;
for (int i = 1; i < n; i++)
d = (d + (t[i] - 'a') * (i % 2 == (n - 1) % 2 ? 1 : -1) + (s[i] - 'a') * (i % 2 == (n - 1) % 2 ? -1 : 1) + 52) % 26;
if (((((int) (s[n] + d) % 26) + 52) % 26) == ((int) t[n] % 26)) printf("da\n");
else printf("ne\n");
while (q--) {
int p;
char c;
scanf("%d %c", &p, &c);
if (p < n) d = (d - ((t[p] - 'a') * (p % 2 == (n - 1) % 2 ? 1 : -1) + (s[p] - 'a') * (p % 2 == (n - 1) % 2 ? -1 : 1)) + 52) % 26;
s[p] = c;
if (p < n) d = (d + (t[p] - 'a') * (p % 2 == (n - 1) % 2 ? 1 : -1) + (s[p] - 'a') * (p % 2 == (n - 1) % 2 ? -1 : 1) + 52) % 26;
if (((((int) (s[n] + d) % 26) + 52) % 26) == ((int) t[n] % 26)) printf("da\n");
else printf("ne\n");
}
}
Compilation message (stderr)
# | 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... |