DNA Sorting

最新推荐文章于 2022-10-28 17:42:59 发布

原创最新推荐文章于 2022-10-28 17:42:59 发布 · 444 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#字符串

acm 同时被 2 个专栏收录

107 篇文章

订阅专栏

字符串

52 篇文章

订阅专栏

DNA Sorting

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 1497 Accepted Submission(s): 715

Problem Description

One measure of ``unsortedness'' in a sequence is the number of pairs of entries that are out of order with respect to each other. For instance, in the letter sequence ``DAABEC'', this measure is 5, since D is greater than four letters to its right and E is greater than one letter to its right. This measure is called the number of inversions in the sequence. The sequence ``AACEDGG'' has only one inversion (E and D)--it is nearly sorted--while the sequence ``ZWQM'' has 6 inversions (it is as unsorted as can be--exactly the reverse of sorted).

You are responsible for cataloguing a sequence of DNA strings (sequences containing only the four letters A, C, G, and T). However, you want to catalog them, not in alphabetical order, but rather in order of ``sortedness'', from ``most sorted'' to ``least sorted''. All the strings are of the same length.

This problem contains multiple test cases!

The first line of a multiple input is an integer N, then a blank line followed by N input blocks. Each input block is in the format indicated in the problem description. There is a blank line between input blocks.

The output format consists of N output blocks. There is a blank line between output blocks.

Input

The first line contains two integers: a positive integer n (0 < n <= 50) giving the length of the strings; and a positive integer m (1 < m <= 100) giving the number of strings. These are followed by m lines, each containing a string of length n.

Output

Output the list of input strings, arranged from ``most sorted'' to ``least sorted''. If two or more strings are equally sorted, list them in the same order they are in the input file.

Sample Input

1

10 6
AACATGAAGG
TTTTGGCCAA
TTTGGCCAAA
GATCAGATTT
CCCGGGGGGA
ATCGATGCAT

Sample Output

CCCGGGGGGA
AACATGAAGG
GATCAGATTT
ATCGATGCAT
TTTTGGCCAA
TTTGGCCAAA
 
#include<iostream>
using namespace std;
typedef struct infor
{
	char ch[123];
	int num;
}infor;
int cmp(const void *a,const void *b){
	infor *c=(infor *)a;
	infor *d=(infor *)b;
	return c->num-d->num;
}
int main()
{
	int t,count=1;
	cin>>t;
	while(t--){
		int m,n;
		cin>>m>>n;
		getchar();
		infor a[55];
		int k=0;
		for(int i=0;i<n;i++){
			gets(a[k++].ch);
			a[k-1].num=0;
		}
		for(i=0;i<k;i++)
			for(int j=0;j<m;j++)
				for(int l=j+1;l<m;l++)
					if(a[i].ch[l]<a[i].ch[j])
						a[i].num++;
		qsort(a,k,sizeof(a[0]),cmp);
		for(i=0;i<k;i++)
			cout<<a[i].ch<<endl;
	}
	return 0;
}