Algorithm
You've gotten an n × m sheet of squared paper. Some of its squares are painted. Let's mark the set of all painted squares as A. Set A is connected. Your task is to find the minimum number of squares that we can delete from set A to make it not connected.
A set of painted squares is called connected, if for every two squares a and b from this set there is a sequence of squares from the set, beginning in a and ending in b, such that in this sequence any square, except for the last one, shares a common side with the square that follows next in the sequence. An empty set and a set consisting of exactly one square are connected by definition.
The first input line contains two space-separated integers n and m (1 ≤ n, m ≤ 50) — the sizes of the sheet of paper.
Each of the next n lines contains m characters — the description of the sheet of paper: the j-th character of the i-th line equals either "#", if the corresponding square is painted (belongs to set A), or equals "." if the corresponding square is not painted (does not belong to set A). It is guaranteed that the set of all painted squares A is connected and isn't empty.
On the first line print the minimum number of squares that need to be deleted to make set A not connected. If it is impossible, print -1.
5 4
####
#..#
#..#
#..#
####
2
5 5
#####
#...#
#####
#...#
#####
2
In the first sample you can delete any two squares that do not share a side. After that the set of painted squares is not connected anymore.
The note to the second sample is shown on the figure below. To the left there is a picture of the initial set of squares. To the right there is a set with deleted squares. The deleted squares are marked with crosses.
Code Examples
#1 Code Example with C++ Programming
Code -
C++ Programming
#include <bits/stdc++.h>
using namespace std;
int const N = 51;
int n, m;
int dx[] = {0, 1, 0, -1};
int dy[] = {1, 0, -1, 0};
char s[N][N];
bool vis[N][N];
void DFS(int i, int j) {
vis[i][j] = true;
for(int k = 0, nx, ny; k < 4; ++k) {
nx = i + dx[k];
ny = j + dy[k];
if(nx < 0 || nx >= n || ny < 0 || ny >= m || vis[nx][ny] || s[nx][ny] == '.')
continue;
DFS(nx, ny);
}
}
int main() {
scanf("%d %d", &n, &m);
for(int i = 0; i < n; ++i)
scanf("%s", s[i]);
int tmp = 0;
for(int i = 0; i < n; ++i)
for(int j = 0; j < m; ++j)
tmp += (s[i][j] == '#');
if(tmp <= 2) {
puts("-1");
return 0;
}
for(int i = 0; i < n; ++i)
for(int j = 0; j < m; ++j)
if(s[i][j] == '#') {
memset(vis, false, sizeof vis);
s[i][j] = '.';
int comp = 0;
for(int k = 0; k < n; ++k)
for(int l = 0; l < m; ++l)
if(!vis[k][l] && s[k][l] == '#') {
++comp;
DFS(k, l);
}
if(comp > 1) {
puts("1");
return 0;
}
s[i][j] = '#';
}
puts("2");
return 0;
}Input
####
#..#
#..#
#..#
####
Output
Demonstration
Codeforcess Solution Cutting Figure, A. Cutting Figure ,C,C++, Java, Js and Python , Cutting Figure,Codeforcess Solution