Problem p03225 (C++)

Buggy submission (status: Runtime Error):
/**
 *    author:  otera
 **/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;

#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef long double ld;
const int inf = 1e9 + 7;
const ll INF = 1LL << 60;
const ll mod = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define per1(i, n) for (int i = n; i >= 1; i--)
#define Rep1(i, sta, n) for (int i = sta; i <= n; i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<int, int> P;
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(), c.end()
#define pb push_back
#define debug(x) cerr << #x << " = " << (x) << endl;
template <class T> inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}

int h, w;
vector<vector<char>> s;

int c[800][800];
int x[800][800], y[800][800];

void solve() {
  cin >> h >> w;
  s.assign(h, vector<char>(w));
  rep(i, 800) {
    rep(j, 800) { c[i][j] = x[i][j] = y[i][j] = 0; }
  }
  rep(i, h) {
    rep(j, w) {
      cin >> s[i][j];
      if (s[i][j] == '#')
        c[i + j + 350][i - j + 350]++;
    }
  }
  rep(i, 700) {
    rep(j, 700) { y[i][j + 1] = y[i][j] + c[i][j]; }
  }
  rep(i, 700) {
    rep(j, 700) { x[i + 1][j] = x[i][j] + c[i][j]; }
  }
  int ans = 0;
  rep(i, 700) {
    for (int j = 1; j < 700; ++j) {
      for (int k = j + 1; k < 700; ++k) {
        if (!c[j][i] || !c[k][i])
          continue;
        int d = k - j;
        if (i - d >= 0)
          ans += x[k + 1][i - d] - x[j][i - d];
        if (i + d < 700)
          ans += x[k + 1][i + d] - x[j][i + d];
      }
    }
  }
  rep(i, 700) {
    for (int j = 1; j < 700; ++j) {
      for (int k = j + 1; k < 700; ++k) {
        if (!c[i][j] || !c[i][k])
          continue;
        int d = k - j;
        if (i - d >= 0)
          ans += y[i - d][k] - y[i - d][j + 1];
        if (i + d < 700)
          ans += y[i + d][k] - y[i + d][j + 1];
      }
    }
  }
  cout << ans << endl;
}

signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  // cout << fixed << setprecision(10);
  // int t; cin >> t; rep(i, t)solve();
  solve();
  return 0;
}

Fixed submission:
/**
 *    author:  otera
 **/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;

#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef long double ld;
const int inf = 1e9 + 7;
const ll INF = 1LL << 60;
const ll mod = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define per1(i, n) for (int i = n; i >= 1; i--)
#define Rep1(i, sta, n) for (int i = sta; i <= n; i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<int, int> P;
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(), c.end()
#define pb push_back
#define debug(x) cerr << #x << " = " << (x) << endl;
template <class T> inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}

int h, w;
vector<vector<char>> s;

int c[800][800];
int x[800][800], y[800][800];

void solve() {
  cin >> h >> w;
  s.assign(h, vector<char>(w));
  rep(i, 800) {
    rep(j, 800) { c[i][j] = x[i][j] = y[i][j] = 0; }
  }
  rep(i, h) {
    rep(j, w) {
      cin >> s[i][j];
      if (s[i][j] == '#')
        c[i + j + 20][i - j + 350]++;
    }
  }
  rep(i, 700) {
    rep(j, 700) { y[i][j + 1] = y[i][j] + c[i][j]; }
  }
  rep(i, 700) {
    rep(j, 700) { x[i + 1][j] = x[i][j] + c[i][j]; }
  }
  int ans = 0;
  rep(i, 700) {
    for (int j = 1; j < 700; ++j) {
      for (int k = j + 1; k < 700; ++k) {
        if (!c[j][i] || !c[k][i])
          continue;
        int d = k - j;
        if (i - d >= 0)
          ans += x[k + 1][i - d] - x[j][i - d];
        if (i + d < 700)
          ans += x[k + 1][i + d] - x[j][i + d];
      }
    }
  }
  rep(i, 700) {
    for (int j = 1; j < 700; ++j) {
      for (int k = j + 1; k < 700; ++k) {
        if (!c[i][j] || !c[i][k])
          continue;
        int d = k - j;
        if (i - d >= 0)
          ans += y[i - d][k] - y[i - d][j + 1];
        if (i + d < 700)
          ans += y[i + d][k] - y[i + d][j + 1];
      }
    }
  }
  cout << ans << endl;
}

signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  // cout << fixed << setprecision(10);
  // int t; cin >> t; rep(i, t)solve();
  solve();
  return 0;
}