This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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(){
cin >> n >> q >> a >> b;
vi differ;
for (int i = 0; i < n; i++){
int tmp = b[i] - a[i];
if (tmp < 0) tmp += 26;
differ.pb(tmp);
}
bool c = true;
for (int i = 0; i < n; i++){
if (differ[i] > differ[i+1]){
c = false;
break;
}
else {
differ[i+1] -= differ[i];
}
}
if (c) cout << "YES" << endl;
else cout << "NO" << endl;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |