Time Limit: 3000MS | Memory Limit: Unknown | 64bit IO Format: %lld & %llu |
Description
![Download as PDF Download as PDF](https://icpcarchive.ecs.baylor.edu/components/com_onlinejudge/images/button_pdf.png)
![\epsfbox{p3602.eps}](https://icpcarchive.ecs.baylor.edu/external/36/p3602.jpg)
``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
![$ \le$](https://icpcarchive.ecs.baylor.edu/external/36/3602img2.png)
![$ \le$](https://icpcarchive.ecs.baylor.edu/external/36/3602img2.png)
![$ \le$](https://icpcarchive.ecs.baylor.edu/external/36/3602img2.png)
![$ \le$](https://icpcarchive.ecs.baylor.edu/external/36/3602img2.png)
Output
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
Source
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
const int maxm=50+5;
const int maxn=1000+10;
int n,m;
char DNA[maxm][maxn];
char ans[maxn];
char check[5]={'A','C','G','T'};
int id[128]={0};
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
int count=0;
id['A']=0;id['C']=1;id['G']=2;id['T']=3;
scanf("%d%d",&m,&n);
for(int i=0;i<m;i++)
scanf("%s",DNA[i]);
for(int i=0;i<n;i++)
{
int num[4];
memset(num,0,sizeof(num));
for(int j=0;j<m;j++)
{
num[id[DNA[j][i]]]++;
}
int idn=0;
for(int k=1;k<4;k++)//字典序排序
{
if(num[k]>num[0])
{
num[0]=num[k];
idn=k;
}
}
ans[i]=check[idn];
count+=m-num[idn];
}
for(int k=0;k<n;k++)
printf("%c",ans[k]);
printf("\n%d\n",count);
}
return 0;
}