-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathTheJediTestDiv2.java
169 lines (147 loc) · 3.96 KB
/
TheJediTestDiv2.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
164
165
166
167
168
169
// Paste me into the FileEdit configuration dialog
public class TheJediTestDiv2 {
public static int[] copyOf(int[] students, int newLength) {
int[] copy = new int[newLength];
System.arraycopy(students, 0, copy, 0,
Math.min(students.length, newLength));
return copy;
}
public int countSupervisors(int[] students, int Y, int J) {
int min = Integer.MAX_VALUE;
for (int i = 0; i < students.length; i++) {
int[] copy = copyOf(students, students.length);
// copy[i] = Math.max(copy[i] - Y, 0);
copy[i] -= Math.min(copy[i], Y);
int count = 0;
for (int j = 0; j < students.length; j++) {
count += (copy[j] % J > 0 ? 1 : 0) + copy[j] / J;
}
min = Math.min(min, count);
}
return min;
}
// BEGIN CUT HERE
public static void main(String[] args) {
if (args.length == 0) {
TheJediTestDiv2Harness.run_test(-1);
} else {
for (int i = 0; i < args.length; ++i)
TheJediTestDiv2Harness.run_test(Integer.valueOf(args[i]));
}
}
// END CUT HERE
}
// BEGIN CUT HERE
class TheJediTestDiv2Harness {
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) {
return expected == result;
}
static String formatResult(int res) {
return String.format("%d", res);
}
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[] students = { 10, 15 };
int Y = 12;
int J = 5;
int expected__ = 3;
return verifyCase(casenum, expected__,
new TheJediTestDiv2().countSupervisors(students, Y, J));
}
case 1: {
int[] students = { 11, 13, 15 };
int Y = 9;
int J = 5;
int expected__ = 7;
return verifyCase(casenum, expected__,
new TheJediTestDiv2().countSupervisors(students, Y, J));
}
case 2: {
int[] students = { 10 };
int Y = 100;
int J = 2;
int expected__ = 0;
return verifyCase(casenum, expected__,
new TheJediTestDiv2().countSupervisors(students, Y, J));
}
case 3: {
int[] students = { 0, 0, 0, 0, 0 };
int Y = 145;
int J = 21;
int expected__ = 0;
return verifyCase(casenum, expected__,
new TheJediTestDiv2().countSupervisors(students, Y, J));
}
case 4: {
int[] students = { 4, 7, 10, 5, 6, 55, 2 };
int Y = 20;
int J = 3;
int expected__ = 26;
return verifyCase(casenum, expected__,
new TheJediTestDiv2().countSupervisors(students, Y, J));
}
// custom cases
/*
* case 5: { int[] students = ; int Y = ; int J = ; int expected__ = ;
*
* return verifyCase(casenum, expected__, new
* TheJediTestDiv2().countSupervisors(students, Y, J)); }
*/
/*
* case 6: { int[] students = ; int Y = ; int J = ; int expected__ = ;
*
* return verifyCase(casenum, expected__, new
* TheJediTestDiv2().countSupervisors(students, Y, J)); }
*/
/*
* case 7: { int[] students = ; int Y = ; int J = ; int expected__ = ;
*
* return verifyCase(casenum, expected__, new
* TheJediTestDiv2().countSupervisors(students, Y, J)); }
*/
default:
return -1;
}
}
}
// END CUT HERE