Submission #2946178

---

Source Code Expand

#include<cstdio>
#include<queue>
#include<utility>
#include<cstring>
#include<stack>
#include<algorithm>
#include<cmath>
#include<iostream>
#include<map>
#define MAX_N 100001
#define INF_INT 2147483647
#define INF_LL 9223372036854775807
#define REP(i,n) for(int i=0;i<(int)(n);i++)
void init(int n);
int find(int n);
void unite(int x,int y);
bool same(int x, int y);
int dx[4] = {1,0,0,-1};
int dy[4] = {0,1,-1,0};
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
typedef pair<P,ll> PP;
bool cmp_P(const P &a,const P &b){
  return a.second < b.second;
}

void bfs(){


}

int main()
{
  ll N,M,pos,res=0;
  char grid[2001][2001];
  int numb[2001][2001][4];
  cin >> N >> M;
  REP(i,N)
    cin >> grid[i];
  
  REP(i,N){
    pos = -1;
    REP(j,M){
    if(grid[i][j] == '#')
      pos = j;
    else{
      if(pos == -1){
        numb[i][j][0] = j;
      }else{
        numb[i][j][0] = j-pos-1;
      }
      
    }
    }
  }
  REP(i,N){
    pos = -1;
    for(int j=M-1;j>=0;j--){
      if(grid[i][j] == '#')
        pos = j;
      else{
        if(pos == -1){
          numb[i][j][1] = M -1 - j;
        }else{
          numb[i][j][1] = pos -1 - j;
        }
      }
      
    }
  }

  REP(i,M){
    pos = -1;
    for(int j=N-1;j>=0;j--){
      if(grid[j][i] == '#'){
        pos = j;
      }else{
        if(pos == -1){
          numb[j][i][2] = N -1 - j;
        }else{
          numb[j][i][2] = pos -1 - j;
        }
      }
      
    }
  }

  REP(i,M){
    pos = -1;
    REP(j,N){
    if(grid[j][i] == '#')
      pos = j;
    else{
      if(pos == -1){
        numb[j][i][3] = j;
      }else{
        numb[j][i][3] = j-pos-1;
      }
    }
    }
  }

  REP(i,N){
    REP(j,M){
    if(grid[i][j] == '#')
      continue;
    res += numb[i][j][0]*numb[i][j][2] +
      numb[i][j][0]*numb[i][j][3] +
      numb[i][j][1]*numb[i][j][2] +
      numb[i][j][1]*numb[i][j][3];
    
           
    }
  }
  
  cout << res << endl;
  
  return 0;
}

int par[MAX_N];
int ranks[MAX_N];

//n要素で初期化
void init(int n){
  REP(i,n){
    par[i] = i;
    ranks[i] = 0;
  }

}

//木の根を求める
int find(int x){
  if(par[x] == x){
    return x;
  }else{
    return par[x] = find(par[x]);
  }
}

void unite(int x,int y){
  x = find(x);
  y = find(y);
  if(x == y) return ;
  if(ranks[x] < ranks[y]){
    par[x] = y;
  }else{
    par[y] = x;
    if(ranks[x] == ranks[y]) ranks[x]++;
  }
}

bool same(int x, int y){
  return find(x) == find(y);
}

Submission Info

Judge Result