Codeforces Round #485 (Div. 2) D. Fair【bfs预处理】

D. Fair

time limit per test

2 seconds

memory limit per test

512 megabytes

input

standard input

output

standard output

Some company is going to hold a fair in Byteland. There are $n$ towns in Byteland and $m$ two-way roads between towns. Of course, you can reach any town from any other town using roads.

There are $k$ types of goods produced in Byteland and every town produces only one type. To hold a fair you have to bring at least $s$ different types of goods. It costs $d(u,v)$ coins to bring goods from town $u$ to town $v$ where $d(u,v)$ is the length of the shortest path from $u$ to $v$. Length of a path is the number of roads in this path.

The organizers will cover all travel expenses but they can choose the towns to bring goods from. Now they want to calculate minimum expenses to hold a fair in each of $n$ towns.

Input

There are $4$ integers $n$, $m$, $k$, $s$ in the first line of input ($1\le n\le {10}^5$, $0\le m\le {10}^5$, $1\le s\le k\le min(n,100)$) — the number of towns, the number of roads, the number of different types of goods, the number of different types of goods necessary to hold a fair.

In the next line there are $n$ integers $a_1,a_2,\dots ,a_n$ ($1\le a_i\le k$), where $a_i$ is the type of goods produced in the $i$-th town. It is guaranteed that all integers between $1$ and $k$ occur at least once among integers $a_i$.

In the next $m$ lines roads are described. Each road is described by two integers $u$ $v$ ($1\le u,v\le n$, $u\ne v$) — the towns connected by this road. It is guaranteed that there is no more than one road between every two towns. It is guaranteed that you can go from any town to any other town via roads.

Output

Print $n$ numbers, the $i$-th of them is the minimum number of coins you need to spend on travel expenses to hold a fair in town $i$. Separate numbers with spaces.

Examples

input

Copy

5 5 4 3
1 2 4 3 2
1 2
2 3
3 4
4 1
4 5

output

Copy

2 2 2 2 3 

input

Copy

7 6 3 2
1 2 3 3 2 2 1
1 2
2 3
3 4
2 5
5 6
6 7

output

Copy

1 1 1 2 2 1 1 

Note

Let's look at the first sample.

To hold a fair in town $1$ you can bring goods from towns $1$ ($0$ coins), $2$ ($1$ coin) and $4$ ($1$ coin). Total numbers of coins is $2$.

Town $2$: Goods from towns $2$ ($0$), $1$ ($1$), $3$ ($1$). Sum equals $2$.

扫描二维码关注公众号，回复： 1445732 查看本文章

Town $3$: Goods from towns $3$ ($0$), $2$ ($1$), $4$ ($1$). Sum equals $2$.

Town $4$: Goods from towns $4$ ($0$), $1$ ($1$), $5$ ($1$). Sum equals $2$.

Town $5$: Goods from towns $5$ ($0$), $4$ ($1$), $3$ ($2$). Sum equals $3$.

思路：

可以先用bfs计算出每一种商品到每个点的最短距离。最后对每个点的所有商品的距离排序，取最小的s个。

代码：

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
#define inf 0x3f3f3f3f
#define MAXN 100005
int n,m,s,k,a[MAXN],dis[MAXN][105];
vector<int> vec[MAXN],col[105];
struct node
{
    int u,step;
}p;
void bfs(int c)
{
    queue<node> q;
    for(int i=0;i<col[c].size();i++)
    {
        p.u=col[c][i];
        p.step=0;
        dis[p.u][c]=0;
        q.push(p);
    }

    while(!q.empty())
    {
        node top=q.front(); q.pop();
        for(int i=0;i<vec[top.u].size();i++)
        {
            int v=vec[top.u][i];
            if(dis[v][c]<=top.step+1) continue;
            p.u=v;
            p.step=top.step+1;
            dis[v][c]=p.step;
            q.push(p);
        }
    }
}
int main()
{
	scanf("%d%d%d%d",&n,&m,&k,&s);
	for(int i=1;i<=k;i++)
        col[i].clear();
	for(int i=1;i<=n;i++)
    {
        scanf("%d",&a[i]);
        col[a[i]].push_back(i);
    }
    for(int i=0;i<m;i++)
    {
        int u,v;
        scanf("%d%d",&u,&v);
        vec[u].push_back(v);
        vec[v].push_back(u);
    }
    for(int i=1;i<=n;i++)
        for(int j=1;j<=k;j++)
            dis[i][j]=inf;

    for(int i=1;i<=k;i++)
        bfs(i);
    for(int i=1;i<=n;i++)
    {
        sort(dis[i]+1,dis[i]+k+1);
        int ans=0;
        for(int j=1;j<=s;j++)
            ans+=dis[i][j];
        if(i>1) printf(" ");
        printf("%d",ans);
    }
    printf("\n");
	return 0;
}