hdoj 5521 Meeting

题目链接：Meeting

题目大意：给你一个有n个点的图，然后m个关系，每个关系有一些点和一个时间，这些同一个关系里面的点之间互相到达的时间为时间t，现在有两个人同时从1和n点出发没问他们同时到达某个点的最短时间为多少，有多个点全部输出，不能相遇就输出Evil John

题目思路：我们考虑从1和n两个点跑最短路，他们到达某个点的时间就是他们之间的最大时间，然后考虑建边的时候，我们对每一层拆一个点，这个拆点到每个点的时间为t，每个点到它的时间为0，然后跑最短路就好了

#include <map>
#include <set>
#include <cmath>
#include <stack>
#include <queue>
#include <cstdio>
#include <vector>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>

using namespace std;
typedef long long ll;
const int maxn = 1e6+10;
const int inf = 0x3f3f3f3f;

int cnt,head[maxn];ll dis[maxn],dis2[maxn];

struct Edge{
    int v,next;ll w;
    bool operator <(const Edge &rhs) const{
        return w > rhs.w;
    }
}e[maxn*4];

void add(int u,int v,int co){
    e[cnt].v = v;
    e[cnt].w = co;
    e[cnt].next = head[u];
    head[u] = cnt++;
}

void init(){
    cnt = 0;
    memset(head,-1,sizeof(head));
}

void dij(int s,int len){
    priority_queue<Edge>pq;
    for(int i = 1;i <= len;i++) dis[i] = inf;
    bool vis[maxn] = {0};
    dis[s] = 0;
    pq.push((Edge){s,0,0});
    while(!pq.empty()){
        Edge tmp = pq.top();pq.pop();
        if(vis[tmp.v]) continue;
        vis[tmp.v] = 1;
        for(int i = head[tmp.v];~i;i = e[i].next){
            Edge u = e[i];
            if(dis[u.v] > dis[tmp.v]+u.w){
                dis[u.v] = dis[tmp.v]+u.w;
                pq.push((Edge){u.v,0,dis[u.v]});
            }
        }
    }
}

void dij2(int s,int len){
    priority_queue<Edge>pq;
    for(int i = 1;i <= len;i++) dis2[i] = inf;
    bool vis[maxn] = {0};
    dis2[s] = 0;
    pq.push((Edge){s,0,0});
    while(!pq.empty()){
        Edge tmp = pq.top();pq.pop();
        if(vis[tmp.v]) continue;
        vis[tmp.v] = 1;
        for(int i = head[tmp.v];~i;i = e[i].next){
            Edge u = e[i];
            if(dis2[u.v] > dis2[tmp.v]+u.w){
                dis2[u.v] = dis2[tmp.v]+u.w;
                pq.push((Edge){u.v,0,dis2[u.v]});
            }
        }
    }
}

int main(){
    int T,n,m;
    scanf("%d",&T);
    for(int Case = 1;Case <= T;Case++){
        init();
        scanf("%d%d",&n,&m);
        for(int i = 1;i <= m;i++){
            int time,num,x;
            scanf("%d%d",&time,&num);
            while(num--){
                scanf("%d",&x);
                add(i+n,x,time);
                add(x,i+n,0);
            }
        }
        dij(1,n+m);
        dij2(n,n+m);
        ll maxx = inf;
        int se;
        for(int i = 1;i <= n;i++){
            if(maxx >= max(dis[i],dis2[i])) se = i;
            maxx = min(maxx,max(dis[i],dis2[i]));
        }
        if(maxx == inf) {printf("Case #%d: Evil John\n",Case);continue;}
        printf("Case #%d: %d\n",Case,maxx);
        for(int i = 1;i <= n;i++){
            if(maxx == max(dis[i],dis2[i])){
                if(se == i) printf("%d\n",i);
                else printf("%d ",i);
            }
        }
    }
    return 0;
}