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++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <iostream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;

#define DOT 0
#define SHARP 1
#define NONE 2
int trout[400][400];
int mv[4][2] = {{0, 1}, {0, -1}, {-1, 0}, {1, 0}};
int cntdot = 0;
int cntsharp = 0;

void countroute(int h, int w, int hmax, int wmax, int targetcolor)
{
    int targ = targetcolor;

    //上下左右に進んで、
    for (int i = 0; i < 4; i++)
    {
        int hnow = h + mv[i][0];
        int wnow = w + mv[i][1];

        //別の色であること、エリア内であること、
        if (0 <= hnow && hnow < hmax && 0 <= wnow && wnow < wmax && trout[hnow][wnow] != NONE)
        {

            if (trout[hnow][wnow] == targ)
            {
                //printf("hnow%d,wnow%d, color%d",hnow,wnow,trout[hnow][wnow]);
                if (trout[hnow][wnow] == DOT)
                {
                    targetcolor = SHARP;
                    cntdot++;
                }else {
                    targetcolor = DOT;
                    cntsharp++;
                }
                trout[hnow][wnow] = NONE;
                countroute(hnow, wnow, hmax, wmax, targetcolor);
            }
        }
    }
}

int main()
{

    int H, W;
    cin >> H >> W;

    for (int i = 0; i < H; i++)
    {
        string tmp;
        cin >> tmp;
        for (int j = 0; j < W; j++)
        {
            if (tmp[j] == '.')
            {
                trout[i][j] = DOT;
            }
            else
            {
                trout[i][j] = SHARP;
            }
        }
    }

    unsigned long long sum = 0;
    for (int i = 0; i < H; i++)
    {
        for (int j = 0; j < W; j++)
        {
            if(trout[i][j] != NONE){
            int targcolor;
            if (trout[i][j] == DOT){
                cntdot++;
                targcolor = SHARP;
            }else{
                cntsharp++;
                targcolor = DOT;
            }
            trout[i][j] = NONE;
            countroute(i, j, H, W, targcolor);
            sum += (unsigned long long)(cntdot * cntsharp);
            cntdot = 0;
            cntsharp = 0;
            }
        }
    }

    cout << sum << endl;
}