Codeforces Contest 1105 problem D Kilani and the Game —— bfs多种类，多元点走迷宫

Kilani is playing a game with his friends. This game can be represented as a grid of size n×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 i can expand from a cell with his castle to the empty cell if it’s possible to reach it in at most si (where si 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 n, m and p (1≤n,m≤1000, 1≤p≤9) — the size of the grid and the number of players.

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

The following n lines describe the game grid. Each of them consists of m symbols, where ‘.’ denotes an empty cell, ‘#’ denotes a blocked cell and digit x (1≤x≤p) denotes the castle owned by player x.

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

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

Examples
inputCopy
3 3 2
1 1
1…
…
…2
outputCopy
6 3
inputCopy
3 4 4
1 1 1 1
…
#…
1234
outputCopy
1 4 3 3

题意：

给你n*m的迷宫，.是能走的，#是不能走的，数字代表 是这个位置的起始位置，相同的数字可能有多个，每个数字每次能走的最远距离告诉你，走的顺序按编号从小到大，问你每种数字最后最多能有多少个。

题解：

第一层for是表示当前进行到第几轮，每种都要多元点开始，否则会造成一个问题：

先走左边的点再走右边得点的话，灰色区域就是右边明明能到，但却到不了的位置。
因为它只有9个点，所以可以开9个队列。

#include<bits/stdc++.h>
using namespace std;
#define pa pair<int,int>
const int N=1e3+5;
char Map[N][N];
int spe[10],cnt[10],n,m;
struct node
{
    int x,y,round;
};
int xmov[]={1,0,-1,0};
int ymov[]={0,1,0,-1};
queue<node>Q[10];
int main()
{
    int num;
    scanf("%d%d%d",&n,&m,&num);
    for(int i=1;i<=num;i++)
        scanf("%d",&spe[i]);
    for(int i=1;i<=n;i++)
    {
        scanf("%s",Map[i]+1);
        for(int j=1;j<=m;j++)
        {
            if('1'<=Map[i][j]&&Map[i][j]<='9')
                Q[Map[i][j]-'0'].push({i,j,0}),cnt[Map[i][j]-'0']++;
        }
    }
    int End=1;
    for(int round=1;End;round++)
    {
        End=0;
        for(int i=1;i<=num;i++)
        {
            while(!Q[i].empty()&&Q[i].front().round<round*spe[i])
            {
                node u=Q[i].front();
                Q[i].pop();
                for(int j=0;j<4;j++)
                {
                    int nx=u.x+xmov[j];
                    int ny=u.y+ymov[j];
                    if(Map[nx][ny]=='.')
                    {
                        Q[i].push({nx,ny,u.round+1}),Map[nx][ny]='#',cnt[i]++;
                        /*for(int i=1;i<=n;i++)
                            for(int j=1;j<=m;j++)
                                printf("%c%c",Map[i][j],j==m?'\n':' ');*/
                    }
                }
            }
            End|=Q[i].size();
        }
    }

    for(int i=1;i<=num;i++)
        printf("%d%c",cnt[i],i==num?'\n':' ');
    return 0;
}