-
Notifications
You must be signed in to change notification settings - Fork 0
/
tripathcnt.cpp
71 lines (68 loc) · 1.06 KB
/
tripathcnt.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
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
#include <bits/stdc++.h>
using namespace std;
#define FastIO cin.tie(0)->sync_with_stdio(0)
#define endl "\n"
const int MAX = 100;
int T;
int n;
int arr[MAX][MAX];
int dp[MAX][MAX];
int pathDP[MAX][MAX];
void input() {
cin >> n;
for(int i=0; i<n; i++) {
for(int j=0; j<=i; j++) {
cin >> arr[i][j];
}
}
}
int rundp1(int r, int c) {
if(c < 0 || c > n-1) {
return 0;
}
int &ret = dp[r][c];
if(ret != -1) {
return ret;
}
if(r == n-1) {
ret = arr[r][c];
return ret;
}
ret = max(rundp1(r+1, c), rundp1(r+1, c+1));
return ret += arr[r][c];
}
int rundp2(int r, int c) {
if(c < 0 || c > n-1) {
return 0;
}
int &ret = pathDP[r][c];
if(ret != -1) {
return ret;
}
if(r == n-1) {
ret = 1;
return ret;
}
ret = 0;
for(int i=0; i<=1; i++) {
if(arr[r][c] + dp[r+1][c+i] == dp[r][c])
ret += rundp2(r+1, c+i);
}
return ret;
}
void solve() {
memset(dp, -1, sizeof dp);
memset(pathDP, -1, sizeof pathDP);
rundp1(0,0);
rundp2(0,0);
cout << pathDP[0][0] << endl;
}
int main(void) {
FastIO;
cin >> T;
while(T--) {
input();
solve();
}
return 0;
}