# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
550231 | 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 ga, gb;
void init(string a, string b){
ga = a; gb = b;
}
int get_distance(int x, int y){
if(x == y){
return (ga[x] == gb[x] ? 0 : -1);
} else if(y-x == 1){
if(ga[x] == gb[x] && ga[y] == gb[y]) return 0;
if(ga[y] == gb[x] && ga[x] == gb[y]) return 1;
else return -1;
}
return -1;
}