L3-022 地铁一日游

floyd算法建立新图，dfs标记~

#include<bits/stdc++.h>
using namespace std;
const int maxn=;
const int inf=1e9;
int d[maxn][maxn];
vector<int> g[maxn];
bool visit[maxn];
bool isend[maxn];
int N,M,K;
void floyd () {
    for (int k=;k<=N;k++)
    for (int i=;i<=N;i++)
    for (int j=;j<=N;j++)
    if (i!=j) d[i][j]=min(d[i][j],d[i][k]+d[k][j]);
}
void dfs (int s) {
    visit[s]=true;
    for (int i=;i<g[s].size();i++) {
        if (visit[g[s][i]]==false) {
            dfs (g[s][i]);
        }
    }
}
int main () {
    scanf ("%d %d %d",&N,&M,&K);
    int u,v,distance;
    for (int i=;i<=N;i++)
    for (int j=;j<=N;j++)
    d[i][j]=inf;
    for (int i=;i<M;i++) {
        scanf ("%d",&u);
        isend[u]=true;
        while () {
            scanf ("%d %d",&distance,&v);
            d[u][v]=min(d[u][v],distance);
            d[v][u]=d[u][v];
            u=v;
            char ch=getchar ();
            if (ch=='\n') break;
        }
        isend[u]=true;
    }
    floyd ();
    for (int i=;i<=N;i++) {
        unordered_map<int,int> pos;
        for (int j=;j<=N;j++) {
            if (i!=j&&d[i][j]>pos[d[i][j]/K+]&&d[i][j]!=inf)
            pos[d[i][j]/K+]=d[i][j];
        }
        for (int j=;j<=N;j++)
        if (i!=j) {
            if (d[i][j]==pos[d[i][j]/K+]||(isend[j]==true&&d[i][j]!=inf))
            g[i].push_back(j);
        }
    }
    int q;
    scanf ("%d",&q);
    int s;
    for (int i=;i<q;i++) {
        scanf ("%d",&s);
        fill (visit,visit+maxn,false);
        dfs (s);
        int flag=;
        for (int j=;j<=N;j++) {
            if (visit[j]==true) {
                if (flag!=) printf (" ");
                printf ("%d",j);
                flag++;
            }
        }
        printf ("\n");
    }
    return ;
}