Meeting （完全图 + 最段路）

#pragma GCC optimize(3,"Ofast","inline")//O3优化
#pragma GCC optimize(2)//O2优化
#include <algorithm>
#include <string>
#include <string.h>
#include <vector>
#include <map>
#include <stack>
#include <set>
#include <queue>
#include <math.h>
#include <cstdio>
#include <iomanip>
#include <time.h>
#include <bitset>
#include <cmath>
#include <sstream>
#include <iostream>
#include <cstring>

#define LL long long
#define ls nod<<1
#define rs (nod<<1)+1
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define INF 0x3f3f3f3f
#define max(a,b) (a>b?a:b)
#define min(a,b) (a<b?a:b)

const double eps = 1e-10;
const int maxn = 2e6 + 10;
const LL mod = 1e9 + 7;

int sgn(double a){return a < -eps ? -1 : a < eps ? 0 : 1;}
using namespace std;

int head[maxn];
int dis1[maxn],dis2[maxn];
bool vis[maxn];
int cnt;

struct Edge{
    int to,next,val;
}edge[maxn];



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

void add_edge(int u,int v,int w){
    edge[cnt].to = v;
    edge[cnt].val = w;
    edge[cnt].next = head[u];
    head[u] = cnt++;
}

void dijstra(int s,int dist[])
{
    for (int i = 0;i < maxn;i++)
        dist[i] = INF;
    memset(vis,false, sizeof(vis));
    priority_queue<pii,vector<pii>,greater<pii>> q;
    dist[s] = 0;
    q.push({dist[s],s});
    while (!q.empty())
    {
        int now = q.top().second;
        q.pop();
        if (vis[now])
            continue;
        vis[now] = true;
        for (int i=head[now];i!=-1;i=edge[i].next)
        {
            int v = edge[i].to;
            if (dist[v]>dist[now]+edge[i].val)
            {
                dist[v] = dist[now] + edge[i].val;
                q.push({dist[v],v});
            }
        }
    }
}

int main() {
    int T;
    scanf("%d",&T);
    int t = 1;
    while (T--) {
        int n,m;
        scanf("%d%d",&n,&m);
        init();
        for (int i = 1;i <= m;i++) {
            int v;int s;
            scanf("%d%d",&v,&s);
            for (int k = 1;k <= s;k++) {
                int y;
                scanf("%d",&y);
                add_edge(n+i,y,v);
                add_edge(y,n+i,v);
            }
        }
        dijstra(1,dis1);
        dijstra(n,dis2);
        printf("Case #%d: ",t++);
        int ans = INF;
        for (int i = 1;i <= n;i++) {
            ans = min(max(dis1[i],dis2[i]),ans);
        }
        if (ans >= INF) {
            printf("Evil John\n");
            continue;
        }
        printf("%.0lf\n",ans/2.0);
        bool fl = false;
        for (int i = 1;i <= n;i++) {
            if (dis1[i] <= ans && dis2[i] <= ans) {
                if (!fl) {
                    printf("%d", i);
                    fl = true;
                }
                else 
                    printf(" %d",i);
            }
        }
        printf("\n");
    }
    return 0;
}