제출 #950669

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
950669		vin	Bliskost (COI23_bliskost)	C++14	15 / 100	5 ms	4852 KiB

Main

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

#define pb push_back
#define mp make_pair
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>

const int INF = 2147483645;
const int maxN = (int)1e3+5;
const ll LLINF = LLONG_MAX;
//const ll mod = 998244353;
const ll mod = 1000000007;

void solv() {
	int n, q;
	cin>>n>>q;
	string a, b;
	cin>>a>>b;
	n = min(n, 1000);
	int carry = 0;
	for (int i=0;i<n;i++) a[i] -= 'a', b[i] -= 'a';
	for (int i=n-1;i>=0;i--) {
		a[i] = (a[i] + carry)%26;
		if (a[i] > b[i]) carry = 26-a[i]+b[i];
		else carry = b[i]-a[i];
	}
	if (a[0] == b[0]) cout<<"da\n";
	else cout<<"ne\n";
}

int main() {
    ios::sync_with_stdio(0); cin.tie(0);
    int t=1;
//    cin>>t;
    while (t--) solv();
}

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