proj 1007:
DNA Sorting
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 76307 | Accepted: 30599 |
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
accepted:
#include<iostream> #include<string> using namespace std; int measure(char *s){ int len = strlen(s); int A = 0; int C = 0; int G = 0; int T = 0; int value = 0; for(int i = len - 1; i >= 0; --i){ if(s[i] == 'A'){ ++A; } if(s[i] == 'C'){ value = value + A; ++C; } if(s[i] == 'G'){ value = value + A + C; ++G; } if(s[i] == 'T'){ value = value + A + C + G; } //cout<<i<<":"<<value<<endl; } return value; } void special_qsort(int *a, int i, int j, int *b){ if(i < j){ int flag = i; for(int k = i + 1; k < j + 1; ++k){ if(a[k] <= a[i]){ ++flag; int temp1 = a[k]; int temp2 = b[k]; a[k] = a[flag]; b[k] = b[flag]; a[flag] = temp1; b[flag] = temp2; } } int temp1 = a[i]; int temp2 = b[i]; a[i] = a[flag]; b[i] = b[flag]; a[flag] = temp1; b[flag] = temp2; special_qsort(a, i, flag - 1, b); special_qsort(a, flag + 1, j, b); } } int main() { int n,m; cin>>n>>m; int *b = new int[m]; for(int i = 0; i < m; ++i){ b[i] = i; } char *p = new char[n*m]; char *p1 = new char[n]; int *a = new int[m]; int i = 0; while(i < m){ cin>>p1; a[i] = measure(p1); for(int j = i*n; j < (i + 1)*n; ++j){ p[j] = p1[j - i*n]; } ++i; } p[n*m] = '