HDU-7134-Public Transport System ( 最短路 + 拆点 )

题目连接：点击进入

题目

题意

待补

思路

还是看官方题解吧，懒~~~

代码

//#pragma GCC optimize(3)//O3
//#pragma GCC optimize(2)//O2
#include<iostream>
#include<string>
#include<map>
#include<set>
//#include<unordered_map>
#include<queue>
#include<cstdio>
#include<vector>
#include<cstring>
#include<stack>
#include<algorithm>
#include<iomanip>
#include<cmath>
#include<fstream>
#define X first
#define Y second
#define base 233 
#define pb push_back
#define INF 0x3f3f3f3f3f3f3f3f
#define pii pair<long long,long long>
#define lowbit(x) x & -x
#define inf 0x3f3f3f3f
//#define int long long
//#define double long double
//#define rep(i,x,y) for(register int i = x; i <= y;++i)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const double pai=acos(-1.0);
const int maxn=1e6+10;
const int mod=1e9+7;
const double eps=1e-9;
const int N=5e3+10;
/*--------------------------------------------*/
inline int read()
{
    int k = 0, f = 1 ;
    char c = getchar() ;
    while(!isdigit(c)){if(c == '-') f = -1 ;c = getchar() ;}
    while(isdigit(c)) k = (k << 1) + (k << 3) + c - 48 ,c = getchar() ;
    return k * f ;
}
/*--------------------------------------------*/

int t,n,m,head[maxn],tot;
ll dis[maxn];
bool vis[maxn];
struct node
{
    int to;
    ll a;
    ll b;
};
struct Node
{
    int to;
    ll val;
    int next;
}edge[maxn];
struct nedge
{
    int to;
    ll a;
    ll b;
    int nc;
};
vector<node>vn[maxn];
vector<nedge>vd[maxn];

bool cmp(nedge x,nedge y)
{
    return x.a<y.a;
}
void add(int u,int v,ll w)
{
    edge[tot].to=v;
    edge[tot].val=w;
    edge[tot].next=head[u];
    head[u]=tot++;
}
void addedge(int u,int v,ll w,ll a)
{
    int len=vd[v].size();
    int l=0,r=len-1,pos=-1;
    while(l<=r)
    {
        int mid=l+r>>1;
        if(vd[v][mid].a>a)
        {
            r=mid-1;
            pos=mid;
        }
        else
            l=mid+1;
    }
    if(pos==-1)
        add(u,v,w);
    else
        add(u,vd[v][pos].nc,w);
}
void dijkstra()
{
    priority_queue<pii,vector<pii>,greater<pii> >q;
    dis[1]=0;
    q.push({dis[1],1});
    while(q.size())
    {
        int now=q.top().second;
        q.pop();
        if(vis[now]) continue;
        vis[now]=1;
        for(int i=head[now];i!=-1;i=edge[i].next)
        {
            int to=edge[i].to;
            ll val=edge[i].val;
            if(dis[to]>dis[now]+val)
            {
                dis[to]=dis[now]+val;
                q.push({dis[to],to});
            }
        }
    }
}

int main() 
{
//    ios::sync_with_stdio(false);
//    cin.tie(0);cout.tie(0);
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&n,&m);
        for(int i=1;i<=m;i++)
        {
            int x,y,a,b; 
            scanf("%d%d%d%d",&x,&y,&a,&b);
            vn[x].push_back({y,a,b});
        }
        int cnt=n;
        for(int i=1;i<=n;i++)
        {
            int len=vn[i].size();
            for(int j=0;j<len;j++)
                vd[i].push_back({vn[i][j].to,vn[i][j].a,vn[i][j].b,++cnt});
            sort(vd[i].begin(),vd[i].end(),cmp);
        }
        tot=0;
        for(int i=0;i<=cnt+1;i++) dis[i]=INF,vis[i]=0,head[i]=-1;
        for(int i=1;i<=n;i++)
        {
            int len=vd[i].size();
            int lcn=vn[i].size();
            for(int j=0;j<lcn;j++)
                addedge(i,vn[i][j].to,vn[i][j].a,vn[i][j].a);
            for(int j=0;j<len;j++)
                addedge(vd[i][j].nc,vd[i][j].to,vd[i][j].a-vd[i][j].b,vd[i][j].a);
            for(int j=0;j<len-1;j++)
                add(vd[i][j].nc,vd[i][j+1].nc,0);
            if(len)
                add(vd[i][len-1].nc,i,0);
        }
        dijkstra();
        for(int i=1;i<=n;i++)
            printf("%lld%c",(dis[i]==INF)?-1ll:dis[i],(i==n)?'\n':' ');
        for(int i=0;i<=n;i++) vn[i].clear(),vd[i].clear();
    }
    return 0;
}