传送门
题目描述
分析
经典题了,优先选择路径长度短的路线,在相同路径长度的情况下选择经过点数少的路径,在松弛操作那里多加一个判断即可
代码
#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 = 4e5 + 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 h[N],ne[N],e[N],w[N],idx;
int n,m,n1,n2,k;
PII d[N];
bool st[N];
struct Node{
int d,res;
};
void add(int x,int y,int z){
ne[idx] = h[x],e[idx] = y,w[idx] = z,h[x] = idx++;
}
void spfa(){
queue<int> q;
for(int i = 0;i <= n + 10;i++) d[i] = {INF,INF};
d[0] = {0,0};
q.push(0);
while(q.size()){
int t = q.front();
q.pop();
st[t] = false;
for(int i = h[t];~i;i = ne[i]){
int v = e[i];
if(d[v].fi > d[t].fi + w[i]){
d[v].fi = d[t].fi + w[i];
d[v].se = d[t].se + 1;
if(!st[v]){
q.push(v);
st[v] = true;
}
}
else if(d[v].fi == d[t].fi + w[i] && d[v].se > d[t].se + 1){
d[v].se = d[t].se + 1;
if(!st[v]){
q.push(v);
st[v] = true;
}
}
}
}
}
int main() {
read(n),read(m),read(n1),read(n2),read(k);
memset(h,-1,sizeof h);
for(int i = 1;i <= n1;i++) {
int x;
read(x);
add(0,x,0);
}
for(int i = 1;i <= n2;i++) {
int x;
read(x);
add(x,n + 1,0);
}
while(m--){
int x,y,z;
read(x),read(y),read(z);
add(x,y,z);
}
spfa();
if(d[n + 1].se - 1 < k && d[n + 1].fi != INF) printf("%d\n",k - d[n + 1].se + 1);
else puts("we break up");
return 0;
}
/**
* ┏┓ ┏┓+ +
* ┏┛┻━━━┛┻┓ + +
* ┃ ┃
* ┃ ━ ┃ ++ + + +
* ████━████+
* ◥██◤ ◥██◤ +
* ┃ ┻ ┃
* ┃ ┃ + +
* ┗━┓ ┏━┛
* ┃ ┃ + + + +Code is far away from
* ┃ ┃ + bug with the animal protecting
* ┃ ┗━━━┓ 神兽保佑,代码无bug
* ┃ ┣┓
* ┃ ┏┛
* ┗┓┓┏━┳┓┏┛ + + + +
* ┃┫┫ ┃┫┫
* ┗┻┛ ┗┻┛+ + + +
*/