HDU 5521 Meeting(最短路)

题目大意：有N个点，两个人，其中一个人住在点1，另一个人住在点n 
有M个点集，集合内的数表示任意两点的距离为dis 
现在问，如果两个人要见面，需要最短距离是多少，有哪几个点能被当成见面点

思路： 做做水题放松放松。。。就建个每个集合建个源点就好了，然后无向图，每条边都是time， 最后答案除以2就行了

#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
typedef long long ll;
const ll inf = 1e18;
const int maxn = 3e6 + 5;
ll dis[2][maxn];
struct node
{
    int v;
    ll w;
    node(){}
    node(int vv, ll ww) : v(vv), w(ww){}
    bool operator < (const node &a) const
    {
        return w > a.w;
    }
};
vector<node> vt[maxn];
int n, m, p[maxn];
void dij(int ss, int tt, int k)
{
    for(int i = 0; i < maxn; i++)
        dis[k][i] = inf;
    dis[k][ss] = 0;
    priority_queue<node> pq;
    pq.push(node(ss,0));
    while(!pq.empty())
    {
        int u = pq.top().v;
        pq.pop();
        for(int i = 0; i < vt[u].size(); i++)
        {
            int v = vt[u][i].v, w = vt[u][i].w;
            if(dis[k][u] + w < dis[k][v])
            {
                dis[k][v] = dis[k][u] + w;
                pq.push(node(v,dis[k][v]));
            }
        }
    }
}
int main()
{
    int _, ca = 1, e, time;
    cin >> _;
    while(_--)
    {
        for(int i = 0; i < maxn; i++)
            vt[i].clear();
        scanf("%d%d", &n, &m);
        int index = n, x;
        for(int i = 1; i <= m; i++)
        {
            index++;
            scanf("%d%d", &time, &e);
            for(int i = 1; i <= e; i++)
            {
                scanf("%lld", &x);
                vt[x].push_back(node(index, time));
                vt[index].push_back(node(x, time));
            }
        }
        dij(1, n, 0);
        dij(n, 1, 1);
        ll ans = inf;
        for(int i = 1; i <= n; i++)
            ans = min(ans, max(dis[0][i], dis[1][i]));
        if(ans == inf)
        {
            printf("Case #%d: Evil John\n", ca++);
            continue;
        }
        int tot = 0;
        for(int i = 1; i <= n; i++)
        {
            if(max(dis[0][i], dis[1][i]) == ans)
                p[++tot] = i;
        }
        sort(p+1, p+1+tot);
        printf("Case #%d: %lld\n", ca++, ans/2);
        for(int i = 1; i <= tot; i++)
            printf("%d%c", p[i], i == tot ? '\n' : ' ');
    }
    return 0;
}