https://ac.nowcoder.com/acm/contest/699/E
题意:给一个图和k条边(机票),可以任选一条使得其距离变成0;问最短路;
思路:距离d[i][0]表示还没使用机票,d[i][1]表示使用了机票;每次更新的点都要再进队列更新,如果是要钱的路就用没用机票都要判断更新,如果是免费的路就更新使用的距离;
#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstdio>
#include<map>
#include<stack>
#include<string>
#include<bits/stdc++.h>
using namespace std;
#define sfi(i) scanf("%d",&i)
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-16
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
ll gcd(ll a,ll b){while(b^=a^=b^=a%=b);return a;}
const int maxn=1e5+9;
const int mod=10007;
inline ll read()
{
ll f=1,x=0;
char ss=getchar();
while(ss<'0'||ss>'9')
{
if(ss=='-')f=-1;ss=getchar();
}
while(ss>='0'&&ss<='9')
{
x=x*10+ss-'0';ss=getchar();
} return f*x;
}
int n,m,k;
int s,e;
struct E
{
int to;
int cost;
E(int _to,int _cost){to=_to,cost=_cost;}
bool operator<(const E&b)const
{
return cost>b.cost;
}
};
vector<E>g[maxn];
int d[maxn][2];
bool vis[maxn];
priority_queue<E>que;
void dj(int s)
{
mem(vis,0);
que.push(E(s,0));
for(int i=0;i<=n;i++) d[i][0]=d[i][1]=INF;
d[s][0]=d[s][1]=0;
vis[s]=1;
while(!que.empty())
{
E t=que.top();
que.pop();
int u=t.to;
vis[u]=0;
for(int i=0;i<g[u].size();i++)
{
int v=g[u][i].to;
int ctt=g[u][i].cost;
if(ctt)
{
if(d[v][0]>d[u][0]+ctt)
{
d[v][0]=d[u][0]+ctt;
if(!vis[v])
{
que.push(E(v,d[v][0]));
vis[v]=1;
}
}
if(d[v][1]>d[u][1]+ctt)
{
d[v][1]=d[u][1]+ctt;
if(!vis[v])
{
que.push(E(v,d[v][1]));
vis[v]=1;
}
}
}
else
{
if(d[v][1]>d[u][0])
{
d[v][1]=d[u][0];
if(!vis[v])
{
que.push(E(v,d[v][1]));
vis[v]=1;
}
}
}
}
}
}
int main()
{
//FAST_IO;
//freopen("input.txt","r",stdin);
cin>>n>>s>>e;
cin>>m;
while(m--)
{
int u,v,c;
cin>>u>>v>>c;
g[u].pb(E(v,c));
g[v].pb(E(u,c));
}
int k;
cin>>k;
for(int i=0;i<k;i++)
{
int u,v;
cin>>u>>v;
g[u].pb(E(v,0));
g[v].pb(E(u,0));
}
dj(s);
/*for(int i=1;i<=n;i++)
{
cout<<d[i][0]<<" "<<d[i][1]<<endl;
}*/
//cout<<d[e][0]<<" "<<d[e][1]<<endl;
if(d[e][0]<=d[e][1])
{
cout<<"No"<<endl;
cout<<d[e][0]<<endl;
}
else
{
cout<<"Yes"<<endl;
cout<<d[e][1]<<endl;
}
return 0;
}