codeforces 987 D. Fair

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, \ldots, 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

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

Output

2 2 2 2 3 

Input

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

Output

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$$$.

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$$$.

【题意】

$$$n$$$个结点，$$$m$$$条边，$$$s$$$种商品，每个结点含有一种商品，且保证所有商品至少被一个结点包含。对于每个结点，选择至少$$$k$$$个结点，使他们包含至少$$$k$$$种商品，且到该结点的总距离和最小。

【思路】

结点和边的数量为1e5，而商品个数只有100，如果从每个结点出发直到寻找$$$k$$$个商品为止，那么这样做其实并不划算，其原因在于很难决定最近的商品在哪条路上，需要搜索到很深的地方，而且含有相同商品的城市会被反复访问。为了节约时间，可以预先从商品出发进行bfs，那么经过的城市都是最近的，这样处理以后每个城市就知道，自己到每个商品的最近距离，要凑齐$$$k$$$个商品只需要选择前k个最小的距离就行了。

【注意】

这里的bfs需要抽象理解一下，假如对$$$i$$$号商品进行bfs，那么第一步就要直接转移到所有含$$$i$$$的城市，然后就是平常的bfs了，每次扩展1个距离，遍历完所有城市后，每个城市就都有一个获得$$$i$$$的最短距离了。

【代码】

 #include<stdio.h>
 #include<queue>
 #include<memory.h>
 #include<algorithm>
 #include<vector>

 using std::queue;
 using std::vector;
 using std::sort;

 vector<int> t[];
 #define N 100005
 vector<int>node[N];
 int cost[N][] = {  };
 int vis[N];
 void bfs(int si) {
     queue<int>help;

     int sz = t[si].size();
     //将含si的所有城市加入到bfs的第一次转移
     for (int i = ; i < sz; ++i) {
         int next=t[si][i];
         help.push(next);
         vis[next] = ;
     }
     //bfs继续转移
     for (int cnt = ; !help.empty();cnt++) {
         int sz = help.size();
         for (int i = ; i < sz; ++i) {
             int next = help.front(); help.pop();
             int nsz = node[next].size();
             for (int t = ; t < nsz; ++t) {
                 int pnext = node[next][t];
                 if (vis[pnext] == )continue;
                 vis[pnext] = ;
                 cost[pnext][si] = cnt;
                 help.push(pnext);
             }
         }
     }
 }

 int main() {
     int n, m, s, k;
     scanf("%d %d %d %d", &n, &m, &s, &k);
     int a0,a1;
     for (int i = ; i <= n; ++i) {
         scanf("%d", &a0);
         t[a0].push_back(i);
     }
     for (int i = ; i < m; ++i) {
         scanf("%d %d", &a0, &a1);
         node[a0].push_back(a1);
         node[a1].push_back(a0);
     }
     for (int i = ; i <= s; ++i) {
         memset(vis, , sizeof vis);
         bfs(i);
     }
     for (int i = ; i <= n; ++i) {
         //排序并选择前k个
         sort(cost[i] + , cost[i] +  + s);
         int sum = ;
         for (int t = ; t <= k; ++t)
             sum += cost[i][t];
         printf("%d ", sum);
     }
 }