forked from AhmadElsagheer/UVa-Solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathDNASorting_UVa612.java
More file actions
125 lines (105 loc) · 2.5 KB
/
DNASorting_UVa612.java
File metadata and controls
125 lines (105 loc) · 2.5 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
package v006;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
public class DNASorting_UVa612 {
public static void main(String[] args) throws Exception
{
Scanner sc = new Scanner(System.in);
PrintWriter out = new PrintWriter(System.out);
int tc = sc.nextInt();
while(tc-->0)
{
int n = sc.nextInt(), m = sc.nextInt();
Pair[] seq = new Pair[m];
for(int i = 0; i < m; ++i)
{
String s = sc.next();
seq[i] = new Pair(s, compute(n, s.toCharArray()), i);
}
Arrays.sort(seq);
for(int i = 0; i < m; ++i)
out.println(seq[i].s);
if(tc != 0)
out.println();
}
out.flush();
out.close();
}
static int compute(int n, char[] s)
{
int count = 0;;
for(int i = 0; i < n; ++i)
for(int j = i + 1; j < n; ++j)
if(s[i] > s[j])
++count;
return count;
}
static class Pair implements Comparable<Pair>
{
String s;
int inv, idx;
Pair(String a, int b, int c)
{
s = a;
inv = b;
idx = c;
}
public int compareTo(Pair p)
{
if(inv != p.inv)
return inv - p.inv;
return idx - p.idx;
}
}
static class Scanner
{
StringTokenizer st;
BufferedReader br;
public Scanner(InputStream s){ br = new BufferedReader(new InputStreamReader(s));}
public Scanner(FileReader r){ br = new BufferedReader(r);}
public String next() throws IOException
{
while (st == null || !st.hasMoreTokens())
st = new StringTokenizer(br.readLine());
return st.nextToken();
}
public int nextInt() throws IOException {return Integer.parseInt(next());}
public long nextLong() throws IOException {return Long.parseLong(next());}
public String nextLine() throws IOException {return br.readLine();}
public double nextDouble() throws IOException
{
String x = next();
StringBuilder sb = new StringBuilder("0");
double res = 0, f = 1;
boolean dec = false, neg = false;
int start = 0;
if(x.charAt(0) == '-')
{
neg = true;
start++;
}
for(int i = start; i < x.length(); i++)
if(x.charAt(i) == '.')
{
res = Long.parseLong(sb.toString());
sb = new StringBuilder("0");
dec = true;
}
else
{
sb.append(x.charAt(i));
if(dec)
f *= 10;
}
res += Long.parseLong(sb.toString()) / f;
return res * (neg?-1:1);
}
public boolean ready() throws IOException {return br.ready();}
}
}