DNA Sorting
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 89587 | Accepted: 36001 |
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.
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.
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 (0 < 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''. Since two strings can be equally sorted, then output them according to the orginal order.
Sample Input
10 6 AACATGAAGG TTTTGGCCAA TTTGGCCAAA GATCAGATTT CCCGGGGGGA ATCGATGCAT
Sample Output
CCCGGGGGGA AACATGAAGG GATCAGATTT ATCGATGCAT TTTTGGCCAA TTTGGCCAAA
Source
题目不难 可又是因为没搞清楚n和m wa了2次。。。。
ACcode:
#include <map>
#include <queue>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <stdlib.h>
#include <iostream>
#include <algorithm>
#define maxn 100+10
using namespace std;
int _sort(char a[]){
char c[100];
strcpy(c,a);
int ans=0;
char t;
for(int i=0;i<strlen(c);++i){
for(int j=0;j<strlen(c)-1;++j){
if(c[j]>c[j+1]){
ans++;
t=c[j];
c[j]=c[j+1];
c[j+1]=t;
}
}
}
return ans;
}
struct m{
char a[100];
int ans;
}my[maxn];
bool cmp(m x,m y){
return x.ans<y.ans;
}
int main(){
int n,m,k;
while(scanf("%d%d",&n,&m)!=EOF){
for(k=0;k<m;++k){
scanf("%s",my[k].a);
my[k].ans=_sort(my[k].a);
}
sort(my,my+k,cmp);
for(int i=0;i<m;++i)printf("%s\n",my[i].a);
}
return 0;
}