-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathMinimalTriangle.java
156 lines (139 loc) · 3.91 KB
/
MinimalTriangle.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
// Paste me into the FileEdit configuration dialog
public class MinimalTriangle {
public double maximalArea(int length) {
return ((double)length * length* Math.sqrt(3)/4);
}
// BEGIN CUT HERE
public static void main(String[] args) {
if (args.length == 0) {
MinimalTriangleHarness.run_test(-1);
} else {
for (int i = 0; i < args.length; ++i)
MinimalTriangleHarness.run_test(Integer.valueOf(args[i]));
}
}
// END CUT HERE
}
// BEGIN CUT HERE
class MinimalTriangleHarness {
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 final double MAX_DOUBLE_ERROR = 1E-9;
static boolean compareOutput(double expected, double result) {
if (Double.isNaN(expected)) {
return Double.isNaN(result);
} else if (Double.isInfinite(expected)) {
if (expected > 0) {
return result > 0 && Double.isInfinite(result);
} else {
return result < 0 && Double.isInfinite(result);
}
} else if (Double.isNaN(result) || Double.isInfinite(result)) {
return false;
} else if (Math.abs(result - expected) < MAX_DOUBLE_ERROR) {
return true;
} else {
double min = Math.min(expected * (1.0 - MAX_DOUBLE_ERROR), expected * (1.0 + MAX_DOUBLE_ERROR));
double max = Math.max(expected * (1.0 - MAX_DOUBLE_ERROR), expected * (1.0 + MAX_DOUBLE_ERROR));
return result > min && result < max;
}
}
static double relativeError(double expected, double result) {
if (Double.isNaN(expected) || Double.isInfinite(expected) || Double.isNaN(result) || Double.isInfinite(result)
|| expected == 0)
return 0;
return Math.abs(result - expected) / Math.abs(expected);
}
static String formatResult(double res) {
return String.format("%.10g", res);
}
static int verifyCase(int casenum, double expected, double received) {
System.err.print("Example " + casenum + "... ");
if (compareOutput(expected, received)) {
System.err.print("PASSED");
double rerr = relativeError(expected, received);
if (rerr > 0)
System.err.printf(" (relative error %g)", rerr);
System.err.println();
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 length = 5;
double expected__ = 10.825317547305485;
return verifyCase(casenum, expected__, new MinimalTriangle().maximalArea(length));
}
case 1: {
int length = 10;
double expected__ = 43.30127018922194;
return verifyCase(casenum, expected__, new MinimalTriangle().maximalArea(length));
}
case 2: {
int length = 100000;
double expected__ = 4.330127018922194E9;
return verifyCase(casenum, expected__, new MinimalTriangle().maximalArea(length));
}
// custom cases
/*
* case 3: {
* int length = ;
* double expected__ = ;
*
* return verifyCase(casenum, expected__, new
* MinimalTriangle().maximalArea(length));
* }
*/
/*
* case 4: {
* int length = ;
* double expected__ = ;
*
* return verifyCase(casenum, expected__, new
* MinimalTriangle().maximalArea(length));
* }
*/
/*
* case 5: {
* int length = ;
* double expected__ = ;
*
* return verifyCase(casenum, expected__, new
* MinimalTriangle().maximalArea(length));
* }
*/
default:
return -1;
}
}
}
// END CUT HERE