# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1112529 | vjudge1 | Bliskost (COI23_bliskost) | C++17 | 0 ms | 0 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>
#define int long long
#define pb push_back
#define a2b(a, b) (a << b) // a*2^b
#define bit(a, b) ((a >> b) & 1) // bth bit from the right, starts at zero
using namespace std;
template<class T> using vec = vector<T>;
const int INFTY = (1LL << 63) - 1;
const int NNFTY = 1LL << 63;
template<integral T, integral U> inline T mod(T a, U b) {
T r = a % b; if (r < 0) r += b; return r;
}
bool sim(string s1, string s2) {
int n = s1.size();
if (n != s2.size()) return false;
int lastdiff = 0;
for (int i = 0; i < n - 1; i++) {
lastdiff = mod(s1[i] - s2[i] - lastdiff, 26LL);
if (i == n - 2 && lastdiff != mod(s1[n - 1] - s2[n - 1], 26)) return false;
}
return true;
}
int32_t main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int n, q; cin >> n >> q;
string s1, s2; cin >> s1 >> s2;
cout << "ne\n\0da\n" + 4*sim(s1, s2);
while (q--) {
int i; char c; cin >> i >> c; i--;
s1[i] = c;
cout << "ne\n\0da\n" + 4*sim(s1, s2);
}
}