Submission #936104

#	Time	Username	Problem	Language	Result	Execution time	Memory
936104		AtabayRajabli	Mutating DNA (IOI21_dna)	C++17	0 / 100	25 ms	4532 KiB

dna

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

using namespace std;

int n;
int p[7][1000005];
string ax = " ACATCT";
string bx = " CATATC";

void init(string a, string b) 
{
	n = a.size();
	a = ' ' + a;
	b = ' ' + b;
	
	for(int i = 1; i <= n; i++)
	{
		if(a[i] == b[i])continue;

		for(int j = 1; j <= 6; j++)
		{
			if(a[i] == ax[j] && b[i] == b[j])p[j][i]++;
			p[j][i] += p[j][i - 1];
		}
	}
}

int get_distance(int x, int y)
{
	++x, ++y;
	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++)
	{
		if(s[i] != s[i + 1])return -1;
		ans += s[i];
		sx[j] += s[i];
	}
	sort(sx + 1, sx + 1 + 3);

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

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