제출 #919761

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
919761		ErJ	Bliskost (COI23_bliskost)	C++17	57 / 100	1048 ms	12452 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()
{
    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 += (int) s1[i] - (int) s2[i];
        }
        else {
            odd += (int)s1[i] - (int)s2[i];
        }
    }
    if ((even - odd) % 26 == 0) {
        cout << "da" << endl;
    }
    else {
        cout << "ne" << endl;
    }
    while (q--) {
        int a;
        char ch;
        cin >> a >> ch;
        a--;
        if (a % 2 == 0) {
            even -= ((int)s1[a] - (int)s2[a]);
            s1[a] = ch;
            even += ((int)s1[a] - (int)s2[a]);
        }
        else {
            odd -= ((int)s1[a] - (int)s2[a]);
            s1[a] = ch;
            odd += ((int)s1[a] - (int)s2[a]);
        }

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

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