# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1128959 | ivaziva | Bliskost (COI23_bliskost) | C++20 | 1096 ms | 12488 KiB |
#include <bits/stdc++.h>
using namespace std;
#define MAXN 1000001
int n,q;
string s1,s2;
int x[MAXN],y[MAXN];
int main()
{
cin>>n>>q;cin>>s1>>s2;
for (int i=1;i<=n;i++)
{
y[i]=s2[i-1]-s1[i-1];
if (y[i]<0) y[i]+='z'-'a'+1;
}
x[1]=y[1];
for (int i=2;i<n;i++)
{
x[i]=y[i]-x[i-1];
if (x[i]<0) x[i]+='z'-'a'+1;
}
if (x[n-1]==y[n]) cout<<"da"<<endl;
else cout<<"ne"<<endl;
for (int z=0;z<q;z++)
{
int pos;cin>>pos;char c;cin>>c;
if (pos==n)
# | 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... |