Submission #981527

#	Time	Username	Problem	Language	Result	Execution time	Memory
981527		faqinyeager	Mutating DNA (IOI21_dna)	C++17	43 / 100	1561 ms	4908 KiB

dna

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

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

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][0] ++;
		else if(a[i] == 'C') asum[i][1] ++;
		else asum[i][2]++;

		if(b[i] == 'A') bsum[i][0] ++;
		else if(b[i] == 'C') bsum[i][1] ++;
		else bsum[i][2]++;
	}
	for(int i = 1; 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 i = 0; i < n; i++){
		if(a[i] != b[i]) cnt[i] = 1;
	}
}

int get_distance(int x, int 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 ans = 0;
	for(int i = x; i <= y; i++){
		ans += cnt[i];
	}

	return (ans + 1) / 2;
}

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