제출 #977302

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
977302		sstojilkovic19	DNA 돌연변이 (IOI21_dna)	C++17	0 / 100	49 ms	6344 KiB

dna

#include "dna.h"
#include <bits/stdc++.h>

using namespace std;
string aa, bb;
int n = 100010;

vector< vector<int> >pref(10, vector<int>(n, 0));

void init(std::string a, std::string b) {
    aa=a;
    bb=b;
    n = a.length();

    /*
    0 uk
    1 AT
    2 TA
    3 AC
    4 CA
    5 TC
    6 CT
    TAC
    CTA
    */

    for(int i = 0; i<=6; i++)
    {
        for(int j = 0; j<n; j++)
        {
            pref[i][j]=pref[i][max(0, j-1)];
            if(i==0 && a[j]!=b[j])pref[i][j]++;
            else if(i==1 && a[j]=='A' && b[j]=='T')pref[i][j]++;
            else if(i==2 && a[j]=='T' && b[j]=='A')pref[i][j]++;
            else if(i==3 && a[j]=='A' && b[j]=='C')pref[i][j]++;
            else if(i==4 && a[j]=='C' && b[j]=='A')pref[i][j]++;
            else if(i==5 && a[j]=='T' && b[j]=='C')pref[i][j]++;
            else if(i==6 && a[j]=='C' && b[j]=='T')pref[i][j]++;
        }
    }
}

int get_distance(int x, int y)
{
    map<char, int>m1, m2;
    for(int i = x; i<=y; i++)
    {
        m1[aa[i]]++;
        m2[bb[i]]++;
    }
    if(m1['A']!=m2['A'] || m1['T']!=m2['T'] || m1['C']!=m2['C'])
    {
        return -1;
    }
	int a=0;
	if(x>0)a=x-1;
	int ans = pref[0][y]-pref[0][a]-1;
	ans -= min(pref[1][y]-pref[1][a], pref[2][y]-pref[2][a]);
	ans -= min(pref[3][y]-pref[3][a], pref[4][y]-pref[4][a]);
	ans -= min(pref[5][y]-pref[5][a], pref[6][y]-pref[6][a]);

	if(ans==0)
    {
        for(int i = x; i<=y; i++)
        {
            if(aa[i]!=bb[i])
            {
                ans++;
                break;
            }

        }
    }

	return ans;
}

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