# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
550230 | rafatoa | Mutating DNA (IOI21_dna) | C++17 | 0 ms | 0 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;
#define int long long
int n;
string a, b;
void init(string al, string bl){
a = al; b = bl;
}
int get_distance(int x, int y){
if(x == y){
return (a[x] == b[x] ? 0 : -1);
} else if(y-x == 1){
if(a[x] == b[x] && a[y] == b[y]) return 0;
if(a[y] == b[x] && a[x] == b[y]) return 1;
else return -1;
}
return -1;
}