답안 #633216

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
633216 2022-08-21T23:30:28 Z resting DNA 돌연변이 (IOI21_dna) C++17
100 / 100
47 ms 7416 KB
#include "dna.h"
#include <bits/stdc++.h>
using namespace std;

const int mx = 1e5+5;
int ps[mx][3][3] {};
void init(std::string a, std::string b) {
	map<char, int> m = {{'A', 0}, {'C', 1}, {'T', 2}};
	for(int i = 0; i < size(a); i++){
		ps[i][m[a[i]]][m[b[i]]]++;
	}
	for(int i = 1; i < size(a); i++){
		for(int a = 0; a < 3; a++){
			for(int b = 0; b < 3; b++){
				ps[i][a][b] += ps[i-1][a][b];
			}
		}
	}
}

int get_distance(int x, int y) {
	int z[3][3];
	for(int a = 0; a < 3; a++)
	for(int b = 0; b < 3; b++)
	z[a][b] = ps[y][a][b];
	if(x){
	for(int a = 0; a < 3; a++)
	for(int b = 0; b < 3; b++)
	z[a][b] -= ps[x-1][a][b];
	}
	int res = 0;
	for(int a = 0; a < 2; a++){
		for(int b = a+1; b < 3; b++){
			int t = min(z[a][b], z[b][a]);
			res += t;
			z[a][b] -= t;
			z[b][a] -= t;
		}
	}
	if(!z[0][1]){
		swap(z[0][1], z[1][0]);
		swap(z[1][2], z[2][1]);
		swap(z[0][2], z[2][0]);
	}
		if(z[0][1] == z[1][2] && z[1][2] == z[2][0] && !z[1][0] && !z[2][1] && !z[0][2]){
			return res + z[0][1] * 2;
		}
		else{
			return -1;
		}
	return 0;
}

Compilation message

dna.cpp: In function 'void init(std::string, std::string)':
dna.cpp:9:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 |  for(int i = 0; i < size(a); i++){
      |                 ~~^~~~~~~~~
dna.cpp:12:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 |  for(int i = 1; i < size(a); i++){
      |                 ~~^~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 6924 KB Output is correct
2 Correct 34 ms 7016 KB Output is correct
3 Correct 36 ms 6672 KB Output is correct
4 Correct 34 ms 7048 KB Output is correct
5 Correct 1 ms 304 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 5 ms 4436 KB Output is correct
5 Correct 5 ms 4544 KB Output is correct
6 Correct 5 ms 4536 KB Output is correct
7 Correct 5 ms 4308 KB Output is correct
8 Correct 5 ms 4564 KB Output is correct
9 Correct 5 ms 4524 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 5 ms 4436 KB Output is correct
5 Correct 5 ms 4544 KB Output is correct
6 Correct 5 ms 4536 KB Output is correct
7 Correct 5 ms 4308 KB Output is correct
8 Correct 5 ms 4564 KB Output is correct
9 Correct 5 ms 4524 KB Output is correct
10 Correct 34 ms 6968 KB Output is correct
11 Correct 33 ms 6980 KB Output is correct
12 Correct 33 ms 7068 KB Output is correct
13 Correct 33 ms 7160 KB Output is correct
14 Correct 32 ms 7372 KB Output is correct
15 Correct 39 ms 7288 KB Output is correct
16 Correct 30 ms 7020 KB Output is correct
17 Correct 34 ms 7148 KB Output is correct
18 Correct 31 ms 7288 KB Output is correct
19 Correct 31 ms 7040 KB Output is correct
20 Correct 32 ms 7136 KB Output is correct
21 Correct 33 ms 7416 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 5 ms 4436 KB Output is correct
5 Correct 5 ms 4544 KB Output is correct
6 Correct 5 ms 4536 KB Output is correct
7 Correct 5 ms 4308 KB Output is correct
8 Correct 5 ms 4564 KB Output is correct
9 Correct 5 ms 4524 KB Output is correct
10 Correct 5 ms 4180 KB Output is correct
11 Correct 5 ms 4532 KB Output is correct
12 Correct 5 ms 4264 KB Output is correct
13 Correct 5 ms 4564 KB Output is correct
14 Correct 5 ms 4564 KB Output is correct
15 Correct 4 ms 4564 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 6924 KB Output is correct
2 Correct 34 ms 7016 KB Output is correct
3 Correct 36 ms 6672 KB Output is correct
4 Correct 34 ms 7048 KB Output is correct
5 Correct 1 ms 304 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 5 ms 4436 KB Output is correct
12 Correct 5 ms 4544 KB Output is correct
13 Correct 5 ms 4536 KB Output is correct
14 Correct 5 ms 4308 KB Output is correct
15 Correct 5 ms 4564 KB Output is correct
16 Correct 5 ms 4524 KB Output is correct
17 Correct 34 ms 6968 KB Output is correct
18 Correct 33 ms 6980 KB Output is correct
19 Correct 33 ms 7068 KB Output is correct
20 Correct 33 ms 7160 KB Output is correct
21 Correct 32 ms 7372 KB Output is correct
22 Correct 39 ms 7288 KB Output is correct
23 Correct 30 ms 7020 KB Output is correct
24 Correct 34 ms 7148 KB Output is correct
25 Correct 31 ms 7288 KB Output is correct
26 Correct 31 ms 7040 KB Output is correct
27 Correct 32 ms 7136 KB Output is correct
28 Correct 33 ms 7416 KB Output is correct
29 Correct 5 ms 4180 KB Output is correct
30 Correct 5 ms 4532 KB Output is correct
31 Correct 5 ms 4264 KB Output is correct
32 Correct 5 ms 4564 KB Output is correct
33 Correct 5 ms 4564 KB Output is correct
34 Correct 4 ms 4564 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 33 ms 6620 KB Output is correct
37 Correct 36 ms 6992 KB Output is correct
38 Correct 47 ms 7164 KB Output is correct
39 Correct 32 ms 7412 KB Output is correct
40 Correct 33 ms 7368 KB Output is correct
41 Correct 5 ms 4564 KB Output is correct
42 Correct 41 ms 7012 KB Output is correct
43 Correct 31 ms 7304 KB Output is correct
44 Correct 35 ms 7288 KB Output is correct
45 Correct 29 ms 7060 KB Output is correct
46 Correct 29 ms 7312 KB Output is correct
47 Correct 30 ms 7304 KB Output is correct