Submission #835388

#	Time	Username	Problem	Language	Result	Execution time	Memory
835388		MetalPower	Bliskost (COI23_bliskost)	C++14	28 / 100	7 ms	2800 KiB

Main

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

const int MX = 1e6 + 10;

int N, Q;
string s, t;

struct segtree{
	int st[MX << 1];

	void upd(int p, int v){
		for(p += MX, st[p] += v, p >>= 1; p > 0; p >>= 1) st[p] = st[p << 1] + st[p << 1|1];
	}

	int que(int l, int r){
		int res = 0;
		for(l += MX, r += MX + 1; l < r; l >>= 1, r >>= 1){
			if(l & 1) res += st[l++];
			if(r & 1) res += st[--r];
		}
		return res;
	}
} S;

int main(){
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

	cin >> N >> Q >> s >> t;

	if(Q == 0){
		int pre = 0;
		for(int i = 0; i < N; i++){
			int x = ((int) t[i] - (int) s[i] + 26) % 26;
			pre = (x - pre + 26) % 26;
		}
		if(pre == 0) cout << "da\n";
		else cout << "ne\n";
	}else{
		for(int i = N - 1; i >= 0; i--){
			int x = ((int) t[i] - (int) s[i] + 26) % 26;
			if((N - 1 - i) & 1) S.upd(i, -x);
			else S.upd(i, x);
		}
		if(S.que(0, N - 1) % 26 == 0) cout << "da\n";
		else cout << "ne\n";
		for(int i = 0; i < Q; i++){
			int p; char c; cin >> p >> c;
			int dif = ((int) c - (int) s[i] + 26) % 26;
			if((N - p - 1) & 1) S.upd(p, -dif);
			else S.upd(p, dif);
			s[i] = c;
			if(S.que(0, N - 1) % 26 == 0) cout << "da\n";
			else cout << "ne\n";
		}
	}
}

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