제출 #1167340

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1167340		mertbbm	Bliskost (COI23_bliskost)	C++20	28 / 100	10 ms	2792 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,s2;
	cin >> s >> s2;
	
	int counter=0;
	int lst=0;
	for(int x=0;x<n-1;x++){
		int a=s2[x]-'a';
		int b=s[x]-'a';
		b=(b+lst)%26;
		counter+=(a-b+26)%26;
		lst=(a-b+26)%26;
		counter%=26;
	}
	
	int a=s2[n-1]-'a';
	int b=s[n-1]-'a';
	a=(a-b+26)%26;
	
	if(lst%26==a){
		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: 7 / 7
• Subtask 2: 8 / 8
• Subtask 3: 13 / 13
• Subtask 4: 0 / 12
• Subtask 5: 0 / 17
• Subtask 6: 0 / 43