# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
588330 | Xiaoyang | 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 "dna_ioi.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,a,b) for(int i=a;i<b;i++)
#define endl "\n"
string A,B;
void init(std::string a, std::string b) {
a=A;b=B;
}
int get_distance(int x, int y) {
string b=B;string a=A;
int n=A.size();
if(x==y){
if(a[x]==b[x])return 0;
else return -1;
}
if(y-x==1){
if(a[x]+a[y]==b[x]+b[y])return 0;
else if(a[y]+a[x]==b[x]+b[y])return 1;
else return -1;
}
if(y-x==2){
int aa,at,ac,ba,bt,bc;
rep(i,0,n){
if(a[i]=='A')aa++;
if(a[i]=='T')at++;
if(a[i]=='C')ac++;
if(b[i]=='A')ba++;
if(b[i]=='T')bt++;
if(b[i]=='C')bc++;
}
if(aa!=ba or at!=bt or ac!=bc)return -1;
if(a[x]+a[x+1]+a[x+2]==b[x]+b[x+1]+b[x+2])return 0;
if(a[x]==b[x] or a[x+1]==b[x+1]or a[x+2]==b[x+2])return 1;
else return 2;
}
}