传送门
题目描述
分析
因为每次移动的权值不一样,所以肯定不能用
B
F
S
BFS
BFS求解,不然就是类似于
s
p
f
a
spfa
spfa的写法,容易被卡,所以我们可以去暴力建图然后跑堆优化的dij
怎么建图呢,前面的规则都比较方便处理,至于最后一条,我们可以采用拆点的方法,每个点建一个虚点,相邻的虚点之间的移动代价为1,原点到虚点的代价为1,虚点到原点的代价为0即可
代码
#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 510,M = N * N * 2,P = M * 10;
const ll mod = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
int n,m;
int a[N][N],b[N][N];
int h[M],ne[P],e[P],w[P],idx;
bool st[M];
int d[M];
void add(int x,int y,int z){
ne[idx] = h[x],e[idx] = y,w[idx] = z,h[x] = idx++;
}
int get_id(int x,int y){
return (x - 1) * m + y;
}
void dij(){
memset(d,0x3f,sizeof d);
d[1] = 0;
priority_queue<PII,vector<PII>,greater<PII> > Q;
Q.push(PII(0,1));
while(Q.size()){
PII p = Q.top();
Q.pop();
int t = p.second;
if(st[t]) continue;
st[t] = true;
for(int i = h[t];i != -1;i = ne[i]){
int j = e[i];
if(d[j] > d[t] + w[i]){
d[j] = d[t] + w[i];
Q.push(PII(d[j],j));
}
}
}
}
int main() {
read(n),read(m);
for(int i = 1;i <= n;i++)
for(int j = 1;j < m;j++)
read(a[i][j]);
for(int i = 1;i < n;i++)
for(int j = 1;j <= m;j++)
read(b[i][j]);
memset(h,-1,sizeof h);
for(int i = 1;i <= n;i++)
for(int j = 1;j <= m;j++){
if(j + 1 <= m)add(get_id(i,j),get_id(i,j + 1),a[i][j]);
if(j - 1 >= 1)add(get_id(i,j),get_id(i,j - 1),a[i][j - 1]);
if(i + 1 <= n)add(get_id(i,j),get_id(i + 1,j),b[i][j]);
}
for(int i = 1;i <= n;i++)
for(int j = 1;j <= m;j++){
add(get_id(i,j),get_id(i,j) + n * m,1);
add(get_id(i,j) + n * m,get_id(i,j),0);
if(i > 1) add(get_id(i,j) + n * m,get_id(i - 1,j) + n * m,1);
}
dij();
di(d[get_id(n,m)]);
return 0;
}
/**
* ┏┓ ┏┓+ +
* ┏┛┻━━━┛┻┓ + +
* ┃ ┃
* ┃ ━ ┃ ++ + + +
* ████━████+
* ◥██◤ ◥██◤ +
* ┃ ┻ ┃
* ┃ ┃ + +
* ┗━┓ ┏━┛
* ┃ ┃ + + + +Code is far away from
* ┃ ┃ + bug with the animal protecting
* ┃ ┗━━━┓ 神兽保佑,代码无bug
* ┃ ┣┓
* ┃ ┏┛
* ┗┓┓┏━┳┓┏┛ + + + +
* ┃┫┫ ┃┫┫
* ┗┻┛ ┗┻┛+ + + +
*/