Submission #997795

#	Time	Username	Problem	Language	Result	Execution time	Memory
997795		Nakerah	Bliskost (COI23_bliskost)	C++17	28 / 100	17 ms	3908 KiB

Main

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define PB push_back
#define sz(x) (int)x.size()
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define F first
#define S second
#define PB push_back
 
// void setIO(string s) {
	// freopen((s + ".in").c_str(), "r", stdin);
	// freopen((s + ".out").c_str(), "w", stdout);
// }

void solve(){
	int n, q; cin >> n >> q;
	string a, b; cin >> a >> b;
	string t = a;
	for(int i = n-1; i > 0; i--){
		if(a[i] <= b[i]){
			int d = b[i]-a[i];
			a[i] = b[i];
			a[i-1] = char( ((a[i-1] -'a'+d)%26)  + 'a');
		}else{
			int d = a[i]-b[i];
			b[i] = a[i];
			b[i-1] = char( ((b[i-1] -'a'+d)%26)  + 'a');
		}
	}
	cout << (a==b?"da":"ne") << '\n';
	while(q--){
		a = t;
		int p; cin >> p;
		p--;
		char c; cin >> c;
		a[p] = c;
		for(int i = n-1; i > 0; i--){
			if(a[i] <= b[i]){
				int d = b[i]-a[i];
				a[i] = b[i];
				a[i-1] = char( ((a[i-1] -'a'+d)%26)  + 'a');
			}else{
				int d = a[i]-b[i];
				b[i] = a[i];
				b[i-1] = char( ((b[i-1] -'a'+d)%26)  + 'a');
			}
		}
		cout << (a==b?"da":"ne") << '\n';
	}
}
 
int main(){
	ios_base::sync_with_stdio(false), cout.tie(NULL), cin.tie(NULL);
	// setIO("");
	int testcase = 1;
	// cin >> testcase;
	for(int i = 1; i <= testcase; i++){
		// cout << "Case " << i << ": ";
		solve();
	}
} 	 		   			  	

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