-
Notifications
You must be signed in to change notification settings - Fork 1
/
GraphWalkWithProbabilities.java
182 lines (170 loc) · 4.71 KB
/
GraphWalkWithProbabilities.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
170
171
172
173
174
175
176
177
178
179
180
181
182
import java.util.*;
import java.util.regex.*;
import java.text.*;
import java.math.*;
public class GraphWalkWithProbabilities
{
public double findprob(String[] graph, int[] winprob, int[] looseprob, int Start)
{
double[] dp = new double[winprob.length];
dp[Start] = 1;
double win = 0;
while (true) {
double[] newDP = new double[winprob.length];
double max = 0;
int maxP = 0;
for (int j = 0; j < newDP.length; j++) {
double d = newDP[j];
if (max < d) {
max = d;
maxP = j;
}
}
double plus = dp[maxP] * winprob[maxP];
win += plus;
if (plus < 1E-9) {
return win;
}
for (int i = 0; i < dp.length; i++) {
for (int j = 0; j < dp.length; j++) {
if (graph[i].charAt(j) == '1') {
newDP[i] = Math.max(newDP[i],
dp[j] * (1.0*winprob[i] / (winprob[i] + looseprob[i])));
}
}
}
dp = newDP;
}
}
// BEGIN KAWIGIEDIT TESTING
// Generated by KawigiEdit-pf 2.3.0
private static boolean KawigiEdit_RunTest(int testNum, String[] p0, int[] p1, int[] p2, int p3, boolean hasAnswer,
double p4) {
System.out.print("Test " + testNum + ": [" + "{");
for (int i = 0; p0.length > i; ++i) {
if (i > 0) {
System.out.print(",");
}
System.out.print("\"" + p0[i] + "\"");
}
System.out.print("}" + "," + "{");
for (int i = 0; p1.length > i; ++i) {
if (i > 0) {
System.out.print(",");
}
System.out.print(p1[i]);
}
System.out.print("}" + "," + "{");
for (int i = 0; p2.length > i; ++i) {
if (i > 0) {
System.out.print(",");
}
System.out.print(p2[i]);
}
System.out.print("}" + "," + p3);
System.out.println("]");
GraphWalkWithProbabilities obj;
double answer;
obj = new GraphWalkWithProbabilities();
long startTime = System.currentTimeMillis();
answer = obj.findprob(p0, p1, p2, p3);
long endTime = System.currentTimeMillis();
boolean res;
res = true;
System.out.println("Time: " + (endTime - startTime) / 1000.0 + " seconds");
if (hasAnswer) {
res = answer == answer && Math.abs(p4 - answer) <= 1e-9 * Math.max(1.0, Math.abs(p4));
}
if (!res) {
System.out.println("DOESN'T MATCH!!!!");
if (hasAnswer) {
System.out.println("Desired answer:");
System.out.println("\t" + p4);
}
System.out.println("Your answer:");
System.out.println("\t" + answer);
} else if ((endTime - startTime) / 1000.0 >= 2) {
System.out.println("FAIL the timeout");
res = false;
} else if (hasAnswer) {
System.out.println("Match :-)");
} else {
System.out.println("OK, but is it right?");
}
System.out.println("");
return res;
}
public static void main(String[] args) {
boolean all_right;
boolean disabled;
boolean tests_disabled;
all_right = true;
tests_disabled = false;
String[] p0;
int[] p1;
int[] p2;
int p3;
double p4;
// ----- test 0 -----
disabled = true;
p0 = new String[] { "1" };
p1 = new int[] { 1 };
p2 = new int[] { 1 };
p3 = 0;
p4 = 0.5D;
all_right = (disabled || KawigiEdit_RunTest(0, p0, p1, p2, p3, true, p4)) && all_right;
tests_disabled = tests_disabled || disabled;
// ------------------
// ----- test 1 -----
disabled = true;
p0 = new String[] { "11", "11" };
p1 = new int[] { 60, 40 };
p2 = new int[] { 40, 60 };
p3 = 0;
p4 = 0.6D;
all_right = (disabled || KawigiEdit_RunTest(1, p0, p1, p2, p3, true, p4)) && all_right;
tests_disabled = tests_disabled || disabled;
// ------------------
// ----- test 2 -----
disabled = false;
p0 = new String[] { "11", "11" };
p1 = new int[] { 2, 3 };
p2 = new int[] { 3, 4 };
p3 = 0;
p4 = 0.4285714285714286D;
all_right = (disabled || KawigiEdit_RunTest(2, p0, p1, p2, p3, true, p4)) && all_right;
tests_disabled = tests_disabled || disabled;
// ------------------
// ----- test 3 -----
disabled = false;
p0 = new String[] { "110", "011", "001" };
p1 = new int[] { 2, 1, 10 };
p2 = new int[] { 20, 20, 10 };
p3 = 0;
p4 = 0.405D;
all_right = (disabled || KawigiEdit_RunTest(3, p0, p1, p2, p3, true, p4)) && all_right;
tests_disabled = tests_disabled || disabled;
// ------------------
// ----- test 4 -----
disabled = false;
p0 = new String[] { "111", "111", "011" };
p1 = new int[] { 100, 1, 1 };
p2 = new int[] { 0, 50, 50 };
p3 = 2;
p4 = 0.5D;
all_right = (disabled || KawigiEdit_RunTest(4, p0, p1, p2, p3, true, p4)) && all_right;
tests_disabled = tests_disabled || disabled;
// ------------------
if (all_right) {
if (tests_disabled) {
System.out.println("You're a stud (but some test cases were disabled)!");
} else {
System.out.println("You're a stud (at least on given cases)!");
}
} else {
System.out.println("Some of the test cases had errors.");
}
}
// END KAWIGIEDIT TESTING
}
// Powered by KawigiEdit-pf 2.3.0!