제출 #448498

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
448498		Vladithur	DNA 돌연변이 (IOI21_dna)	C++17	100 / 100	54 ms	7408 KiB

dna

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

using namespace std;

int n, p[100001][3][3];

void init(std::string a, std::string b) {
	n = a.size();
	map<char, int> tm;
	tm['A'] = 0;
	tm['T'] = 1;
	tm['C'] = 2;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < 3; j++) {
			for (int k = 0; k < 3; k++) p[i + 1][j][k] = p[i][j][k];
		}
		int j = tm[a[i]], k = tm[b[i]];
		p[i + 1][j][k]++;
	}
}

int get_distance(int x, int y) {
	y++;
	vector<int> ta(3);
	
	int ans = y - x;
	for (int j = 0; j < 3; j++) {
		for (int k = 0; k < 3; k++) {
			int v = p[y][j][k] - p[x][j][k];
			ta[j] += v;
			ta[k] -= v;
			if (j == k) ans -= v;
		}
	}
	
	for (int tx: ta) {
		if (tx != 0) {
			return -1;
		}
	}
	
	int ttx = n;
	for (int j = 0; j < 3; j++) {
		for (int k = j + 1; k < 3; k++) {
			int tx = p[y][j][k] - p[x][j][k], ty = p[y][k][j] - p[x][k][j];
			ans -= min(tx, ty);
			ttx = min(ttx, max(tx, ty) - min(tx, ty));
		}
	}
	
	return ans - ttx;
}

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