Submission #1220024

#	Time	Username	Problem	Language	Result	Execution time	Memory
1220024		brinton	DNA 돌연변이 (IOI21_dna)	C++20	35 / 100	22 ms	5056 KiB

dna

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

enum dnaType{
	AT,AC,TA,TC,CA,CT
};
vector<vector<int>> pref;
void init(string a, string b) {
	int N = a.size();
	pref = vector<vector<int>>(6,vector<int>(N,0));
	for(int i = 0;i < N;i++){
		if(a[i] == b[i]) continue;
		if(a[i] == 'A'){
			if(b[i] == 'T') pref[AT][i] = 1;
			else pref[AC][i] = 1;
		}else if(a[i] == 'T'){
			if(b[i] == 'A') pref[TA][i] = 1;
			else pref[TC][i] = 1;
		}else if(a[i] == 'C'){
			if(b[i] == 'A') pref[CA][i] = 1;
			else pref[CT][i] = 1;
		}
	}
	for(int i = 1;i < N;i++){
		for(int type = 0;type < 6;type++){
			pref[type][i] += pref[type][i-1];
		}
	}
}

int get_distance(int x, int y) {
	vector<int> cnt(6);
	for(int i = 0;i < 6;i++){
		if(x > 0) cnt[i] = pref[i][y]-pref[i][x-1];
		else cnt[i] = pref[i][y];
	}
	// for(auto &i:cnt) cout << i << " ";cout << endl;
	if(cnt[AT]+cnt[AC] != cnt[TA]+cnt[CA]) return -1;
	if(cnt[TA]+cnt[TC] != cnt[AT]+cnt[CT]) return -1;
	if(cnt[CA]+cnt[CT] != cnt[AC]+cnt[TC]) return -1;
	int step = 0;
	step += min(cnt[AT],cnt[TA]);
	step += min(cnt[AC],cnt[CA]);
	step += min(cnt[CT],cnt[TC]);
	cnt[AT] -=  min(cnt[AT],cnt[TA]);
	cnt[TA] -=  min(cnt[AT],cnt[TA]);
	cnt[AC] -=  min(cnt[AC],cnt[CA]);
	cnt[CA] -=  min(cnt[AC],cnt[CA]);
	cnt[CT] -=  min(cnt[CT],cnt[TC]);
	cnt[TC] -=  min(cnt[CT],cnt[TC]);
	if(cnt[AT] == 0 && cnt[AC] == 0) step += (cnt[CT]+cnt[TC]);
	else if(cnt[TA] == 0 && cnt[CA] == 0) step += (cnt[CT]+cnt[TC]);
	else step += (cnt[AT]+cnt[TA]+cnt[AC]+cnt[CA]);
	return step;
}

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