답안 #654021

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
654021 2022-10-29T12:29:37 Z Blagoj DNA 돌연변이 (IOI21_dna) C++17
100 / 100
51 ms 10036 KB
#include "dna.h"
#include <bits/stdc++.h>
 
using namespace std;
 
string a, b;
 
int counter[100009][3][2], sum[100009][3][3];
 
unordered_map<char, int> mp;
 
void init(std::string a1, std::string b1) 
{
	mp['C'] = 0;
	mp['A'] = 1;
	mp['T'] = 2;
	a = a1;
	b = b1;
	counter[0][mp[a[0]]][0]++;
	counter[0][mp[b[0]]][1]++;
	sum[0][mp[a[0]]][mp[b[0]]]++;
	for (int i = 1; i < a.size(); i++)
	{
		for (int j = 0; j < 3; j++)
		{
			for (int l = 0; l < 3; l++)
			{
				sum[i][j][l] = sum[i - 1][j][l];
			}
		}
		sum[i][mp[a[i]]][mp[b[i]]]++;
		for (int j = 0; j < 3; j++)
		{
			counter[i][j][0] = counter[i - 1][j][0];
			counter[i][j][1] = counter[i - 1][j][1];
		}
		counter[i][mp[a[i]]][0]++;
		counter[i][mp[b[i]]][1]++;
	}
}
 
int get_distance(int x, int y) {
	int m = 1;
	if (x == 0)
	{
		m = 0;
	}
	for (int i = 0; i < 3; i++)
	{
		if ((counter[y][i][0] - (counter[x - 1][i][0] * m)) != (counter[y][i][1] - (counter[x - 1][i][1] * m)))
		{
			return -1;
		}
	}
	int res1 = 0, res2 = 0;
	for (int i = 0; i < 3; i++)
	{
		for (int j = i + 1; j < 3; j++)
		{
			res1 += min(sum[y][i][j] - (sum[x - 1][i][j] * m), sum[y][j][i] - (sum[x - 1][j][i] * m));
			res2 += abs((sum[y][i][j] - (sum[x - 1][i][j] * m)) - (sum[y][j][i] - (sum[x - 1][j][i] * m)));
		}
	}
	return res1 + (res2 * 2) / 3;
}

Compilation message

dna.cpp: In function 'void init(std::string, std::string)':
dna.cpp:22:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |  for (int i = 1; i < a.size(); i++)
      |                  ~~^~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 8260 KB Output is correct
2 Correct 38 ms 8232 KB Output is correct
3 Correct 47 ms 7680 KB Output is correct
4 Correct 40 ms 8268 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 9 ms 6868 KB Output is correct
5 Correct 10 ms 6912 KB Output is correct
6 Correct 9 ms 6796 KB Output is correct
7 Correct 9 ms 6484 KB Output is correct
8 Correct 9 ms 6928 KB Output is correct
9 Correct 10 ms 6896 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 9 ms 6868 KB Output is correct
5 Correct 10 ms 6912 KB Output is correct
6 Correct 9 ms 6796 KB Output is correct
7 Correct 9 ms 6484 KB Output is correct
8 Correct 9 ms 6928 KB Output is correct
9 Correct 10 ms 6896 KB Output is correct
10 Correct 51 ms 8156 KB Output is correct
11 Correct 41 ms 8264 KB Output is correct
12 Correct 40 ms 8076 KB Output is correct
13 Correct 40 ms 8384 KB Output is correct
14 Correct 44 ms 8648 KB Output is correct
15 Correct 43 ms 8536 KB Output is correct
16 Correct 38 ms 8168 KB Output is correct
17 Correct 35 ms 8300 KB Output is correct
18 Correct 37 ms 8640 KB Output is correct
19 Correct 35 ms 8140 KB Output is correct
20 Correct 38 ms 8404 KB Output is correct
21 Correct 37 ms 8652 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 9 ms 6868 KB Output is correct
5 Correct 10 ms 6912 KB Output is correct
6 Correct 9 ms 6796 KB Output is correct
7 Correct 9 ms 6484 KB Output is correct
8 Correct 9 ms 6928 KB Output is correct
9 Correct 10 ms 6896 KB Output is correct
10 Correct 8 ms 6356 KB Output is correct
11 Correct 9 ms 6868 KB Output is correct
12 Correct 8 ms 6484 KB Output is correct
13 Correct 10 ms 6828 KB Output is correct
14 Correct 9 ms 6868 KB Output is correct
15 Correct 9 ms 6868 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 8260 KB Output is correct
2 Correct 38 ms 8232 KB Output is correct
3 Correct 47 ms 7680 KB Output is correct
4 Correct 40 ms 8268 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 9 ms 6868 KB Output is correct
12 Correct 10 ms 6912 KB Output is correct
13 Correct 9 ms 6796 KB Output is correct
14 Correct 9 ms 6484 KB Output is correct
15 Correct 9 ms 6928 KB Output is correct
16 Correct 10 ms 6896 KB Output is correct
17 Correct 51 ms 8156 KB Output is correct
18 Correct 41 ms 8264 KB Output is correct
19 Correct 40 ms 8076 KB Output is correct
20 Correct 40 ms 8384 KB Output is correct
21 Correct 44 ms 8648 KB Output is correct
22 Correct 43 ms 8536 KB Output is correct
23 Correct 38 ms 8168 KB Output is correct
24 Correct 35 ms 8300 KB Output is correct
25 Correct 37 ms 8640 KB Output is correct
26 Correct 35 ms 8140 KB Output is correct
27 Correct 38 ms 8404 KB Output is correct
28 Correct 37 ms 8652 KB Output is correct
29 Correct 8 ms 6356 KB Output is correct
30 Correct 9 ms 6868 KB Output is correct
31 Correct 8 ms 6484 KB Output is correct
32 Correct 10 ms 6828 KB Output is correct
33 Correct 9 ms 6868 KB Output is correct
34 Correct 9 ms 6868 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 43 ms 7628 KB Output is correct
37 Correct 38 ms 8392 KB Output is correct
38 Correct 40 ms 8244 KB Output is correct
39 Correct 44 ms 10036 KB Output is correct
40 Correct 46 ms 10036 KB Output is correct
41 Correct 10 ms 7072 KB Output is correct
42 Correct 37 ms 9484 KB Output is correct
43 Correct 41 ms 9932 KB Output is correct
44 Correct 39 ms 9876 KB Output is correct
45 Correct 38 ms 9552 KB Output is correct
46 Correct 37 ms 9908 KB Output is correct
47 Correct 37 ms 9880 KB Output is correct