Submission #568162

#	Time	Username	Problem	Language	Result	Execution time	Memory
568162		d4xn	Mutating DNA (IOI21_dna)	C++17	56 / 100	36 ms	6576 KiB

dna

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

const int N = 1e5+5;

int pa[2][N];
int pt[2][N];
int pc[2][N];
int pdif[N];

void init(std::string a, std::string b) {
	int n = min(a.size(), b.size());
	for (int i = 0; i < n; i++) {
		pa[0][i] = (i == 0 ? 0 : pa[0][i-1]);
		pt[0][i] = (i == 0 ? 0 : pt[0][i-1]);
		pc[0][i] = (i == 0 ? 0 : pc[0][i-1]);
		pa[1][i] = (i == 0 ? 0 : pa[1][i-1]);
		pt[1][i] = (i == 0 ? 0 : pt[1][i-1]);
		pc[1][i] = (i == 0 ? 0 : pc[1][i-1]);
		pdif[i] = (i == 0 ? 0 : pdif[i-1]);

		if (a[i] == 'A') pa[0][i]++;
		if (a[i] == 'T') pt[0][i]++;
		if (a[i] == 'C') pc[0][i]++;

		if (b[i] == 'A') pa[1][i]++;
		if (b[i] == 'T') pt[1][i]++;
		if (b[i] == 'C') pc[1][i]++;

		if (a[i] != b[i]) pdif[i]++;
	}
}

int get_distance(int x, int y) {
	int aa, ab, ta, tb, ca, cb, dif;
	aa = pa[0][y] - (x == 0 ? 0 : pa[0][x-1]);
	ab = pa[1][y] - (x == 0 ? 0 : pa[1][x-1]);
	ta = pt[0][y] - (x == 0 ? 0 : pt[0][x-1]);
	tb = pt[1][y] - (x == 0 ? 0 : pt[1][x-1]);
	ca = pc[0][y] - (x == 0 ? 0 : pc[0][x-1]);
	cb = pc[1][y] - (x == 0 ? 0 : pc[1][x-1]);
	dif = pdif[y] - (x == 0 ? 0 : pdif[x-1]);

	if (aa != ab || ca != cb || ta != tb) return -1;

	return dif/2 + dif%2;
}

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