# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1128971 | ivaziva | Bliskost (COI23_bliskost) | C++20 | 1097 ms | 13244 KiB |
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("fast-math")
#pragma GCC target("tune=native")
#include <bits/stdc++.h>
using namespace std;
#define MAXN 1000001
int n,q;
string s1,s2;
int x[MAXN],y[MAXN];
int main()
{
ios_base::sync_with_stdio(false);
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
cin>>n>>q;cin>>s1>>s2;
y[1]=s2[0]-s1[0];
if (y[1]<0) y[1]+=26;
x[1]=y[1];
for (int i=2;i<=n;i++)
{
y[i]=(s2[i-1]-s1[i-1]+26)%26;
x[i]=(y[i]-x[i-1]+26)%26;
}
if (x[n-1]==y[n]) cout<<"da"<<endl;
else cout<<"ne"<<endl;
# | 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... |