-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathINS14E - Glorious Gamblers.cpp
43 lines (41 loc) · 1.19 KB
/
INS14E - Glorious Gamblers.cpp
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
#include<bits/stdc++.h>
using namespace std;
#define INF 1000000000
#define ll long long
int main()
{
int t;
cin >> t;
while(t--)
{
ll n, m;
cin >> n >> m;
ll a[n][m];
double dp[n+1][m+1];
for(ll i = 0; i < n; i++){
for(ll j = 0; j < m; j++)
cin >> a[i][j];
}
for(ll i = 0; i <= n; i++){
for(ll j = 0; j <= m; j++)
dp[i][j] = 0;
}
for(ll i = n-1; i >= 0; i--){
for(ll j = m-1; j >= 0; j--){
double mx = max({dp[i+1][j], dp[i+1][j+1], dp[i][j+1]});
double mn = min({dp[i+1][j], dp[i+1][j+1], dp[i][j+1]});
dp[i][j] = (double)a[i][j];
if(i == n-1) dp[i][j] += dp[i][j+1];
else if(j == m-1) dp[i][j] += dp[i+1][j];
else {dp[i][j] += (double) (mx+mn)/2.0;}
}
}
/*for(ll i = 0; i <= n; i++){
for(ll j = 0; j <= m; j++)
{
cout << dp[i][j] << " ";
}cout << endl;
}*/
cout << fixed << setprecision(6) << dp[0][0] << endl;
}
}