제출 #487108

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
487108		Pulgster	DNA 돌연변이 (IOI21_dna)	C++17	0 / 100	45 ms	7028 KiB

dna

#include "dna.h"
#include <bits/stdc++.h>
using namespace std;
#define g(x) "[" << #x << ": " << (x) << "] "  
// a[i][from][to];
const int maxn = 100005;
int a[maxn][3][3];
int get(char &c){
	if(c == 'A'){
		return 0;
	} else if(c == 'T'){
		return 1;
	} else{
		return 2;
	}
	assert(false);
}
void init(string s, string b) {
	for(int i=0;i<3;i++){
		for(int j=0;j<3;j++){
			a[0][i][j] = 0;
		}
	}
	for(int i=0;i<s.size();i++){
		for(int j=0;j<3;j++){
			for(int k=0;k<3;k++){
				a[i][j][k] = a[i-1][j][k];
			}
		}
		a[i][get(s[i])][get(b[i])]++;
	}
}

int get_distance(int x, int y) {
	vector<vector<int>> cur(3, vector<int>(3));
 	for(int i=0;i<3;i++){
 		for(int j=0;j<3;j++){
 			cur[i][j] += a[y][i][j];
 			if(x != 0){
 				cur[i][j] -= a[x-1][i][j];
 			}
 		}
 	}
 	int clockwise = min({cur[0][1], cur[1][2], cur[2][0]});
 	int counterclockwise = min({cur[0][2], cur[2][1], cur[1][0]});
 	// cerr << g(clockwise) << g(counterclockwise) << '\n';
 	int how = min(clockwise, counterclockwise);
 	int twocycles = how;
 	for(int i=0;i<3;i++){
 		for(int j=0;j<3;j++){
 			 if(i==j)continue;
 			 cur[i][j] -= how;
 		}
 	}
 	for(int i=0;i<3;i++){
 		for(int j=i+1;j<3;j++){
 			int mn = min(cur[i][j], cur[j][i]);
 			twocycles += mn;
 			cur[i][j] -= mn;
 			cur[j][i] -= mn;
 		}
 	}
 	int m1 = 0;
 	int m2 = 0;
 	for(int i=0;i<3;i++){
 		m1 = max(cur[i][(i+1)%3], m1);
 		m2 = max(cur[i][(i+2)%3], m2);
 	}
 	if(min(m1, m2) != 0 or max(m1, m2) != (max(counterclockwise, clockwise) - how)){
 		return -1;
 	}
 	return (2 * max(m1, m2)) + twocycles;
}

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

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

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