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

#include <stdio.h>
int main(void){
    // Your code here!
    int H,W;
    int i,f;
    int c=0,b;
    char S[1024][1024];
    
    scanf("%d%d",&H,&W);
    
    for(i=0;i<H;i++){
        for(f=0;f<W;f++){
            scanf("%s",&S[f][i]);
        }
        
    }
    for(i=0;i<H;i++){
        for(f=0;f<W;f++){
            if(S[f][i]=='#'){
                if(S[f+1][i]=='.'){
                   c+=1;  
                }
                if(S[f-1][i]=='.'){
                   c+=1; 
                }
                if(S[f][i+1]=='.'){
                   c+=1; 
                }
                if(S[f][i-1]=='.'){
                   c+=1; 
                }
            }
            
        }
        
    }
    for(i=0;i<H;i++){
        for(f=0;f<W;f++){
            if(S[f][i]=='.'){
                b=0;
                if(S[f+1][i]=='#'){
                   b+=1;  
                }
                if(S[f-1][i]=='#'){
                   b+=1; 
                }
                if(S[f][i+1]=='#'){
                   b+=1; 
                }
                if(S[f][i-1]=='#'){
                   b+=1; 
                }
                
                if(b==2){
                    c+=1;
                }else if(b==3){
                    c+=3;
                }else if(b==4){
                    c+=6;
                }
            }
            
        }
        
    }
    printf("%d\n",c);
    
}