一本通1503：道路和航线

最新推荐文章于 2024-08-13 14:56:59 发布

我是小蒟蒻

最新推荐文章于 2024-08-13 14:56:59 发布

阅读量329

点赞数 9

文章标签：算法 c++ 图论

本文链接：https://blog.csdn.net/liu12345635/article/details/136425226

版权

#include<stdio.h>
#include<algorithm>
#include<iostream>
#include<string.h>
#include<vector>
#include<stdlib.h>
#include<math.h>
#include<queue>
#include<deque>
#include<ctype.h>
#include<map>
#include<set>
#include<stack>
#include<string>
#define INF 0x3f3f3f3f
#define FAST_IO ios::sync_with_stdio(false)
const double PI = acos(-1.0);
const double eps = 1e-6;
const int MAX=1e5+10;
const int mod=1e9+7;
typedef long long ll;
using namespace std;
#define gcd(a,b) __gcd(a,b)
inline ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
inline ll qpow(ll a,ll b){ll r=1,t=a; while(b){if(b&1)r=(r*t)%mod;b>>=1;t=(t*t)%mod;}return r;}
inline ll inv1(ll b){return qpow(b,mod-2);}
inline ll exgcd(ll a,ll b,ll &x,ll &y){if(!b){x=1;y=0;return a;}ll r=exgcd(b,a%b,y,x);y-=(a/b)*x;return r;}
inline ll read(){ll x=0,f=1;char c=getchar();for(;!isdigit(c);c=getchar()) if(c=='-') f=-1;for(;isdigit(c);c=getchar()) x=x*10+c-'0';return x*f;}
//freopen( "in.txt" , "r" , stdin );
//freopen( "data.txt" , "w" , stdout );
int n,r,p,s;
int kuai[MAX],sum;
int in[MAX],dis[MAX];
int vis[MAX];
vector<int>comp[MAX];
vector<pair<int,int> >road[MAX],plane[MAX];
void DFS(int x,int sum)
{
    kuai[x]=sum;
    comp[sum].push_back(x);
    for(auto to:road[x])
    {
        if(!kuai[to.first])
            DFS(to.first,sum);
    }
}
int main()
{
    scanf("%d%d%d%d",&n,&r,&p,&s);
    while(r--)
    {
        int u,v,w;
        scanf("%d%d%d",&u,&v,&w);
        road[u].push_back(make_pair(v,w));
        road[v].push_back(make_pair(u,w));
    }
    while(p--)
    {
        int u,v,w;
        scanf("%d%d%d",&u,&v,&w);
        plane[u].push_back(make_pair(v,w));
    }
    for(int i=1;i<=n;i++)
        if(!kuai[i])
            DFS(i,++sum);
    for(int i=1;i<=n;i++)
        for(auto x:plane[i])
            in[kuai[x.first]]++;
    fill(dis+1,dis+1+n,INF);
    dis[s]=0;
    queue<int>Q;
    for(int i=1;i<=sum;i++)
        if(!in[i])
            Q.push(i);

    while(!Q.empty())
    {
        int k=Q.front();
        Q.pop();
        priority_queue<pair<int,int>,vector<pair<int,int> > ,greater<pair<int,int> > >pq;
        for(auto x:comp[k])
            if(dis[x]<INF)
                pq.push(make_pair(dis[x],x));
        while(!pq.empty())
        {
            pair<int,int> k=pq.top();
            pq.pop();
            if(vis[k.second]) continue;
            vis[k.second]=1;
            for(auto x:road[k.second])
                if(x.second+dis[k.second]<dis[x.first])
                    pq.push(make_pair(dis[x.first]=x.second+dis[k.second],x.first));

            for(auto x:plane[k.second])
                dis[x.first]=min(dis[x.first],dis[k.second]+x.second);
        }
        for(auto x:comp[k])
            for(auto t:plane[x])
                if(--in[kuai[t.first]]==0)
                    Q.push(kuai[t.first]);
    }
    for(int i=1;i<=n;i++)
    {
        if(dis[i]==INF)
            printf("NO PATH\n");
        else
            printf("%d\n",dis[i]);
    }
    return 0;
}