Submission #936115

#	Time	Username	Problem	Language	Result	Execution time	Memory
936115		AtabayRajabli	Mutating DNA (IOI21_dna)	C++17	100 / 100	37 ms	8372 KiB

dna

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

using namespace std;

int n;
int p[7][1000005];
int af[4][100005], bf[4][100005];
string ax = " ACATCT";
string bx = " CATATC";
string f = " ACT";

void init(string a, string b) 
{
	n = a.size();
	a = ' ' + a;
	b = ' ' + b;
	
	for(int i = 1; i <= n; i++)
	{
		for(int j = 1; j <= 6; j++)
		{
			if(a[i] == ax[j] && b[i] == bx[j])p[j][i]++;
			p[j][i] += p[j][i - 1];
		}
		for(int j = 1; j <= 3; j++)
		{
			af[j][i] = af[j][i - 1] + (f[j] == a[i]);
			bf[j][i] = bf[j][i - 1] + (f[j] == b[i]);
		}
	}
}

int get_distance(int x, int y)
{
	++x, ++y;
	for(int i = 1; i <= 3; i++)
	{
		if(af[i][y] - af[i][x - 1] != bf[i][y] - bf[i][x - 1])return -1;
	}
	int s[7] = {0};
	for(int i = 1; i <= 6; i++)
	{
		s[i] = p[i][y] - p[i][x - 1];
	}

	int ans = 0;
	int sx[4] = {0}, j = 1;
	for(int i = 1; i < 6; i += 2, j++)
	{
		ans += min(s[i], s[i + 1]);
		sx[j] += max(s[i], s[i + 1]) - min(s[i], s[i + 1]);
	}
	sort(sx + 1, sx + 1 + 3);

	return ans + sx[1] + sx[3];
}

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