51nod3221祝寿(反向建图优化)

题目链接

感觉忘记了好多东西。 求有向图中其余点到一个点的最短距离可以将该图翻转后run dijkstra

 #include<bits/stdc++.h>
#include<stdlib.h>
#include<algorithm>
#include<stdio.h>
#include<string.h>
#include<queue>
#include<time.h>
#include <cstdio>
#include <iostream>
#include <vector>
#define ll long long
#define int long long
#define inf 0x3f3f3f3f
#define mods 1000000007
#define modd 998244353
#define PI acos(-1)
#define fi first
#define se second
#define lowbit(x) (x&(-x))
#define mp make_pair
#define pb push_back
#define si size()
#define E exp(1.0)
#define fixed cout.setf(ios::fixed)
#define fixeds(x) setprecision(x)
#define IOS ios::sync_with_stdio(false);cin.tie(0)
 using namespace std;
 ll gcd(ll a,ll b){if(a<0)a=-a;if(b<0)b=-b;return b==0?a:gcd(b,a%b);}
template<typename T>void read(T &res){bool flag=false;char ch;while(!isdigit(ch=getchar()))(ch=='-')&&(flag=true);
for(res=ch-48;isdigit(ch=getchar());res=(res<<1)+(res<<3)+ch - 48);flag&&(res=-res);}
ll lcm(ll a,ll b){return a*b/gcd(a,b);}
ll qp(ll a,ll b,ll mod){ll ans=1;if(b==0){return ans%mod;}while(b){if(b%2==1){b--;ans=ans*a%mod;}a=a*a%mod;b=b/2;}return ans%mod;}//快速幂%
ll qpn(ll a,ll b, ll p){ll ans = 1;a%=p;while(b){if(b&1){ans = (ans*a)%p;--b;}a =(a*a)%p;b >>= 1;}return ans%p;}//逆元   (分子*qp(分母,mod-2,mod))%mod;


const int manx=1e4+500;
const int mamx=2e5+5;

ll head[3][manx],d[3][manx];
bool vis[3][manx];


ll n,m,s,e,kk,ans;
ll k[3];

struct node{
    ll v,next,w;
}a[3][mamx];
void add(ll u,ll v,ll w,ll pos)
{
    a[pos][++k[pos]].next=head[pos][u];
    a[pos][k[pos]].w=w;
    a[pos][k[pos]].v=v;
    head[pos][u]=k[pos];
}
void dij(ll pos)
{
    memset(d[pos],inf,sizeof(d[pos]));
  //  memset(vis[pos],0,sizeof(vis[pos]));
    d[pos][s]=0;
    priority_queue<pair<ll,ll> >q;
    q.push(mp(0,s));
    while(q.size()){
        ll u=q.top().se;
        q.pop();
     //   if(vis[u]&&u==s)return ;
        if(vis[pos][u]) continue;
        vis[pos][u]=1;

        for(int i=head[pos][u];i;i=a[pos][i].next){
            ll v=a[pos][i].v,w=a[pos][i].w;
           if(d[pos][v]>d[pos][u]+w){
          //printf("qwq %lld\n",d[v]);      //松弛操作，更新距离
            d[pos][v]=d[pos][u]+w;
           // printf("sad %lld %lld %lld %lld\n",d[u],u,res,d[v]);
            q.push(mp(-d[pos][v],v)); //把更新的距离和点入队，这里距离取负变成小根堆
            }

        }
    }
}

ll now[11111];
signed main(){

 read(n);
 read(m);
 ll pos;
 read(pos);
 for(int i=1;i<=m;i++){
    ll x,y,z;
    read(x);
    read(y);
    read(z);
    add(x,y,z,2);
    add(y,x,z,1);
 }

   s=pos;
   dij(2);
   // k=0;
   dij(1);
   for(int i=1;i<=n;i++){

    //printf("Q%lld %lld\n",d[2][i],d[1][i]);
    if(d[2][i]+d[1][i]<inf){
       printf("%lld\n",d[2][i]+d[1][i]);
     continue;
    }
    printf("impossible\n");

   }



}