제출 #1312730

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1312730		syanvu	Bliskost (COI23_bliskost)	C++20	100 / 100	106 ms	5396 KiB

Main

#pragma optimize ("g",on)
#pragma GCC optimize ("inline")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("03")
#include <bits/stdc++.h>

#define pb push_back
#define SS ios_base::sync_with_stdio(0);cin.tie(nullptr);cout.tie(nullptr);
// #define int long long
#define all(v) v.begin(),v.end()
using namespace std;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());

const int N = 1e5 + 1, inf = 1e9, mod = 998244353;

void solve(){
    int n, q;
    cin >> n >> q;
    string a, b;
    cin >> a >> b;
    a = '!' + a;
    b = '!' + b;
    int sum = 0;
    for(int i = 1; i <= n; i++){
        int dif = ((b[i] - 'a') - (a[i] - 'a' + sum));
        sum = dif;
        // cout << sum << ' ';
    }
    cout << (sum % 26 == 0 ? "da\n" : "ne\n");
    /*
    (x - y) - (x - y - p) = p

    (z - x - (x - y)) - (z - x - (x - y - p)) = -p
    */
    while(q--){
        int p;
        char x;
        cin >> p >> x;
        int dif = (a[p] - '0') - (x - '0');
        a[p] = x;
        sum += dif * ((n - p) % 2 == 1 ? -1 : 1);
        cout << (sum % 26 == 0 ? "da\n" : "ne\n");
    }
}

signed main(){
    SS
    // freopen("trains.in", "r", stdin);
    // freopen("trains.out", "w", stdout);

    int t = 1;
    // cin >> t;
    while(t--){
        solve();
    }
}

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