D. Kilani and the Game

Problem - 1105D - Codeforceshttps://codeforces.com/problemset/problem/1105/D

D. Kilani and the Game

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Kilani is playing a game with his friends. This game can be represented as a grid of size n×mn×m, where each cell is either empty or blocked, and every player has one or more castles in some cells (there are no two castles in one cell).

The game is played in rounds. In each round players expand turn by turn: firstly, the first player expands, then the second player expands and so on. The expansion happens as follows: for each castle the player owns now, he tries to expand into the empty cells nearby. The player ii can expand from a cell with his castle to the empty cell if it's possible to reach it in at most sisi (where sisi is player's expansion speed) moves to the left, up, right or down without going through blocked cells or cells occupied by some other player's castle. The player examines the set of cells he can expand to and builds a castle in each of them at once. The turned is passed to the next player after that.

The game ends when no player can make a move. You are given the game field and speed of the expansion for each player. Kilani wants to know for each player how many cells he will control (have a castle their) after the game ends.

Input

The first line contains three integers nn, mm and pp (1≤n,m≤10001≤n,m≤1000, 1≤p≤91≤p≤9) — the size of the grid and the number of players.

The second line contains pp integers sisi (1≤s≤1091≤s≤109) — the speed of the expansion for every player.

The following nn lines describe the game grid. Each of them consists of mm symbols, where '.' denotes an empty cell, '#' denotes a blocked cell and digit xx (1≤x≤p1≤x≤p) denotes the castle owned by player xx.

It is guaranteed, that each player has at least one castle on the grid.

Output

Print pp integers — the number of cells controlled by each player after the game ends.

Examples

input

Copy

3 3 2
1 1
1..
...
..2

output

Copy

6 3 

input

Copy

3 4 4
1 1 1 1
....
#...
1234

output

Copy

1 4 3 3 

Note

The picture below show the game before it started, the game after the first round and game after the second round in the first example:

In the second example, the first player is "blocked" so he will not capture new cells for the entire game. All other player will expand up during the first two rounds and in the third round only the second player will move to the left.

#include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
#include<stack>
using namespace std;
int n, m, p;
typedef pair<int, int> point;
int dirx[] = { 0,0,1,-1 };
int diry[] = { 1,-1,0,0 };
int speed[15];
int graph[1005][1005];
vector<point> person_point[15];
int ans[15];
void  bfs(int p);
bool flag = false;
bool flag1 = true;
int main() {
	cin >> n >> m >> p;
	for (int cnt = 1; cnt <= p; cnt++)
		cin >> speed[cnt];
	for (int cnt = 0; cnt < n; cnt++) {//构造图
		for (int cnt1 = 0; cnt1 < m; cnt1++) {
			char temp;
			point temp_point;
			cin >> temp;
			if (temp >= '1' && temp <= '9') {
				int temp1 = temp - '0';
				graph[cnt][cnt1] = temp1;
				temp_point.first = cnt;
				temp_point.second = cnt1;
				person_point[temp1].push_back(temp_point);
				ans[temp1]++;
			}
			else if (temp == '.')
				graph[cnt][cnt1] = 0;
			else if (temp == '#')
				graph[cnt][cnt1] = 999999;

		}
	}
	int i = 0;
	while (1)
	{
		bool flag = false;
		for (int cnt = 1; cnt <= p; cnt++) {
			for (int cnt1 = 0; cnt1 < speed[cnt]; cnt1++) {
				bfs(cnt);
				flag |= flag1;
				if (!flag1)
					break;
			}
		}
		if (!flag)
			break;
	}
	for (int cnt = 1; cnt <= p; cnt++)
		cout << ans[cnt] << (cnt != p ? " " : "");
	return 0;
}
void  bfs(int p) {
	int size = person_point[p].size();
	vector<point> q;
	q.resize(size);
	for (int cnt = 0; cnt < size; cnt++)
		q[cnt] = person_point[p][cnt];
	person_point[p].clear();
	for (int cnt = 0; cnt < size; cnt++) {
		point now = q[cnt];
		int now_y = now.first;
		int now_x = now.second;
		for (int cnt1 = 0; cnt1 < 4; cnt1++) {
			int nex = now_x + dirx[cnt1];
			int ney = now_y + diry[cnt1];
			if (nex<0 || ney < 0 || nex>m - 1 || ney>n - 1)
				continue;
			now.first = ney;
			now.second = nex;
			if (graph[ney][nex] == 0) {
				graph[ney][nex] = p;
				person_point[p].push_back(now);
				ans[p]++;
			}
		}
	}
	if (person_point[p].empty())
		flag1 = false;
	else
		flag1 = true;
}

 多元bfs拓展,需要一个变量能够存储坐标,所以我自定义了一个,需要一个坐标数组收集每一个人的当前可走的点,为了方便起见,将字符转化为整型变量然后存储到图中.