-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathPartSorting.java
163 lines (145 loc) · 4.05 KB
/
PartSorting.java
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
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
// Paste me into the FileEdit configuration dialog
// SRM 307 DIV 2 - 500.0
public class PartSorting {
public int[] process(int[] data, int nSwaps) {
for (int i = 0; i < data.length; i++) {
int maxIndex = i;
for (int j = i+1; j < data.length && j <=i+nSwaps; j++) {
if (data[maxIndex]<data[j]){
maxIndex=j;
}
}
for (int j=maxIndex-1; j >=i ; j--) {
if (data[j] < data[j + 1]) {
int tmp = data[j];
data[j] = data[j + 1];
data[j + 1] = tmp;
nSwaps--;
}
}
}
return data;
}
// BEGIN CUT HERE
public static void main(String[] args) {
if (args.length == 0) {
PartSortingHarness.run_test(-1);
} else {
for (int i = 0; i < args.length; ++i)
PartSortingHarness.run_test(Integer.valueOf(args[i]));
}
}
// END CUT HERE
}
// BEGIN CUT HERE
class PartSortingHarness {
public static void run_test(int casenum) {
if (casenum != -1) {
if (runTestCase(casenum) == -1)
System.err.println("Illegal input! Test case " + casenum + " does not exist.");
return;
}
int correct = 0, total = 0;
for (int i = 0;; ++i) {
int x = runTestCase(i);
if (x == -1) {
if (i >= 100)
break;
continue;
}
correct += x;
++total;
}
if (total == 0) {
System.err.println("No test cases run.");
} else if (correct < total) {
System.err.println("Some cases FAILED (passed " + correct + " of " + total + ").");
} else {
System.err.println("All " + total + " tests passed!");
}
}
static boolean compareOutput(int[] expected, int[] result) {
if (expected.length != result.length)
return false;
for (int i = 0; i < expected.length; ++i)
if (expected[i] != result[i])
return false;
return true;
}
static String formatResult(int[] res) {
String ret = "";
ret += "{";
for (int i = 0; i < res.length; ++i) {
if (i > 0)
ret += ",";
ret += String.format(" %d", res[i]);
}
ret += " }";
return ret;
}
static int verifyCase(int casenum, int[] expected, int[] received) {
System.err.print("Example " + casenum + "... ");
if (compareOutput(expected, received)) {
System.err.println("PASSED");
return 1;
} else {
System.err.println("FAILED");
System.err.println(" Expected: " + formatResult(expected));
System.err.println(" Received: " + formatResult(received));
return 0;
}
}
static int runTestCase(int casenum__) {
switch (casenum__) {
case 0: {
int[] data = { 10, 20, 30, 40, 50, 60, 70 };
int nSwaps = 1;
int[] expected__ = { 20, 10, 30, 40, 50, 60, 70 };
return verifyCase(casenum__, expected__, new PartSorting().process(data, nSwaps));
}
case 1: {
int[] data = { 3, 5, 1, 2, 4 };
int nSwaps = 2;
int[] expected__ = { 5, 3, 2, 1, 4 };
return verifyCase(casenum__, expected__, new PartSorting().process(data, nSwaps));
}
case 2: {
int[] data = { 19, 20, 17, 18, 15, 16, 13, 14, 11, 12 };
int nSwaps = 5;
int[] expected__ = { 20, 19, 18, 17, 16, 15, 14, 13, 12, 11 };
return verifyCase(casenum__, expected__, new PartSorting().process(data, nSwaps));
}
// custom cases
case 3: {
int[] data ={89, 103, 107, 90, 97, 85, 12, 29, 71, 10, 94, 18, 15, 36, 55, 13, 77, 86, 5, 4, 48, 47, 3, 43, 25, 41, 74, 119, 8, 113, 42, 98, 14, 80, 37, 110, 11, 115, 87, 21, 127, 28, 124, 61, 102, 39, 70, 38, 81, 73} ;
int nSwaps = 10;
int[] expected__ ={107, 103, 97, 90, 89, 85, 94, 12, 29, 71, 10, 18, 15, 36, 55, 13, 77, 86, 5, 4, 48, 47, 3, 43, 25, 41, 74, 119, 8, 113, 42, 98, 14, 80, 37, 110, 11, 115, 87, 21, 127, 28, 124, 61, 102, 39, 70, 38, 81, 73} ;
return verifyCase(casenum__, expected__, new
PartSorting().process(data, nSwaps));
}
/*
* case 4: {
* int[] data = ;
* int nSwaps = ;
* int[] expected__ = ;
*
* return verifyCase(casenum__, expected__, new
* PartSorting().process(data, nSwaps));
* }
*/
/*
* case 5: {
* int[] data = ;
* int nSwaps = ;
* int[] expected__ = ;
*
* return verifyCase(casenum__, expected__, new
* PartSorting().process(data, nSwaps));
* }
*/
default:
return -1;
}
}
}
// END CUT HERE