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 "dna.h"
#include "bits/stdc++.h"
using namespace std;
string a,b;
void init(std::string A, std::string B) {
a=A;
b=B;
}
int get_distance(int l, int r) {
vector<int>v(26);
for(int i=l;i<=r;i++){
v[a[i]-'A']++;
v[b[i]-'A']--;
}
for(int i=0;i<26;i++){
if(v[i]!=0)return -1;
}
if(l==r)return 0;
if(l+1==r)return 1-(a[l]==b[l]);
if(a[l]==b[l]&&a[l+1]==b[l+1])return 0;
if(a[l]==b[l]||a[l+1]==b[l+1]||a[l+2]==b[l+2])return 1;
return 2;
}
# | 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... |