제출 #719172

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
719172		thimote75	Mutating DNA (IOI21_dna)	C++17	22 / 100	1560 ms	7020 KiB

dna

#include "dna.h"

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

int to_int(char ch) {
	if (ch == 'A') return 0;
	if (ch == 'C') return 1;
	if (ch == 'T') return 2;

	assert(false);
}

struct SGD {
	int m[3][3];

	void init () {
		for (int i = 0; i < 3; i ++)
			for (int j = 0; j < 3; j ++)
				m[i][j] = 0;
	}
	SGD () { init(); }
	SGD (char a, char b) {
		init();
		int ia = to_int(a);
		int ib = to_int(b);

		m[ia][ib] ++;
	}

	SGD merge (SGD &other) {
		SGD res;

		for (int i = 0; i < 3; i ++)
			for (int j = 0; j < 3; j ++)
				res.m[i][j] = m[i][j] + other.m[i][j];
	
		return res;
	}
	int flux (int i) {
		int f = 0;
		for (int j = 0; j < 3; j ++) {
			if (j == i) continue ;

			f -= m[i][j];
			f += m[j][i];
		}

		return f;
	}
	int distance () {
		if (flux(0) != 0
		 || flux(1) != 0
		 || flux(2) != 0)
		 	return -1;

		int r[3][3];
		for (int i = 0; i < 3; i ++) for (int j = 0; j < 3; j ++)
			r[i][j] = m[i][j];
		
		int dist = 0;
		for (int i = 0; i < 3; i ++) {
			for (int j = i + 1; j < 3; j ++) {
				dist += min(r[j][i], r[i][j]);

				r[i][j] -= r[j][i];
				r[j][i]  = 0;
			}
		}

		int residual = r[0][2];
		if (residual != -r[0][1]) return -1;
		if (residual != -r[1][2]) return -1;

		dist += 2 * residual;

		return dist;
	}
};

vector<SGD> object_array;

void init(string a, string b) {
	object_array.resize(a.size());
	for (int i = 0; i < a.size(); i ++)
		object_array[i] = SGD(a[i], b[i]);
}

int get_distance(int x, int y) {
	SGD res;
	for (int i = x; i <= y; i ++)
		res = res.merge(object_array[i]);

	return res.distance();
}

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

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

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