p1141 搜索+连通块

P1141 迷宫01问题
bfs +连通块

#include <iostream>
#include<queue>
#include <string>

using namespace std;
#define maxn 1005
char map[maxn][maxn];
int vis[maxn][maxn], a[1000001], n, m, x, y, ans;
//保存各个点所在的连通图，以及是否已经处理过，a数组保存各个连通图的大小
int dir[][2] = {{0,  1},
                {0,  -1},
                {1,  0},
                {-1, 0}};

int main() {
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++) {
            cin >> map[i][j];
        }
    int d = 0;
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++)
            if (vis[i][j]==0) {
                d++;
                queue<pair<int, int> > q;
                pair<int, int> t;
                t.first = i;
                t.second = j;
                q.push(t);
                vis[i][j] = d;
                ans = 1;
                while (!q.empty()) {
                    t = q.front();
                    q.pop();
                    for (int k = 0; k < 4; k++) {
                        int nx = t.first + dir[k][0];
                        int ny = t.second + dir[k][1];
                        if (vis[nx][ny]==0 && nx >= 1 && nx <= n && ny >= 1 && ny <= n &&
                            (map[nx][ny] != map[t.first][t.second])) {
                            pair<int, int> tt;
                            tt.first = nx;
                            tt.second = ny;
                            q.push(tt);

                            vis[nx][ny] = d;//标记新位置所在连通图
                            ans++;//计数器
                        }
                    }
                }
                a[d] = ans;//当前连通图能移动多少格
            }
    for (int i = 0; i < m; i++) {
        cin >> x >> y;
        cout << a[vis[x][y]] << endl;
    }
    return 0;
}

dfs+连通块

#include <iostream>
#include <string.h>

using namespace std;
int n, m, a[1000005], vis[1002][1002];
char map[1002][1002];

void dfs(int x, int y, int m, int i) {
    if (x < 0 || x >= n || y < 0 || y >= n || map[x][y] - '0' != m || vis[x][y] != -1)
        return;
    vis[x][y] = i;
    a[i]++;
    dfs(x - 1, y, !m, i);
    dfs(x + 1, y, !m, i);
    dfs(x, y - 1, !m, i);
    dfs(x, y + 1, !m, i);
}

int main() {
    cin >> n >> m;
    for (int i = 0; i < n; i++) {
        cin >> map[i];
    }
    memset(vis, -1, sizeof(vis));
    for (int i = 0; i < m; i++) {
        int x,y;
        cin >> x >> y;
        x--;
        y--;
        if (vis[x][y] == -1)
            dfs(x, y, map[x][y] - '0', i);
        else
            a[i]=a[vis[x][y]];
    }
    for(int i=0;i<m;i++)
        cout<<a[i]<<endl;
    return 0;
}