#include <bits/stdc++.h>
#include "dna.h"
using namespace std;
string A,B;
vector<int> a_T,a_A,b_T,b_A,diff;
void init(std::string a, std::string b) {
A = a;
B = b;
}
int get_distance(int x, int y) {
if(y - x <=2)
{
if(y - x == 0)
{
if(A[x] == B[x])
return 0;
else
return -1;
}
else if(y - x == 1)
{
if((A[x] == B[x] && A[x+1] == B[x+1]))
return 0;
if((A[x] == B[x+1] && A[x+1] == B[x]))
return 1;
return -1;
}
else
{
int a=0,b=0,c=0;
for(int i=x;i<=y;++i)
{
if(A[i] == 'A')
++a;
else if(A[i] == 'T')
++b;
else
++c;
}
int d=0,e=0,f=0;
for(int i=x;i<=y;++i)
{
if(B[i] == 'A')
++d;
else if(B[i] == 'T')
++e;
else
++f;
}
if(a!=d || e!=b || f!=c)
{
return -1;
}
int diff1 = 0;
for(int i=x;i<=y;++i)
{
if(A[i]!=B[i])
++diff1;
}
if(diff1 & 1)
return diff1 + 1;
else
return diff1/2;
}
}
}
Compilation message (stderr)
dna.cpp: In function 'int get_distance(int, int)':
dna.cpp:69:1: warning: control reaches end of non-void function [-Wreturn-type]
69 | }
| ^
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |