# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
699038 | NourWael | Mutating DNA (IOI21_dna) | C++17 | 0 ms | 0 KiB |
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 <iostream>
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int difference=0;
int d[100001];
vector<vector<int>>numbersA;
vector<vector<int>>numbersB;
int n,q;
string f,s;
int aa=0;
int ta=0;
int ca=0;
int ab=0;
int tb=0;
int cb=0;
int x,y;
void init(string a, string b)
{
for(int i=0; i<n; i++)
{
if(a[i]!=b[i])
{
difference++;
}
d[i]=difference;
if(a[i]=='A')
{
aa++;
}
else if (a[i]=='T')
{
ta++;
}
else if (a[i]=='C')
{
ca++;
}
numbersA[i][0]=aa;
numbersA[i][1]=ta;
numbersA[i][2]=ca;
if(b[i]=='A')
{
ab++;
}
else if (b[i]=='T')
{
tb++;
}
else if (b[i]=='C')
{
cb++;
}
numbersB[i][0]=ab;
numbersB[i][1]=tb;
numbersB[i][2]=cb;
}
}
int get_distance(int x,int y)
{
int div=d[y];
int da1=numbersA[y][0];
int dt1=numbersA[y][1];
int dc1=numbersA[y][2];
int da2=numbersB[y][0];
int dt2=numbersB[y][1];
int dc2=numbersB[y][2];
if(x!=0)
{
div=d[y]-d[x-1];
da1-=numbersA[x-1][0];
dt1-=numbersA[x-1][1];
dc1-=numbersA[x-1][2];
da2-=numbersB[x-1][0];
dt2-=numbersB[x-1][1];
dc2-=numbersB[x-1][2];
}
if(da1==da2 && dt1==dt2 && dc1==dc2)
{
return ceil((double)div/2);
}
else
{
return -1;
}
}
int main()
{
cin>>n>>q;
cin>>f>>s;
numbersA.resize(n+1,vector<int>(3));
numbersB.resize(n+1,vector<int>(3));
init(f,s);
while(q--)
{
cin>>x>>y;
cout<<get_distance(x,y)<<'\n';
}
return 0;
}