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.h"
using namespace std;
void init(string a, string b) {
}
int get_distance(int x, int y) {
string a, b;
init(a, b);
int p = 0, A[2] = {}, C[2] = {}, T[2] = {};
for(int i = x - 1; i < y; i++){
if(a[i] != b[i]) p++;
if(a[i] == 'A') A[0]++;
if(b[i] == 'A') A[1]++;
if(a[i] == 'C') C[0]++;
if(b[i] == 'C') C[1]++;
if(a[i] == 'T') T[0]++;
if(b[i] == 'T') T[1]++;
}
if(A[0] != A[1] || C[0] != C[1] || T[0] != T[1]) return -1;
if(p % 2) return p / 2 + 1;
else return p / 2;
return 0;
}
# | 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... |