제출 #1112524

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1112524		vjudge1	Bliskost (COI23_bliskost)	C++17	0 / 100	1 ms	336 KiB

Main

#include <bits/stdc++.h>
using namespace std;

#define int long long
#define pb push_back
#define F first
#define S second
#define all(v) v.begin(),v.end()


typedef pair<int,int> ii;
typedef pair<int,ii> iii;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<ii> vii;
typedef set<int> si;
typedef map<int,int> mii;
const int INF = 2e5 + 100;

int n,q;
string a,b;



int32_t main(){
//	freopen("input.txt","r",stdin);
//	freopen("output.txt","w",stdout);
		
	cin >> n >> q >> a >> b;
	vi differ;
	for (int i = 0; i < n; i++){
		int step = 0;
		char x = a[i];
		while (x != b[i]){
			step++; x++;
			if (x > 'z') x = 'a';
		}
	//	int tmp = b[i] - a[i];
	//	if (tmp < 0) tmp += 26;
		differ.pb(min(step,26 - step));
		//cout << step << " ";
	}

	bool c = true;
	for (int i = 0; i < n-1; i++){
		if (differ[i] > differ[i+1]){
			c = false;
			break;
		}
		else {
			differ[i+1] -= differ[i];
			differ[i] = 0;
		}
	}

	if (c && differ[n-1] == 0) cout << "da" << endl;
	else cout << "ne" << endl;
	
	return 0;
}	

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