Problem Description：
After years as a brick-layer, you‘ve been called upon to analyze the structural integrity of various brick walls built by the Tetrad Corporation. Instead
of using regular-sized bricks, the Tetrad Corporation seems overly fond of bricks made out of strange shapes. The structural integrity of a wall can be
approximated by the fewest number of bricks that could be removed to create a gap from the top to the bottom. Can you determine that number for
various odd walls created by Tetrad?
Input:
Input to this problem will begin with a line containing a single integer X (1 ≤ X ≤ 100) indicating the number of data sets. Each data set consists of
two components:
A single line, "M N" (1 ≤ M,N ≤ 20) where M and N indicate the height and width (in units), respectively, of a brick wall;
A series of M lines, each N alphabetic characters in length. Each character will indicate to which brick that unit of the wall belongs to. Note
that bricks will be contiguous; each unit of a brick will be adjacent (diagonals do not count as adjacent) to another unit of that brick. Multiple
bricks may use the same characters for their representation, but any bricks that use identical characters will not be adjacent to each other. All
letters will be uppercase.
Output:
For each data set, output the fewest number of bricks to remove to create a gap that leads from some point at the top of the wall, to some point at the
bottom of the wall. Assume that bricks are in fixed locations and do not "fall" if bricks are removed from beneath them. A gap consists of contiguous
units of removed bricks; each unit of a gap must be adjacent (diagonals do not count) to another unit of the gap.
Sample Input:
3
5 7
AABBCCD
EFFGGHH
IIJJKKL
MNNOOPP
QQRRSST
5 7
AABBCCD
AFFBGGD
IIJBKKD
MNNOOPD
QQRRSST
6 7
ABCDEAB
ABCFEAB
AEAABAB
ACDAEEB
FFGAHIJ
KLMANOP
Sample Output:
5 2 2
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <vector>
#include <queue>
#include <stack>
#include <algorithm>
using namespace std;
const int MAXN = 100 + 10;
const int INF = 0x3f3f3f3f;
char m[MAXN][MAXN];
int N, M;
int step[MAXN][MAXN];
int dir[4][2] = {{-1, 0}, {1, 0}, {0, 1}, {0, -1}};
struct Point
{
int x, y;
int step;
bool operator > (const Point& rhs) const
{
return step > rhs.step;
}
};
int bfs()
{
for(int i=0;i<=N;i++)
{
for(int j=0;j<=M;j++)
step[i][j] = INF;
}
priority_queue<Point, vector<Point>, greater<Point> > Q;
Point pre, now;
for(int i=1;i<=M;i++)
{
pre.x = 1;
pre.y = i;
pre.step = 1;
Q.push(pre);
}
while(!Q.empty())
{
pre = Q.top();
Q.pop();
if(pre.x == N) return pre.step;
for(int i=0;i<4;i++)
{
now.x = pre.x + dir[i][0];
now.y = pre.y + dir[i][1];
now.step = pre.step;
if(now.x < 1 || now.x > N || now.y < 1 || now.y > M)
continue;
if(m[now.x][now.y] != m[pre.x][pre.y])
now.step++;
if(step[now.x][now.y] > now.step)
{
step[now.x][now.y] = now.step;
Q.push(now);
}
}
}
return 1;
}
int main()
{
int T;
scanf("%d", &T);
while(T--)
{
scanf("%d%d", &N, &M);
for(int i=1;i<=N;i++)
scanf("%s", m[i] + 1);
int ans = bfs();
printf("%d\n", ans);
}
return 0;
}