# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1142595 | jadmeziani2 | Mutating DNA (IOI21_dna) | C++20 | 0 ms | 0 KiB |
#include "dna.h"
#include <bits/stdc++.h>
using namespace std;
string c,d;
void init(std::string a, std::string b) {
c=a;
d=b;
}
int get_distance(int x, int y) {
int count =0;
int a=1;
int c=5;
int t=20;
for(int i=0;i<(int) c.size();i++){
if(c[i] == 'A'){
count+=1;
}
else if(c[i] == 'C'){
count+=2;
}
else if(c[i] == 'T'){
count+=3;
}
if(d[i] == 'A'){
count-=1;
}
else if(d[i] == 'C'){
count-=2;
}
else if(d[i] == 'T'){
count-=3;
}
}
if(count !=0){
return -1;
}
if(y-x % == 0){
return (y-x)/2;
}
else{
return (y-x+1)/2
}
return count;
}