Submission #699144

#	Time	Username	Problem	Language	Result	Execution time	Memory
699144		aedmhsn	Mutating DNA (IOI21_dna)	C++17	0 / 100	23 ms	5132 KiB

dna

#include <iostream>
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;

int d[100001];
vector<vector<int>>numbersA;
vector<vector<int>>numbersB;
int n,q,x,y;
string f,s;
int aa=0, ta=0, ca=0,ab=0, tb=0, cb=0 , difference=0;


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] , dt1=numbersA[y][1] , dc1=numbersA[y][2] , da2=numbersB[y][0], dt2=numbersB[y][1], 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;
        }
}

• Subtask 1: 0 / 21
• Subtask 2: 0 / 22
• Subtask 3: 0 / 13
• Subtask 4: 0 / 28
• Subtask 5: 0 / 16