Submission #919770

#	Time	Username	Problem	Language	Result	Execution time	Memory
919770		ErJ	Bliskost (COI23_bliskost)	C++17	100 / 100	130 ms	16588 KiB

Main

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define vi vector<ll>
#define vvi vector<vector<ll>>
#define vs vector<string>
#define vc vector<char>
#define vb vector<bool>
#define vp vector<pair<ll, ll>>
#define pp pair<ll, ll>
#define qi queue<ll>
#define qp queue<pp>
#define pqi priority_queue<ll>
#define pqp priority_queue<pp>
#define mi map<ll, ll>
#define mpi map<pp, ll>
#define mip map<ll, pp>
#define mpp map<pp, pp>
#define mb map<ll, bool>
#define si set<ll>
#define sp set<pp>
#define mod 1000000007
#define rep(a, b) for(int a = 0; a < (b); a++)
#define inf 1000000000000000000

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int n, q;
    cin >> n >> q;
    string s1, s2;
    cin >> s1 >> s2;
    ll odd = 0;
    ll even = 0;
    for (int i = 0; i < n; i++) {
        if (i % 2 == 0) {
            even += s1[i] - s2[i];
        }
        else {
            odd += s1[i] - s2[i];
        }
    }
    if ((even - odd) % 26 == 0) {
        cout << "da\n";
    }
    else {
        cout << "ne\n";
    }
    while (q--) {
        int a;
        char ch;
        cin >> a >> ch;
        a--;
        if (a % 2 == 0) {
            even -= s1[a] - s2[a];
            s1[a] = ch;
            even += s1[a] - s2[a];
        }
        else {
            odd -= s1[a] - s2[a];
            s1[a] = ch;
            odd += s1[a] - s2[a];
        }

        if ((even - odd) % 26 == 0) {
            cout << "da\n";
        }
        else {
            cout << "ne\n";
        }
    }
}

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