제출 #522952

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
522952		Turkhuu	DNA 돌연변이 (IOI21_dna)	C++17	100 / 100	56 ms	7808 KiB

dna

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

using namespace std;

vector<int> ax, at, ta, ct, aaa, bba, aac, bbc, aat, bbt;

void init(std::string a, std::string b) {
	int n = (int)a.size();	
	ax.resize(n + 1);
	at.resize(n + 1);
	ta.resize(n + 1);
	ct.resize(n + 1);
	aaa.resize(n + 1);
	aac.resize(n + 1);
	aat.resize(n + 1);
	bba.resize(n + 1);
	bbc.resize(n + 1);
	bbt.resize(n + 1);
	for(int i = 0; i < n; i++){
		ax[i + 1] = ax[i];
		at[i + 1] = at[i];
		ta[i + 1] = ta[i];
		ct[i + 1] = ct[i];
		aaa[i + 1] = aaa[i];
		aac[i + 1] = aac[i];
		aat[i + 1] = aat[i];
		bba[i + 1] = bba[i];
		bbc[i + 1] = bbc[i];
		bbt[i + 1] = bbt[i];
		if(a[i] == 'A'){
			aaa[i + 1] += 1;
		}
		if(a[i] == 'C'){
			aac[i + 1] += 1;
		}
		if(a[i] == 'T'){
			aat[i + 1] += 1;
		}
		if(b[i] == 'A'){
			bba[i + 1] += 1;
		}
		if(b[i] == 'C'){
			bbc[i + 1] += 1;
		}
		if(b[i] == 'T'){
			bbt[i + 1] += 1;
		}
		if(a[i] == 'A' && b[i] != 'A'){
			ax[i + 1] += 1;
		}
		if(a[i] == 'A' && b[i] == 'T'){
			at[i + 1] += 1;
		}
		if(a[i] == 'T' && b[i] == 'A'){
			ta[i + 1] += 1;
		}
		if(a[i] == 'C' && b[i] == 'T'){
			ct[i + 1] += 1;
		}
		if(a[i] == 'T' && b[i] == 'C'){
			ct[i + 1] += 1;
		}
	}
}

int get_distance(int x, int y) {
	x += 1;
	y += 1;
	int AX = ax[y] - ax[x - 1];
	int AT = at[y] - at[x - 1];
	int TA = ta[y] - ta[x - 1];
	int CT = ct[y] - ct[x - 1];
	int AAA = aaa[y] - aaa[x - 1];
	int AAC = aac[y] - aac[x - 1];
	int AAT = aat[y] - aat[x - 1];
	int BBA = bba[y] - bba[x - 1];
	int BBC = bbc[y] - bbc[x - 1];
	int BBT = bbt[y] - bbt[x - 1];
	if(AAA != BBA || AAC != BBC || AAT != BBT){
		return -1;
	} else{
		return AX + (CT + abs(AT - TA)) / 2;
	}
}

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