제출 #565404

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

dna

#include <bits/stdc++.h>
#include "dna.h"
using namespace std;

const int MAXN = 1e5 + 7;

int slowo1[MAXN];
int slowo2[MAXN];
int pref[MAXN][3][3];

void init(string a, string b)
{
	int n = a.size();

	// zamiana znakow na liczby
	for (int i = 0; i < n; i++) {
		if (a[i] == 'A')
			slowo1[i + 1] = 0;
		if (a[i] == 'T')
			slowo1[i + 1] = 1;
		if (a[i] == 'C')
			slowo1[i + 1] = 2;

		if (b[i] == 'A')
			slowo2[i + 1] = 0;
		if (b[i] == 'T')
			slowo2[i + 1] = 1;
		if (b[i] == 'C')
			slowo2[i + 1] = 2;
	}

	// liczenie sum prefiksowych
	for (int i = 1; i <= n; i++) {

		for (int c1 = 0; c1 < 3; c1++) {
			for (int c2 = 0; c2 < 3; c2++) {

				// jezeli mamy c1 w slowo1 oraz c2 w slowo2
				if ((slowo1[i] == c1) && (slowo2[i] == c2))
					pref[i][c1][c2] = pref[i - 1][c1][c2] + 1;
				else
					pref[i][c1][c2] = pref[i - 1][c1][c2] + 0;
			}
		}

	}
}

int get_distance(int x, int y)
{
	x = x + 1;
	y = y + 1;

	int AT = pref[y][0][1] - pref[x - 1][0][1];
	int TA = pref[y][1][0] - pref[x - 1][1][0];

	int TC = pref[y][1][2] - pref[x - 1][1][2];
	int CT = pref[y][2][1] - pref[x - 1][2][1];

	int CA = pref[y][2][0] - pref[x - 1][2][0];
	int AC = pref[y][0][2] - pref[x - 1][0][2];

	// jezeli mamy tyle samo A, T, C w obu podslowach
	if ((AT + AC == TA + CA) && (TA + TC == AT + CT)) {
		int wynik = min(AT, TA) + min(TC, CT) + min(CA, AC);
		wynik += 2 * abs(AT - TA);
		return wynik;
	}
	else {
		return -1;
	}
}

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