-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathDP_Min_Path_Sum.cpp
More file actions
62 lines (46 loc) · 921 Bytes
/
DP_Min_Path_Sum.cpp
File metadata and controls
62 lines (46 loc) · 921 Bytes
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
#include <bits/stdc++.h>
#define forr(i,a,b) for(int i=a; i<b; i++)
#define rfor(i,a,b) for(int i=a-1; i>=b; i--)
#define pb push_back
#define MX 1e4+5
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
void run_case() {
//
int n, m;
cin >> n >> m;
vvi a;
forr(i, 0, n) {
vi la(m);
forr(j, 0, m)
cin >> la[j];
a.pb(la);
}
vvi dp(n, vi(m, 0));
dp[0][0] = a[0][0];
forr(i, 1, m)
dp[0][i] = dp[0][i-1] + a[0][i];
forr(i, 1, n)
dp[i][0] = dp[i-1][0] + a[i][0];
forr(i, 1, n)
forr(j, 1, m)
dp[i][j] = min(dp[i][j-1], dp[i-1][j]) + a[i][j];
cout << "dp\n";
for(vi idp: dp) {
for(int x: idp)
cout << x << " ";
cout << "\n";
}
cout << dp[n-1][m-1] << "\n";
}
int main() {
//
ios::sync_with_stdio(false);
int tests;
cin >> tests;
while (tests-- > 0)
run_case();
}