제출 #548527

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
548527		Clan328	DNA 돌연변이 (IOI21_dna)	C++17	56 / 100	144 ms	41656 KiB

dna

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

using namespace std;

string a, b;
vector<int> diff;
vector<map<char, int>> dp1, dp2;

void init(std::string A, std::string B) {
	a = A;
	b = B;
	diff = vector<int>(a.size());
	dp1 = vector<map<char, int>>(a.size());
	dp2 = vector<map<char, int>>(a.size());

	for (int i = 0; i < a.size(); i++) {
		diff[i] = (i > 0? diff[i-1] : 0) + 1 - (a[i] == b[i]);

		if (i > 0) {
			dp1[i] = dp1[i-1];
			dp2[i] = dp2[i-1];
		}
		
		dp1[i][a[i]]++;
		dp2[i][b[i]]++;
	}
}

int get_distance(int x, int y) {
	if (x != 0) {
		if (!(
			dp1[y]['A']-dp1[x-1]['A'] == dp2[y]['A']-dp2[x-1]['A'] && 
			dp1[y]['C']-dp1[x-1]['C'] == dp2[y]['C']-dp2[x-1]['C'] &&
			dp1[y]['T']-dp1[x-1]['T'] == dp2[y]['T']-dp2[x-1]['T']
			))
				return -1;
	} else {
		if (!(
			dp1[y]['A'] == dp2[y]['A'] && 
			dp1[y]['C'] == dp2[y]['C'] &&
			dp1[y]['T'] == dp2[y]['T']
			)) return -1;
	}

	if (x != 0)
		return (diff[y]-diff[x-1]+1)/2;
	else
		return (diff[y]+1)/2;
}

컴파일 시 표준 에러 (stderr) 메시지

dna.cpp: In function 'void init(std::string, std::string)':
dna.cpp:17:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |  for (int i = 0; i < a.size(); i++) {
      |                  ~~^~~~~~~~~~

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