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"
#include "bits/stdc++.h"
using namespace std;
int a[100005], b[100005];
void init(string A, string B)
{
for(int i=0; i<(int)A.length(); i++)
{
if(A[i]=='C') a[i]=1;
else if(A[i]=='T') a[i]=2;
if(B[i]=='C') b[i]=1;
else if(B[i]=='T') b[i]=2;
}
}
int get_distance(int x, int y)
{
int dif=0, cnt1[3]={0,0,0}, cnt2[3]={0,0,0};
for(int i=x; i<=y; i++)
{
if(a[i]!=b[i]) dif++;
cnt1[a[i]]++;
cnt2[b[i]]++;
}
if(cnt1[0]!=cnt2[0] or cnt1[1]!=cnt2[1] or cnt1[2]!=cnt2[2]) return -1;
return max(0, dif-1);
}
| # | 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... |