#include <iostream>
#include <string>
#include <map>
#include "dna.h"
using namespace std;
string v1,v2;
map<pair<int,int>,int> frvv;
void init(string a,string b){
v1=a;v2=b;
}
int get_distance(int x,int y){
int cnt=0,i,auxcnt=0;int frv[3]={0,0,0},frv1[3]={0,0,0};
frvv.clear();
for(i=x;i<=y;i++){
if(v1[i]=='T') frv[0]++;
if(v2[i]=='T') frv1[0]++;
if(v1[i]=='A') frv[1]++;
if(v2[i]=='A') frv1[1]++;
if(v1[i]=='C') frv[2]++;
if(v2[i]=='C') frv1[2]++;
}
if(frv[0]!=frv1[0] || frv[1]!=frv1[1] || frv[2]!=frv1[2]) return -1;
for(i=x;i<=y;i++){
if(v1[i]!=v2[i] && !frvv[{v2[i],v1[i]}]){
cnt++;frvv[{v1[i],v2[i]}]++;
}else if(v1[i]!=v2[i]){
cnt--;frvv[{v2[i],v1[i]}]--;auxcnt++;
}
}
return max(cnt-1,0)+auxcnt;
}
