# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1142004 | mouataz_moi | Mutating DNA (IOI21_dna) | C++20 | 0 ms | 0 KiB |
#include "dna.h"
#include<bits/stdc++.h>
using namespace std;
string a;
string b;
void init(string n, string m) {
a = n;
b = m;
}
int get_distance(int x, int y) {
string b1;
string b2;
int ans = 0;
int c_count = 0;
int t_count = 0;
int a_count = 0;
int t_count2 = 0;
int a_count2 = 0;
int c_count2 = 0;
a1 = a.substr(x,y-x);
b2 = b.substr(x,y-x);
for(int i = 0;i < a1.length();i++){
if(a1[i] == 'T'){
t_count++;
}
if(a1[i] == 'A'){
a_count++;
}
if(b2[i] == 'T'){
t_count2++;
}
if(b2[i] == 'A'){
a_count2++;
}
if(a1[i] == 'C'){
c_count++;
}
if(b2[i] == 'C'){
c_count2++;
}
if(a1[i] != b2[i]){
ans++;
}
}
if((t_count != t_count2) || (a_count != a_count2) || (c_count != c_count2)){
return -1;
}
return ans/2;
}