【NOJ1144】【算法实验二】农场灌溉问题

1144.农场灌溉问题

时限：1000ms 内存限制：10000K 总时限：3000ms

描述

一农场由图所示的十一种小方块组成，蓝色线条为灌溉渠。若相邻两块的灌溉渠相连则只需一口水井灌溉。

输入

给出（m，n）表示农场大小，若干由字母表示的农场图（最大不超过50×50）

m==-1&&n==-1表示结束

输出

编程求出最小需要打的井数。每个测例的输出占一行。当M=N=-1时结束程序。

#include <iostream>

using namespace std;
 
struct node
{
    char ch;
    int visit;
    int left,right,up,down;
}map[100][100];
 
int n,m;
int dir[4][2] = {{1,0},{-1,0},{0,-1},{0,1}};
 
bool place(int x,int y,int nx,int ny)
{
    if(nx > 0 && nx <= m && ny > 0 && ny <= n && !map[nx][ny].visit)
    {
        if(nx == x && ny == y - 1 && map[x][y].left && map[nx][ny].right)
            return 1;
        if(nx == x && ny == y + 1 && map[x][y].right && map[nx][ny].left)
            return 1;
        if(nx == x - 1 && ny == y && map[x][y].up && map[nx][ny].down)
            return 1;
        if(nx == x + 1 && ny == y && map[x][y].down && map[nx][ny].up)
            return 1;
    }
    return 0;
}
 
void dfs(int x,int y)
{
	int i;
    map[x][y].visit = 1;
    for(i = 0;i < 4;i ++)
    {
        int nx = x + dir[i][0];
        int ny = y + dir[i][1];
        if(place(x,y,nx,ny))
            dfs(nx,ny);
    }
}
 
int main()
{
    while(cin >> m >> n && (m != -1 && n != -1))
    {
    	int i,j;
        int cnt = 0;
        for(i = 1;i <= m;i ++)
        {
            for(j = 1;j <= n;j ++)
            {
                cin >> map[i][j].ch;
                map[i][j].visit = 0;
                map[i][j].down = 0;
                map[i][j].up = 0;
                map[i][j].right = 0;
                map[i][j].left = 0;
                if(map[i][j].ch == 'A')
                    map[i][j].up = map[i][j].left = 1;
                else if(map[i][j].ch == 'B')
                    map[i][j].up = map[i][j].right = 1;
                else if(map[i][j].ch == 'C')
                    map[i][j].left = map[i][j].down = 1;
                else if(map[i][j].ch == 'D')
                    map[i][j].right = map[i][j].down = 1;
                else if(map[i][j].ch == 'E')
                    map[i][j].down = map[i][j].up = 1;
                else if(map[i][j].ch == 'F')
                    map[i][j].right = map[i][j].left = 1;
                else if(map[i][j].ch == 'G')
                    map[i][j].right = map[i][j].left = map[i][j].up = 1;
                else if(map[i][j].ch == 'H')
                    map[i][j].up = map[i][j].down = map[i][j].left = 1;
                else if(map[i][j].ch == 'I')
                    map[i][j].left = map[i][j].right = map[i][j].down = 1;
                else if(map[i][j].ch == 'J')
                    map[i][j].up = map[i][j].down = map[i][j].right = 1;
                else if(map[i][j].ch == 'K')
                    map[i][j].up = map[i][j].down = map[i][j].right = map[i][j].left = 1;
            }
        }
        int p,q;
        for(p = 1;p <= m;p ++)
        {
            for(q = 1;q <= n;q ++)
            {
                if(!map[p][q].visit)
                {
                    dfs(p,q);
                    cnt ++;
                }
            }
        }
        cout << cnt << endl;
    }
    return 0;
}