Submission #467612

#	Time	Username	Problem	Language	Result	Execution time	Memory
467612		rainboy	Mutating DNA (IOI21_dna)	C++17	100 / 100	48 ms	6152 KiB

dna

#include "dna.h"

const int N = 100000;

using namespace std;

int abs_(int a) { return a > 0 ? a : -a; }

int pp[6][N];

void init(string aa, string bb) {
	int n = aa.size(), h, i;

	for (i = 0; i < n; i++)
		if (aa[i] == 'A' && bb[i] == 'T')
			pp[0][i] = 1;
		else if (aa[i] == 'T' && bb[i] == 'A')
			pp[1][i] = 1;
		else if (aa[i] == 'T' && bb[i] == 'C')
			pp[4][i] = 1;
		else if (aa[i] == 'C' && bb[i] == 'T')
			pp[5][i] = 1;
		else if (aa[i] == 'C' && bb[i] == 'A')
			pp[2][i] = 1;
		else if (aa[i] == 'A' && bb[i] == 'C')
			pp[3][i] = 1;
	for (h = 0; h < 6; h++)
		for (i = 1; i < n; i++)
			pp[h][i] += pp[h][i - 1];
}

int kk[6];

int get_distance(int i, int j) {
	int h;

	for (h = 0; h < 6; h++)
		kk[h] = pp[h][j] - (i == 0 ? 0 : pp[h][i - 1]);
	if (kk[0] - kk[1] != kk[2] - kk[3] || kk[0] - kk[1] != kk[4] - kk[5])
		return -1;
	return min(kk[0], kk[1]) + min(kk[2], kk[3]) + min(kk[4], kk[5]) + abs_(kk[0] - kk[1]) * 2;
}

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