P1141 01迷宫(并查集+dfs)

#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <cmath>
#include <map>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 1000005;
const int INF = 0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false);

char s[1005][1005];
int n, m;
int par[10000005];
int uni[10000005];
int go[4][2] = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};

int find(int x) {
	if (par[x] == x) {
		return x;
	} else {
		return par[x] = find(par[x]);
	}
}

void unite(int x, int y) {
	x = find(x);
	y = find(y);
	if (x != y) {
		uni[x] += uni[y];
		par[y] = x;
	}
	//printf("%d %d %d\n", x, y, uni[x]);
}

int dfs(int x, int y) {
	if (par[x * n + y] != -1) {
		return find(x * n + y);
	}
	par[x * n + y] = x * n + y;
	uni[x * n + y] = 1;
	for (int i = 0; i <= 3; i++) {
		int tx = x + go[i][0];
		int ty = y + go[i][1];
		if (tx >= 1 && tx <= n && ty >= 1 && ty <= n && s[tx][ty] != s[x][y]) {
			unite(x * n + y, dfs(tx, ty));
		}
	}
	return find(x * n + y);
}


int main() {
	memset(par, -1, sizeof(par));
	scanf("%d %d", &n, &m);
	for (int i = 1; i <= n; i++) {
		scanf("%s", s[i] + 1);
	}
	int t1, t2;
	while (m--) {
		scanf("%d %d", &t1, &t2);
		printf("%d\n", uni[dfs(t1, t2)]);
	}
}