Algorithms/aise.cpp at master · Tejas988/Algorithms · GitHub

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
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const ll MOD = 1e9 + 7;
ll dp[501][501][11];
ll v[501][501];
ll h[501][501];
ll n,m,k;

bool isvalid(ll i,ll j)
{
  if(i>=0 and i<n and j>=0 and j<m)
    return true;
  return false;
}


ll dfs(ll i,ll j,ll c)
{
  if(c==0)
    return 0;
  if(dp[i][j][c]!=-1)
  {

    return dp[i][j][c];
  }
  //up
  ll u=1e9;
  ll d=1e9;
  ll l=1e9;
  ll r=1e9;
  if(isvalid(i-1,j))
  {
    u=v[i-1][j]+dfs(i-1,j,c-1);
  }
  if(isvalid(i+1,j))
  {
    d=v[i][j]+dfs(i+1,j,c-1);
  }
  if(isvalid(i,j+1))
  {
    r=h[i][j]+dfs(i,j+1,c-1);
  }
  if(isvalid(i,j-1))
  {
    l=h[i][j-1]+dfs(i,j-1,c-1);
  }
  int x=min({u,d,l,r});
  if(x==0)
  {
    // cout<<i<<" "<<j<<" "<<c<<endl;
  }
  return dp[i][j][c]=x;
}


void solve()
{

  cin>>n>>m>>k;
  memset(dp,-1,sizeof dp);
  for(ll i=0;i<=n;i++)
  {
    for(ll j=0;j<=n;j++)
    {
      v[i][j]=0;
      h[i][j]=0;

    }
  }

  for(ll i=0;i<n;i++)
  {
    for(ll j=0;j<m-1;j++)
    {
      cin>>h[i][j];
    }
  }
  for(ll i=0;i<n-1;i++)
  {
    for(ll j=0;j<m;j++)
    {
      cin>>v[i][j];
    }
  }
  for(ll i=0;i<n;i++)
  {
    for(ll j=0;j<m;j++)
    {
      if(k&1)
      {
        cout<<-1<<" ";
      }
      else
      {
        // cout<<k<<" ";

        cout<<2LL*dfs(i,j,k/2)<<" ";
      }
    }
    cout<<endl;
  }
  return;
}


signed main()
{
#ifndef ONLINE_JUDGE
  freopen("in.txt", "r", stdin);
  freopen("o.txt", "w", stdout);
#endif
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ll t = 1;
  // cin >> t;
// init();
  for (ll i = 1; i <= t; i++)
  {
    solve();
  }
  return 0;
}