# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1019241 | MarwenElarbi | Bliskost (COI23_bliskost) | C++17 | 2 ms | 604 KiB |
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;
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define pb push_back
#define se second
#define fi first
#define optimise ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
const int nax=1e5+5;
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
optimise;
int n,q;
cin>>n>>q;
string a,b;
cin>>a>>b;
int tab[n];
for (int i = 0; i < n; ++i)
{
int cnt = (i ? tab[i-1] : 0);
tab[i]=(b[i]-a[i]-cnt+26)%26;
}
cout << (tab[n-1]==0 ? "da" : "ne")<<endl;
for (int i = 0; i < q; ++i)
{
int x;
char y;
cin>>x>>y;
x--;
a[x]=y;
tab[x]=(-(i ? tab[x-1] : 0)+b[x]-a[x]+26)%26;
for (int j = x+1; j < n; ++j)
{
tab[j]=(b[j]-a[j]-tab[j-1]+26)%26;
//cout <<tab[j]<<" ";
}//cout <<endl;
cout << (tab[n-1]==0 ? "da" : "ne")<<endl;
}
}
Compilation message (stderr)
# | 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... |