Problem:
Score : 300 points

Problem Statement

There is a grid with H rows and W columns, where each square is painted black or white.

You are given H strings S_1, S_2, ..., S_H, each of length W.
If the square at the i-th row from the top and the j-th column from the left is painted black, the j-th character in the string S_i is #; if that square is painted white, the j-th character in the string S_i is ..

Find the number of pairs of a black square c_1 and a white square c_2 that satisfy the following condition:

There is a path from the square c_1 to the square c_2 where we repeatedly move to a vertically or horizontally adjacent square through an alternating sequence of black and white squares: black, white, black, white...

Constraints

1 \leq H, W \leq 400

|S_i| = W (1 \leq i \leq H)

For each i (1 \leq i \leq H), the string S_i consists of characters # and ..

Input

Input is given from Standard Input in the following format:

H W
S_1
S_2
:
S_H

Output

Print the answer.

Sample Input 1

3 3
.#.
..#
#..

Sample Output 1

10

Some of the pairs satisfying the condition are ((1, 2), (3, 3)) and ((3, 1), (3, 2)), where (i, j) denotes the square at the i-th row from the top and the j-th column from the left.

Sample Input 2

2 4
....
....

Sample Output 2

0

Sample Input 3

4 3
###
###
...
###

Sample Output 3

6

Solution in C# (Mono 4.6.2.0) (judge verdict: Time Limit Exceeded)

using System;
using System.Collections.Generic;
using System.Linq;

namespace AISC
{
    static class MainClass
    {
        static string[] bw;
        static bool[,] hist;
        static int[] s;
        static int blk = 0, wht = 0;
        

        public static void Main(string[] args)
        {

            s = Array.ConvertAll(Console.ReadLine().Split().ToArray(), int.Parse);
            bw = new string[s[0]];

            for(int i = 0; i < s[0]; i++)
            {
                bw[i] = Console.ReadLine();
            }
            hist = new bool[s[0],s[1]];

            int ans = 0;

            for(int j = 0; j < s[0]; j++)
            {
                for(int k = 0; k < s[1]; k++)
                {
                    Dfs(j, k);
                    ans += blk * wht;
                    blk = 0;
                    wht = 0;
                }
            }

            Console.WriteLine(ans);
            return;




        }

        public class IntArrComparer : IEqualityComparer<int[]>
        {
            public bool Equals(int[] l, int[] r)
            {
                if (l[0] == r[0] && l[1] == r[1])
                {
                    return true;
                }
                else
                {
                    return false;
                }
            }

            public int GetHashCode(int[] arr)
            {
                int hcode = arr[0] * arr[1];
                return hcode;
            }
        }





        public static void Dfs(int h, int w)
        {


            hist[h, w] = true;
            if (bw[h][w] == '#')
            {
                blk++;

            }
            else
            {
                wht++;

            }

            int[] dh = new int[4] { -1, 0, 1, 0 };
            int[] dw = new int[4] { 0, 1, 0, -1 };

            for (int i = 0; i < 4; i++)
            {
                int dsth = h + dh[i];
                int dstw = w + dw[i];
                if (dsth >= 0 && dsth <= s[0] - 1 && dstw >= 0 && dstw <= s[1] - 1)
                {
                   
                    if (bw[h][w] != bw[dsth][dstw]&&!hist[dsth,dstw]) {
                        Dfs(dsth, dstw); 
                    }
                }
            }
            
        }

        public static long Gcd(long a, long b)
        {
            long tmp;
            // a<bにする
            if (a >= b)
            {
                tmp = a;
                a = b;
                b = tmp;
            }

            if (a == 0)
            {
                return b;
            }

            tmp = a;
            a = b % a;
            b = tmp;
            return Gcd(a, b);

        }


        public static IEnumerable<long> PF(long n)
        {
            long i = 2;
            long tmp = n;

            while (i * i <= n) //※1
            {
                if (tmp % i == 0)
                {
                    tmp /= i;
                    yield return i;
                }
                else
                {
                    i++;
                }
            }
            if (tmp != 1) yield return tmp;//最後の素数も返す
        }




    }

}