Submission #982474

#	Time	Username	Problem	Language	Result	Execution time	Memory
982474		faqinyeager	Mutating DNA (IOI21_dna)	C++17	21 / 100	26 ms	8980 KiB

dna

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

int n;
int asum[100050][3], bsum[100050][3];
int cnt[100050][3][3];

void init(std::string a, std::string b){
	n = (int)a.size();
	for(int i = 0; i < n; i ++){
		if(a[i] == 'A') asum[i + 1][0] ++;
		else if(a[i] == 'C') asum[i + 1][1] ++;
		else asum[i + 1][2] ++;
		
		if(b[i] == 'A') bsum[i + 1][0] ++;
		else if(b[i] == 'C') bsum[i + 1][1] ++;
		else bsum[i + 1][2] ++;

		int ai = 2, bi = 2;

		if(a[i] == 'A') ai = 0;
		else if(a[i] == 'C') ai = 1;
		if(b[i] == 'A') bi = 0;
		else if(b[i] == 'C') bi = 1;

		cnt[i + 1][ai][bi] = 1;
	}
	for(int i = 2; i <= n; i ++){
		for(int j = 0; j < 3; j ++){
			asum[i][j] += asum[i - 1][j];
			bsum[i][j] += bsum[i - 1][j];
		}

		for(int j = 0; j < 3; j ++){
			for(int jj = 0; jj < 3; jj ++){
				cnt[i][j][jj] += cnt[i - 1][j][jj];
			}
		}
	}
}

int get_distance(int x, int y){
	x++, y++;
	for(int j = 0; j < 3; j ++){
		if(asum[y][j] - asum[x - 1][j] != bsum[y][j] - bsum[x - 1][j]){
			return -1;
		}
	}

	int ac = cnt[y][0][1] - cnt[x - 1][0][1];
	int ca = cnt[y][1][0] - cnt[x - 1][1][0];
	int at = cnt[y][0][2] - cnt[x - 1][0][2];
	int ta = cnt[y][2][0] - cnt[x - 1][2][0];
	int tc = cnt[y][2][1] - cnt[x - 1][2][1];
	int ct = cnt[y][1][2] - cnt[x - 1][1][2];

	int r1 = (min(ac, ca) + min(at, ta) + min(tc, ct) + 1) / 2;
	int r2 = (abs(ac - ca) + abs(ta - at) + abs(ct - tc)) / 3 * 2;
	int ans = (r1 + r2);

	return ans;
}

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