Submission #1284207

#	Time	Username	Problem	Language	Result	Execution time	Memory
1284207		m.zeeshanrashid	Bliskost (COI23_bliskost)	C++20	57 / 100	1000 ms	5652 KiB

Main

#ifdef __AVX2__
#pragma GCC target "avx2"
#endif
#pragma GCC optimize "O3"
#pragma GCC optimize "unroll-loops"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp> 
using namespace __gnu_pbds; 
using namespace std;
#define int long long
#define elif else if
#define all(l) begin(l),end(l)
#define rall(l) rbegin(l),rend(l)
#define append push_back
#define print(l) for(auto i:l) cout<<i<<' '; cout<<endl;
#define pprint(a,b) cout<<a<<' '<<b<<endl;
#define inp(l) for(auto &i:l) cin>>i;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define pai make_pair
// #define endl "\n"
#define pii pair<int,int>
#define fi first
#define se second
#define vec vector

// const int mod=998244353;
const int mod1=998244353;
const int mod=1e9+7;
const int N=2e5+5;

int qu(vec<int>a){
	cout<<a.size()<<' ';
	print(a);
	int x;
	cin>>x;
	return x;
	// vec<int>ans={1,2,1,3,2};
	// set<int>s;
	// for(auto i:a) s.insert(ans[i-1]);
	// return s.size();
}

int iter=1,itera=1;
void solve(){
	int n,q;
	cin>>n>>q;
	string a,b;
	cin>>a>>b;
	int s=0;
	for(int i=0;i<n-1;i++){
		if((n-i)%2) s=(s-b[i]+a[i]+26)%26;
		else s=(s+b[i]-a[i]+26)%26;
	}
	int g=(b[n-1]-a[n-1]+26)%26;
	if(s==g) cout<<"da\n";
	else cout<<"ne\n";
	for(int i=1;i<=q;i++){
		int ind;
		char c;
		cin>>ind;
		cin>>c;
		ind--;
		if(ind==n-1){
			a[n-1]=c;
			g=(b[n-1]-a[n-1]+26)%26;
		}
		else{
			if((n-ind)%2){
				s-=-b[ind]+a[ind];
				a[ind]=c;
				s+=-b[ind]+a[ind];
			}
			else{
				s-=b[ind]-a[ind];
				a[ind]=c;
				s+=b[ind]-a[ind];
			}
			s=(s+52)%26;
		}
		if(s==g) cout<<"da\n";
		else cout<<"ne\n";
	}
}
signed main(){
	// freopen("","r",stdin);
	// freopen("","w",stdout);
	// ios_base::sync_with_stdio(false);
	// cin.tie(NULL); 
	// cout.tie(NULL);
	cout<<fixed<<setprecision(20);
	// cin>>itera;
	for(iter=1;iter<=itera;iter++) solve();
}

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