| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 437868 | Haidara | 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.
/* * * * * * * * * *
* ID: Haidara *
* LANG: C++17 *
* PROB: *
* * * * * * * * * */
#include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define int long long
#define rep(i,x,n) for(int i=x;i<n;i++)
#define FOR(i,n) rep(i,0,n)
#define per(i,x,n) for(int i=x;i>n;i--)
#define ROF(i,x) for(int i=x;i>=0;i--)
#define v(i) vector< i >
#define p(i,j) pair< i , j >
#define pii pair<int,int>
#define m(i,j) map< i , j >
#define pq(i) priority_queue< i >
#define ff first
#define all(x) x.begin(),x.end()
#define ss second
#define pp push_back
using namespace std;
void SIO(string name="")
{
if(name!="")
{
freopen((name+".in").c_str(),"r",stdin);
freopen((name+".out").c_str(),"w",stdout);
}
}
const int inf=1LL<<62LL;
const int mod=1e9+7;
const int maxn=100100;
int st[3][2][maxn*4];
string a[2];
int n;
int idx;
void build(int l=1,int r=n,int inx=1)
{
if(l==r)
{
if(a[idx][l]=='T')
st[2][idx][inx]=1;
if(a[idx][l]=='C')
st[2][idx][inx]=1;
if(a[idx][l]=='A')
st[2][idx][inx]=1;
return ;
}
int mid=l+(r-l)/2;
build(l,mid,inx*2);
build(mid+1,r,inx*2+1);
FOR(i,3)
st[i][idx][inx]=st[i][idx][inx*2]+st[i][idx][inx*2+1];
return ;
}
int f[3],s[3];
void query(int ql,int qr,int l=1,int r=n,int inx=1)
{
if(ql<=l&&r<=qr)
{
FOR(i,3)
f[i]+=st[i][0][inx],s[i]+=st[i][1][inx];
return ;
}
if(l>qr||r<ql)
return ;
int mid=l+(r-l)/2;
query(ql,qr,l,mid,inx*2);
query(ql,qr,mid+1,r,inx*2+1);
return ;
}
void init(string str, string b)
{
a[0]=str;
a[1]=b;
}
int get_distance(int l, int r)
{
l++,r++;
FOR(i,3)
f[i]=s[i]=0;
int ans=r-l;
query(l,r);
FOR(i,3)
if(f[i]!=s[i])
ans=-1;
return ans;
}
signed main()
{
SIO("");
int q;
cin>>n>>q>>a[0]>>a[1];
idx=0;
build();
idx=1;
build();
while(q--)
{
int l,r;
cin>>l>>r;
int curr=get_distance(l,r);
cout<<curr<<endl;
}
}