``Thymine-Adenine-Adenine-Cytosine-Thymine-Guanine-Cytosine-Cytosine-Guanine-Adenine-Thymine"
Then we can represent the above DNA strand with the string ``TAACTGCCGAT." The biologist Prof. Ahn found that a gene X commonly exists in the DNA strands of five different kinds of animals, namely dogs, cats, horses, cows, and monkeys. He also discovered that the DNA sequences of the gene X from each animal were very alike. See Figure 2.
DNA sequence of gene X | |
Cat: | GCATATGGCTGTGCA |
Dog: | GCAAATGGCTGTGCA |
Horse: | GCTAATGGGTGTCCA |
Cow: | GCAAATGGCTGTGCA |
Monkey: | GCAAATCGGTGAGCA |
Prof. Ahn thought that humans might also have the gene X and decided to search for the DNA sequence of X in human DNA. However, before searching, he should define a representative DNA sequence of gene X because its sequences are not exactly the same in the DNA of the five animals. He decided to use the Hamming distance to define the representative sequence. The Hamming distance is the number of different characters at each position from two strings of equal length. For example, assume we are given the two strings ``AGCAT" and ``GGAAT." The Hamming distance of these two strings is 2 because the 1st and the 3rd characters of the two strings are different. Using the Hamming distance, we can define a representative string for a set of multiple strings of equal length. Given a set of strings S = s1,..., sm of length n , the consensus error between a string y of length n and the set S is the sum of the Hamming distances between y and each si in S. If the consensus error between y and S is the minimum among all possible strings y of length n , y is called a consensus string of S . For example, given the three strings ``AGCAT" ``AGACT" and ``GGAAT" the consensus string of the given strings is ``AGAAT" because the sum of the Hamming distances between ``AGAAT" and the three strings is 3 which is minimal. (In this case, the consensus string is unique, but in general, there can be more than one consensus string.) We use the consensus string as a representative of the DNA sequence. For the example of Figure 2 above, a consensus string of gene X is ``GCAAATGGCTGTGCA" and the consensus error is 7.
Input
Your program is to read from standard input. The input consists of T test cases. The number of test cases Tis given in the first line of the input. Each test case starts with a line containing two integers m and nwhich are separated by a single space. The integer m (4![$ \le$](https://i-blog.csdnimg.cn/blog_migrate/96be2248637876523338748b0a33d4c4.png)
![$ \le$](https://i-blog.csdnimg.cn/blog_migrate/96be2248637876523338748b0a33d4c4.png)
![$ \le$](https://i-blog.csdnimg.cn/blog_migrate/96be2248637876523338748b0a33d4c4.png)
![$ \le$](https://i-blog.csdnimg.cn/blog_migrate/96be2248637876523338748b0a33d4c4.png)
Output
Your program is to write to standard output. Print the consensus string in the first line of each case and the consensus error in the second line of each case. If there exists more than one consensus string, print the lexicographically smallest consensus string. The following shows sample input and output for three test cases.Sample Input
3 5 8 TATGATAC TAAGCTAC AAAGATCC TGAGATAC TAAGATGT 4 10 ACGTACGTAC CCGTACGTAG GCGTACGTAT TCGTACGTAA 6 10 ATGTTACCAT AAGTTACGAT AACAAAGCAA AAGTTACCTT AAGTTACCAA TACTTACCAA
Sample Output
TAAGATAC 7 ACGTACGTAA 6 AAGTTACCAA 12
这题一开始背景比较长,图也很吓人,读完之后意思就是,定义两个串的距离,就是相同位置上不同字母的个数,然后给了一堆串,求一个串,到这堆串距离最小,输出距离最小中字典序最小的那个。看了看定义就ok了,每个位置都是独立算距离的,那么只要每个位置到其他串的距离最小就好了,然后从字典序最小的开始找。
#include<cstdio> #include<cstring> #include<iostream> #include<string> #include<queue> #include<algorithm> using namespace std; int dp[1005][4]; char a[1005]; int main() { int i, j, m, n, ans, t, temp; char c; cin >> t; getchar(); while (t--) { cin >> m >> n; for (i = 0; i <= n;i++) for (j = 0; j <= 3; j++) dp[i][j] = 0; getchar(); for (i = 1; i <= m; i++) { for (j = 1; j <= n; j++) { c = getchar(); if (c == 'A') dp[j][0]++; else if (c == 'C') dp[j][1]++; else if (c == 'G') dp[j][2]++; else if (c == 'T') dp[j][3]++; } getchar(); } ans = 0; for (i = 1; i <= n; i++) { temp = dp[i][0]; c = 'A'; if (dp[i][1] > temp){ temp = dp[i][1]; c = 'C'; } if (dp[i][2] > temp){ temp = dp[i][2]; c = 'G'; } if (dp[i][3] > temp){ temp = dp[i][3]; c = 'T'; } ans = ans + m - temp; a[i - 1] = c; } for (i = 0; i < n; i++) cout << a[i]; cout << endl; cout << ans << endl; } return 0; }