-
Notifications
You must be signed in to change notification settings - Fork 0
/
Main.java
157 lines (134 loc) · 3.68 KB
/
Main.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
/*
*
* Author : fcbruce <[email protected]>
*
* Time : Thu 01 Oct 2015 09:57:20 PM CST
*
*/
import java.util.*;
import java.math.*;
import java.io.*;
public class Main {
InputStream in;
PrintWriter out;
void solve() {
while (true) {
int n, m;
try {
n = nextInt();
m = nextInt();
} catch (Exception ex) {
break ;
}
double [][]p1 = new double [n][m];
double [][]p2 = new double [n][m];
double [][]p3 = new double [n][m];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
p1[i][j] = nextDouble();
p2[i][j] = nextDouble();
p3[i][j] = nextDouble();
}
}
double [][]dp = new double [n][m];
for (int i = n - 1; i >= 0; i--) {
for (int j = m - 1; j >= 0; j--) {
if (Math.abs(1 - p1[i][j]) < 1e-8) continue ;
dp[i][j] = 2;
if (j < m - 1) dp[i][j] += dp[i][j + 1] * p2[i][j];
if (i < n - 1) dp[i][j] += dp[i + 1][j] * p3[i][j];
dp[i][j] /= (1 - p1[i][j]);
}
}
out.printf("%.3f", dp[0][0]);
out.println();
}
}
void run() throws Exception {
in = System.in;
out = new PrintWriter(System.out);
solve();
out.flush();
}
public static void main(String[] args) throws Exception { new Main().run(); }
private byte[] inbuf = new byte[1024];
private int lenbuf = 0, ptrbuf = 0;
private int readByte() {
if (lenbuf == -1) throw new InputMismatchException();
if (ptrbuf >= lenbuf){
ptrbuf = 0;
try { lenbuf = in.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
if (lenbuf <= 0) return -1;
}
return inbuf[ptrbuf++];
}
private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
private int skip() { int b; while ((b = readByte()) != -1 && isSpaceChar(b)); return b; }
private double nextDouble() { return Double.parseDouble(nextString()); }
private char nextChar() {
int b = readByte();
if (b==-1) throw new InputMismatchException();
else return (char)b;
}
private String nextString() {
int b = skip();
if (b == -1) throw new InputMismatchException();
StringBuilder sb = new StringBuilder();
while (!(isSpaceChar(b))) { // when nextLine, (isSpaceChar(b) && b != ' ')
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
private char[] nextString(int n) {
char[] buf = new char[n];
int b = skip(), p = 0;
while (p < n && !(isSpaceChar(b))) {
buf[p++] = (char)b;
b = readByte();
}
return n == p ? buf : Arrays.copyOf(buf, p);
}
private int[] nextArray(int n) {
int[] a = new int[n];
for (int i = 0;i < n;i++) a[i] = nextInt();
return a;
}
private int nextInt() {
int num = 0, b;
boolean minus = false;
while ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
if (b == -1) throw new InputMismatchException();
if (b == '-') {
minus = true;
b = readByte();
}
while (true) {
if (b >= '0' && b <= '9') {
num = num * 10 + (b - '0');
} else {
return minus ? -num : num;
}
b = readByte();
}
}
private long nextLong() {
long num = 0;
int b;
boolean minus = false;
while ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
if (b == -1) throw new InputMismatchException();
if (b == '-'){
minus = true;
b = readByte();
}
while (true) {
if (b >= '0' && b <= '9') {
num = num * 10 + (b - '0');
} else {
return minus ? -num : num;
}
b = readByte();
}
}
}