hdoj 5521 Meeting 【优先队列 dijkstra】

#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <vector>
#define INF 0x3f3f3f3f
#define eps 1e-8
#define MAXN 100000+10
#define MAXM 50000000
#define Ri(a) scanf("%d", &a)
#define Rl(a) scanf("%lld", &a)
#define Rs(a) scanf("%s", a)
#define Pi(a) printf("%d\n", (a))
#define Pl(a) printf("%lld\n", (a))
#define Ps(a) printf("%s\n", (a))
#define W(a) while(a--)
#define CLR(a, b) memset(a, (b), sizeof(a))
using namespace std;
struct Node{
int d, node;
bool friend operator < (Node a, Node b){
return a.d > b.d;
}
};
vector<int> B[MAXN];
vector<int> G[MAXN];
int n, m;
int T[MAXN];
void getMap()
{
Ri(n), Ri(m);
for(int i = 1; i <= n; i++)
G[i].clear();
for(int i = 1; i <= m; i++)
{
int num;
Ri(T[i]), Ri(num);
B[i].clear();
while(num--)
{
int a; Ri(a);
G[a].push_back(i);
B[i].push_back(a);
}
}
}
int dist[2][MAXN];
bool vis[MAXN];
bool block[MAXN];
void SPFA(int s, int op)
{
priority_queue<Node> Q;
CLR(dist[op], INF); CLR(vis, false); CLR(block, false);
dist[op][s] = 0; Q.push((Node){dist[op][s], s});
while(!Q.empty())
{
int u = Q.top().node;
Q.pop();
if(block[u]) continue;
block[u] = true;
for(int i = 0; i < G[u].size(); i++)
{
int k = G[u][i];
if(vis[k]) continue;
vis[k] = true;
for(int j = 0; j < B[k].size(); j++)
{
int v = B[k][j];
if(dist[op][v] > dist[op][u] + T[k])
{
dist[op][v] = dist[op][u] + T[k];
Q.push((Node){dist[op][v], v});
}
}
}
}
}
vector<int> P;
int kcase = 1;
void solve()
{
getMap();
SPFA(1, 0); SPFA(n, 1);
int ans = INF;
for(int i = 1; i <= n; i++)
{
int need = max(dist[0][i], dist[1][i]);
if(ans > need)
{
ans = need;
P.clear();
}
if(ans == need)
P.push_back(i);
}
printf("Case #%d: ", kcase++);
if(ans == INF)
printf("Evil John\n");
else
{
printf("%d\n", ans);
int top = P.size()-1;
for(int i = 0; i < top; i++)
printf("%d ", P[i]);
printf("%d\n", P[top]);
}
}
int main()
{
int t; Ri(t);
W(t){
solve();
}
return 0;
}