제출 #1137218

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1137218		Fikrat_Asadzadeh	Bliskost (COI23_bliskost)	C++20	100 / 100	91 ms	5852 KiB

Main

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

#define ll long long
#define FORI(i, n) for(ll i = 0; i < n; i++)
#define FOR(i, n) for(ll i = 1; i <= n; i++)
typedef vector < ll > vl; 
typedef set < ll > setl;
#define ff first
#define ss second    
#define all(v) v.begin(), v.end() 
#define pll pair<ll, ll> 
#define db double
#define nll cout << "\n"
#define nl "\n"
#define sync ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);

const ll mod =  1e9 + 7;
const int MAX = 3e5 + 5;
const int imax = 2147483647;
ll n, m, k, q, l, r, x, y, res, nd;
ll a[MAX], b[MAX], used[MAX];
// ll a, b, c;
void solve(){
    cin >> n >> q;
    string s, t;
    cin >> s >> t;
    ll sum = 0;
    FORI(i, n){
        sum = (t[i] - s[i] - sum + 26) % 26;
    }
    ll ind;
    char c;
    cout << (sum ? "ne" : "da") << nl;
    while(q--){
        cin >> ind >> c;
        ind--;
        ll dif = c - s[ind];
        s[ind] = c;
        sum = (sum + 26 - (((n - ind) & 1) ? dif : -dif)) % 26;
        if(sum)cout << "ne";
        else cout << "da";
        nll;
    }
}
signed main(){      
    // freopen("input.txt","r",stdin);
    // freopen("output.txt","w",stdout);
    sync;
    ll t = 1;
    // cin >> t;
    FOR(i, t){
    // cout << "Case #" << i << ": ";
        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