제출 #1167338

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

Main

#include <bits/stdc++.h>
using namespace std;
 
#define int long long 
#define ld long double
#define show(x,y) cout << y << " " << #x << endl;
#define show2(x,y,i,j) cout << y << " " << #x << "  " << j << " " << #i << endl;
#define show3(x,y,i,j,p,q) cout << y << " " << #x << "  " << j << " " << #i << "  " << q << " " << #p << endl;
#define show4(x,y) for(auto it:y) cout << it << " "; cout << #x << endl;
typedef pair<int,int>pii;
typedef pair<int,pii>pi2;
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());

void solve(){
	int n,q;
	cin >> n >> q;
	
	string s;
	cin >> s;
	
	string s2;
	cin >> s2;
	
	int counter=0;
	int diff;
	for(int x=0;x<n;x++){
		//final - initial
		int a=s2[x]-'a';
		int b=s[x]-'a';
		int sgn=1;
		if(x%2!=n%2) sgn=-1;
		if(x<n-1)counter+=(a-b)*sgn;
		else diff=a-b;
	}
	
	if(counter%26==diff%26) cout << "da\n";
	else cout << "ne\n";
	
	int temp;
	char temp2;
	for(int x=0;x<q;x++){
		cin >> temp >> temp2;
		temp--;
		int sgn=1;
		if(temp%2!=n%2) sgn=-1;
		int a=s2[temp]-'a';
		int b=s[temp]-'a';
		if(temp<n-1){
			counter-=(a-b)*sgn;
			s[temp]=temp2;
			int b=s[temp]-'a';
			counter+=(a-b)*sgn;
		}
		else{
			s[temp]=temp2;
			int b=s[temp]-'a';
			diff=a-b;
		}
		
		if(counter%26==diff%26) cout << "da\n";
		else cout << "ne\n";
	}
	
	
}

int32_t main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	//freopen("in.txt","r",stdin);
	//freopen("in.txt","w",stdout);
	int t=1;
	//cin >> t;	
	while(t--){
		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