Problem:
Score: 300 points

Problem Statement

We have a canvas divided into a grid with H rows and W columns. The square at the i-th row from the top and the j-th column from the left is represented as (i, j).

Initially, all the squares are white. square1001 wants to draw a picture with black paint. His specific objective is to make Square (i, j) black when s_{i, j}= #, and to make Square (i, j) white when s_{i, j}= ..

However, since he is not a good painter, he can only choose two squares that are horizontally or vertically adjacent and paint those squares black, for some number of times (possibly zero). He may choose squares that are already painted black, in which case the color of those squares remain black.

Determine if square1001 can achieve his objective.

Constraints

H is an integer between 1 and 50 (inclusive).

W is an integer between 1 and 50 (inclusive).

For every (i, j) (1 \leq i \leq H, 1 \leq j \leq W), s_{i, j} is # or ..

Input

Input is given from Standard Input in the following format:

H W
s_{1, 1} s_{1, 2} s_{1, 3} ... s_{1, W}
s_{2, 1} s_{2, 2} s_{2, 3} ... s_{2, W}
: :
s_{H, 1} s_{H, 2} s_{H, 3} ... s_{H, W}

Output

If square1001 can achieve his objective, print Yes; if he cannot, print No.

Sample Input 1

3 3
.#.
###
.#.

Sample Output 1

Yes

One possible way to achieve the objective is shown in the figure below. Here, the squares being painted are marked by stars.

Sample Input 2

5 5
#.#.#
.#.#.
#.#.#
.#.#.
#.#.#

Sample Output 2

No

square1001 cannot achieve his objective here.

Sample Input 3

11 11
...#####...
.##.....##.
#..##.##..#
#..##.##..#
#.........#
#...###...#
.#########.
.#.#.#.#.#.
##.#.#.#.##
..##.#.##..
.##..#..##.

Sample Output 3

Yes

Solution in Rust (1.15.1) (judge verdict: Accepted)

#![allow(unused_imports)]
use std::io::*;
use std::fmt::*;
use std::str::*;
use std::cmp::*;
use std::collections::*;

pub trait InputValue {
    fn parse(s: &str) -> Self;
}

pub fn read<T: InputValue>() -> T {
    let mut buf = String::new();
    let _ = stdin().read_line(&mut buf);
    T::parse(&buf.trim())
}

pub fn readn<T: InputValue>(n: usize) -> Vec<T> {
    let mut vec = vec![];
    for _ in 0..n {
        vec.push(read());
    }
    vec
}

pub fn readnc<T: InputValue>() -> Vec<T> {
    let mut vec = vec![];
    let line: String = read();
    for token in line.split_whitespace() {
        vec.push(T::parse(token));
    }
    vec
}

macro_rules! parse_single_value {
    ($($t:ty),*) => {
        $(
            impl InputValue for $t {
                fn parse(s: &str) -> $t { s.parse().unwrap() }
            }
        )*
	}
}
parse_single_value!(i32, i64, f32, f64, usize, String);

macro_rules! parse_tuple {
	($($t:ident),*) => {
		impl<$($t),*> InputValue for ($($t),*) where $($t: InputValue),* {
			fn parse(s: &str) -> ($($t),*) {
				let mut tokens = s.split_whitespace();
				let t = ($($t::parse(tokens.next().unwrap())),*);
				t
			}
		}
	}
}
parse_tuple!(A, B);

// ===

struct UnionFind {
    parent: Vec<usize>,
    count: Vec<usize>
}

impl UnionFind {
    fn new(n: usize) -> Self {
        let mut parent = vec![];
        let mut count = vec![];
        for i in 0..n {
            parent.push(i);
            count.push(1);
        }
        UnionFind { parent: parent, count: count }
    }

    fn unite(&mut self, u: usize, v: usize) {
        let pu = self.find(u);
        let pv = self.find(v);
        if pu == pv {
            return;
        }
        self.parent[pu] = self.parent[pv];
        self.parent[pv] = self.parent[pu];

        let to = self.count[pu] + self.count[pv];
        self.count[pu] = to;
        self.count[pv] = to;
    }

    fn find(&mut self, u: usize) -> usize {
        let p = self.parent[u];
        if p == u {
            return p;
        }
        let root = self.find(p);
        self.parent[u] = root;
        let rc = self.count[root];
        self.count[u] = rc;
        return root;
    }
}

fn main() {
    let (h, w): (usize, usize) = read();
    let mut table: Vec<Vec<u8>> = vec![];
    for i in 0..h {
        let s: String = read();
        table.push(s.into_bytes());
    }
    let mut uf = UnionFind::new(h*w);


    let dx = [-1, 0, 1, 0];
    let dy = [0, 1, 0, -1];
    for i in 1..h+1 {
        for j in 1..w+1 {
            for d in 0..4 {
                let ti = (i as i32 + dy[d]) as usize;
                let tj = (j as i32 + dx[d]) as usize;
                if ti <= 0 || tj <= 0 || ti > h || tj > w {
                    continue
                }
                if table[i-1][j-1] == b'#' && table[ti-1][tj-1] == b'#' {
                    uf.unite((i-1)*w+j-1, (ti-1)*w+tj-1);
                }
            }
        }
    }

    let mut isok = true;
    for i in 0..h {
        for j in 0..w {
            if table[i][j] == b'#' && uf.count[i*w+j] == 1 {
                isok = false;
            }
        }
    }
    if isok {
        println!("Yes");
    } else {
        println!("No");
    }
}