제출 #1223257

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1223257		nicolo_010	Bliskost (COI23_bliskost)	C++20	57 / 100	1092 ms	4412 KiB

Main

#include <bits/stdc++.h>
using namespace std;
template <typename T>
using v = vector<T>;
#define rep(i, k, n) for (int i =k; i < n; i++)
using ll = long long;
using pii = pair<int, int>;

string check(string a, string b) {
    int n = a.size();
    rep(i, 0, n-1) {
        if (a[i] == b[i]) continue;
        int dif = b[i] - a[i];
        if (dif < 0) dif += 26;
        a[i] = (a[i]-'a'+dif) % 26 + 'a';
        a[i+1] = (a[i+1]-'a'+dif) % 26 + 'a';
    }
    bool can = true;
    //cout << a << " " << b << endl;
    rep(i, 0, n) {
        if (a[i] != b[i]) can = false;
    }
    return (can ? "da" : "ne");
}

int main() {
    int n, q; cin >> n >> q;
    string a, b; cin >> a >> b;
    cout << check(a, b) << "\n";
    while (q--) {
        int id; char c; cin >> id >> c;
        id--;
        a[id] = c;
        //cout << a << endl;
        cout << check(a, b) << "\n";
    }
    return 0;
}

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