Benny has a spacious farm land to irrigate. The farm land is a rectangle, and is divided into a lot of samll squares. Water pipes are placed in these squares. Different square has a different type of pipe. There are 11 types of pipes, which is marked from A to K, as Figure 1 shows.
Benny has a map of his farm, which is an array of marks denoting the distribution of water pipes over the whole farm. For example, if he has a map
ADC
FJK
IHE
then the water pipes are distributed like
Several wellsprings are found in the center of some squares, so water can flow along the pipes from one square to another. If water flow crosses one square, the whole farm land in this square is irrigated and will have a good harvest in autumn.
Now Benny wants to know at least how many wellsprings should be found to have the whole farm land irrigated. Can you help him?
Note: In the above example, at least 3 wellsprings are needed, as those red points in Figure 2 show.
#include <iostream> #include <cstring> #include <cstdio> #include <map> #define TOP 0 #define RIGHT 1 #define BOTTOM 2 #define LEFT 3 using namespace std; const int N = 55; int f[2550]; char mp[N][N]; map<int, int> mpx; bool mode[11][4] = { {1, 0, 0, 1}, {1, 1, 0, 0}, {0, 0, 1, 1}, {0, 1, 1, 0}, {1, 0, 1, 0}, {0, 1, 0, 1}, {1, 1, 0, 1}, {1, 0, 1, 1}, {0, 1, 1, 1}, {1, 1, 1, 0}, {1, 1, 1, 1} }; int fin(int t) { if(f[t] == -1) return t; return f[t] = fin(f[t]); } void bing(int a, int b) { int t1 = fin(a); int t2 = fin(b); if(t1 != t2) f[t1] = t2; } int main() { char buf[N]; int ans, m, n; // freopen("tmp.in", "r", stdin); while(~scanf("%d%d", &m, &n)) { memset(f, 0xff, sizeof(f)); mpx.clear(); ans = 0; if(m <= 0 || n <= 0) break; for(int i = 1; i <= m; i++) { scanf("%s", buf); for(int j = 1; j <= n; j++) mp[i][j] = buf[j - 1] - 'A'; } for(int i = 1; i <= m; i++) for(int j = 1; j <= n; j++) { if(j != n && mode[mp[i][j]][RIGHT] && mode[mp[i][j + 1]][LEFT]) bing(j + (i - 1) * n, j + 1 + (i - 1) * n); if(i != m && mode[mp[i][j]][BOTTOM] && mode[mp[i + 1][j]][TOP]) bing(j + (i - 1) * n, j + i * n); } int x = m * n; for(int i = 1; i <= x; i++) { int tmp = fin(i); if(mpx.find(tmp) == mpx.end()) { ans++; mpx[tmp] = 1; } } printf("%d\n", ans); } return 0; }