思维dp ---- K步最短路 D. Explorer Space

最新推荐文章于 2024-04-30 18:30:00 发布

黑夜和白天

最新推荐文章于 2024-04-30 18:30:00 发布

阅读量134

点赞数

分类专栏：思维dp

本文链接：https://blog.csdn.net/weixin_45630722/article/details/119211523

版权

思维dp 专栏收录该内容

14 篇文章 0 订阅

订阅专栏

题目链接

解题思路：

这题目本质就是求K/2步最短路然后乘以2就可以了因为要回去嘛

如何求k/2步最短路呢？
就是我们 $d p [k] [i] [j]$ 求的是 $k$ 步到 $(i, j)$ 的最短路是多长？
外层枚举 $k$ ，里面枚举 $(i, j)$

#include <bits/stdc++.h>
#define mid ((l + r) >> 1)
#define Lson rt << 1, l , mid
#define Rson rt << 1|1, mid + 1, r
#define ms(a,al) memset(a,al,sizeof(a))
#define log2(a) log(a)/log(2)
#define lowbit(x) ((-x) & x)
#define IOS std::ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define INF 0x3f3f3f3f
#define LLF 0x3f3f3f3f3f3f3f3f
#define f first
#define s second
#define endl '\n'
using namespace std;
const int N = 2e6 + 10, mod = 1e9 + 9;
const int maxn = 500010;
const long double eps = 1e-5;
const int EPS = 500 * 500;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> PII;
typedef pair<ll,ll> PLL;
typedef pair<double,double> PDD;
template<typename T> void read(T &x)
{
   x = 0;char ch = getchar();ll f = 1;
   while(!isdigit(ch)){if(ch == '-')f*=-1;ch=getchar();}
   while(isdigit(ch)){x = x*10+ch-48;ch=getchar();}x*=f;
}
template<typename T, typename... Args> void read(T &first, Args& ... args) 
{
   read(first);
   read(args...);
}
int n, m, k;
int a[501][501];
int b[501][501];
int dp[25][501][501];
inline bool check(int x, int y) {
   if(x < 1 || x > n || y < 1 || y > m) return 0;
   else return 1;
}
int main() {
    IOS;
    cin >> n >> m >> k;
    for(int i = 1; i <= n; ++ i)
      for(int j = 1; j <= m-1; ++ j)
        cin >> a[i][j];

    for(int i = 1; i <= n-1; ++ i)
      for(int j = 1; j <= m; ++ j)
        cin >> b[i][j];

    if(k & 1) {
       for(int i = 1; i <= n; ++ i)
          for(int j = 1; j <= m; ++ j) 
            cout << "-1" << " \n"[j == m];
    } else {
       memset(dp,INF,sizeof(dp));
       for(int i = 1; i <= n; ++ i)
          for(int j = 1; j <= m; ++ j)
            dp[0][i][j] = 0;
   
       for(int i = 1; i <= k / 2; ++ i)
          for(int j = 1; j <= n; ++ j)
             for(int s = 1; s <= m; ++ s) {
                if(check(j-1,s)) dp[i][j][s] = min(dp[i-1][j-1][s]+b[j-1][s],dp[i][j][s]);
                if(check(j+1,s)) dp[i][j][s] = min(dp[i-1][j+1][s]+b[j][s],dp[i][j][s]);
                if(check(j,s+1)) dp[i][j][s] = min(dp[i-1][j][s+1]+a[j][s],dp[i][j][s]);
                if(check(j,s-1)) dp[i][j][s] = min(dp[i-1][j][s-1]+a[j][s-1],dp[i][j][s]);
             } 
       for(int i = 1; i <= n; ++ i) 
          for(int j = 1; j <= m; ++ j)
            cout << dp[k/2][i][j] * 2 << " \n"[j == m];
    }
}