Submission #1041355

#	Time	Username	Problem	Language	Result	Execution time	Memory
1041355		elotelo966	Bliskost (COI23_bliskost)	C++17	100 / 100	126 ms	25884 KiB

Main

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
 
#define int long long
#define OYY LLONG_MAX
#define mod 998244353
#define faster ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define FOR for(int i=1;i<=n;i++)
#define mid (start+end)/2
#define lim 1000005
#define fi first
#define se second

int dizi[lim];

int pre[lim]; // gereksiz

int32_t main(){
	faster
	int n,q;cin>>n>>q;
	string a,b;cin>>a>>b;
	int bir=0,iki=0;
	FOR{
		dizi[i]=b[i-1]-a[i-1];
		if(i&1)bir+=dizi[i];
		else iki+=dizi[i];
		bir+=26;
		iki+=26;
		bir%=26;
		iki%=26;
	}
	
	if(bir==iki){
		cout<<"da"<<'\n';
	}
	else cout<<"ne"<<'\n';
	
	while(q--){
		int pos;char c;
		cin>>pos>>c;
		a[pos-1]=c;
		if(pos&1){
			bir-=dizi[pos];
			bir=(bir+26)%26;
			dizi[pos]=b[pos-1]-a[pos-1];
			bir+=dizi[pos]+26;
			bir=bir%26;
		}
		else{
			iki-=dizi[pos];
			iki=(iki+26)%26;
			dizi[pos]=b[pos-1]-a[pos-1];
			iki+=dizi[pos]+26;
			iki=(iki%26);
		}
		if(bir==iki){
			cout<<"da"<<'\n';
		}
		else cout<<"ne"<<'\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: 43 / 43