pipioj 1211: 小镇购物（bfs）

http://www.pipioj.online/problem.php?id=1211

#define IO std::ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define bug(x) cout<<#x<<" is "<<x<<endl
#include <bits/stdc++.h>
#define iter ::iterator
using namespace  std;
typedef long long ll;
typedef pair<int,ll>P;
#define pb push_back
#define mk make_pair
#define se second
#define fi first
#define rs o*2+1
#define ls o*2
const ll mod=1e9+7;
const int N=1e5+5;
int T,n,m,k,s;

int a[N],vis[N],b[N][105];

vector<int>g[N];

void bfs(int x){
    queue<int>q;

    for(int i=1;i<=n;i++){
        if(a[i]==x){
            vis[i]=1;
            b[i][x]=0;
            q.push(i);
        }
    }

    while(!q.empty()){
        int u=q.front();
        q.pop();
        for(int i=0;i<g[u].size();i++){
            int v=g[u][i];
            if(b[v][x]!=-1)continue;
            b[v][x]=b[u][x]+1;
            vis[v]=1;
            q.push(v);
        }
    }



}


int main(){
    IO;
    while(cin>>n>>m>>k>>s){
        for(int i=1;i<=n;i++){
            cin>>a[i];
            vis[i]=0;
            g[i].clear();
            memset(b[i],-1,sizeof(b[i]));
        }
        for(int i=1;i<=m;i++){
            int u,v;
            cin>>u>>v;
            g[u].pb(v);
            g[v].pb(u);
        }
        for(int i=1;i<=k;i++)bfs(i);
        for(int i=1;i<=n;i++){
            ll ans=0;
            sort(b[i]+1,b[i]+1+k);
            for(int j=1;j<=s;j++)ans+=b[i][j];
            if(i==n)cout<<ans<<endl;
            else cout<<ans<<" ";
        }
    }
}