Submission #1129670

#	Time	Username	Problem	Language	Result	Execution time	Memory
1129670		gyg	Bliskost (COI23_bliskost)	C++20	100 / 100	262 ms	19100 KiB

Main

#include <bits/stdc++.h>
using namespace std;
#define int long long 
#define arr array 
const int N = 1e6 + 6;

int n, q;
arr<int, N> a, b;

int md(int x) { return (x + 26) % 26; }
int fnl;
void prcmp() {
    for (int i = 1; i <= n; i++)
        fnl = (i % 2 == n % 2) ? md(fnl + a[i]) : md(fnl - a[i]);
    for (int i = 1; i < n; i++)
        fnl = (i % 2 == n % 2) ? md(fnl - b[i]) : md(fnl + b[i]);
}
void prnt() {
    // cout << fnl << endl;
    cout << ((fnl == b[n]) ? "da" : "ne") << '\n';  
}
void cmp() {
    prnt();
    for (int i = 1; i <= q; i++) {
        int j; char x; cin >> j >> x;
        int y = x - 'a';
        int df = md(y - a[j]);
        a[j] = y;
        fnl = (j % 2 == n % 2) ? md(fnl + df) : md(fnl - df);
        prnt();
    }
}

signed main() {
    // freopen("a.in", "r", stdin);
    cin.sync_with_stdio(false), cin.tie(0);
    cin >> n >> q;
    for (int i = 1; i <= n; i++) {
        char x; cin >> x;
        a[i] = x - 'a';
    }
    for (int i = 1; i <= n; i++) {
        char x; cin >> x;
        b[i] = x - 'a';
    }
    prcmp();
    cmp();
}

• Subtask 1: 7 / 7
• Subtask 2: 8 / 8
• Subtask 3: 13 / 13
• Subtask 4: 12 / 12
• Subtask 5: 17 / 17
• Subtask 6: 43 / 43