URAL 1072 Routing(最短路)

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <string>
#include <stack>
#include <queue>
#include <vector>
#define inf 0x3f3f3f3f
#define met(a,b) memset(a,b,sizeof a)
typedef long long ll;
using namespace std;
const int N = 105;
const int M = 24005;
long long yu[N][6];
int map[N][N];
int len[N];
int a[N],n;
bool check(int x,int y) {
    for(int i=0; i<a[x]; i++)
        for(int k=0; k<a[y]; k++)
            if( yu[x][i] == yu[y][k] )
                return true;
    return false;
}
int pre[N];
void output(int t) {
    if( pre[t] == -1 ) return;
    output(pre[t]);
    printf(" %d",t);
}
void Dijkstra(int s,int t) {
    bool used[N];
    int dis[N];
    memset(used,false,sizeof(used));
    fill(dis,dis+N,INT_MAX);
    memset(pre,-1,sizeof(pre));
    dis[s] = 0;
    used[s] = true;
    int now = s;
    for(int i=0; i<n; i++) {
        for(int k=1; k<=n; k++)
            if( map[now][k] && dis[k] > dis[now] + 1 ) {
                dis[k] = dis[now] + 1;
                pre[k] = now;
            }
        int mmin = INT_MAX;
        for(int k=1; k<=n; k++)
            if( !used[k] && dis[k] < mmin )
                mmin = dis[now = k];
        used[now] = 1;
    }
    if( dis[t] == INT_MAX ) {
        printf("No\n");
        return ;
    }
    printf("Yes\n");
    printf("%d",s);
    output(t);
    printf("\n");
}
int main() {
    int t1[5],t2[5],s,t;
    scanf("%d",&n);
    memset(len,0,sizeof(len));
    memset(yu,0,sizeof(yu));
    memset(map,0,sizeof(map));
    for(int i=1; i<=n; i++) {
        scanf("%d",&a[i]);
        for(int k=0; k<a[i]; k++) {
            scanf("%d.%d.%d.%d",&t1[0],&t1[1],&t1[2],&t1[3]);
            scanf("%d.%d.%d.%d",&t2[0],&t2[1],&t2[2],&t2[3]);
            for(int p=0; p<4; p++) {
                yu[i][k] *= 1000;
                yu[i][k] += ( t1[p] & t2[p] );
            }
        }
        for(int k=1; k<i; k++)
            if( check(k,i) )
                map[i][k] = map[k][i] = 1;
    }
    scanf("%d %d",&s,&t);
    Dijkstra(s,t);

    return 0;
}