제출 #1277052

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1277052		dosts	Bliskost (COI23_bliskost)	C++20	0 / 100	0 ms	332 KiB

Main

#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
#define int long long
#define pii pair<int,int>
#define vi vector<int>
#define ff first
#define ss second
#define sp << " " <<
#define all(x) x.begin(),x.end()
#define big(x) ((int)(x.size()))
using namespace std;
const int MOD = 1e9+7, LIM = 1e6+1, inf = 2e9;

const int N = 1e5+1;

void solve() {
    int n,q;
    cin >> n >> q;
    string s,t;
    cin >> s >> t;
    auto eval =[&]() -> bool {
        int sm1 = 0,sm2 = 0;
        for (int i = 0;i<n;i+=2) sm1+=s[i];
        for (int i = 1;i<n;i+=2) sm1-=s[i]; 
        sm1+=20000000000;
        for (int i = 0;i<n;i+=2) sm2+=t[i];
        for (int i = 1;i<n;i+=2) sm2-=t[i]; 
        sm2+=20000000000;
        return sm1 == sm2;
    };
    cout << (eval()?"da\n":"ne\n");
    while (q--) {
        int p;
        char c;
        cin >> p >> c;
        s[p-1] = c;
        cout << (eval()?"da\n":"ne\n");  
    }
} 

signed main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    #ifdef Dodi
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
    #endif
    int t = 1;
    //cin >> t;
    while (t --> 0) solve();
}

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