Problem p03330 (C++)

Buggy submission (status: Runtime Error):
#pragma region _head

#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>

void Init() {
  std::cin.tie(0);
  std::ios::sync_with_stdio(false);
  struct Init_caller {
    Init_caller() { Init(); }
  } caller;
}

#pragma region _define

#define int LL
#define f(i, a, b) for (LL i = a; i < b; i++)
#define rep(i, n) for (LL i = 0; i < n; i++)
#define f_vI(v, n) f(i, 0, n) cin >> v[i]
#define f_v2I(v1, v2, n) f(i, 0, n) cin >> v1[i] >> v2[i]
#define f_v3I(v1, v2, v3, n) f(i, 0, n) cin >> v1[i] >> v2[i] >> v3[i]
#define f_vO(v, n) f(i, 0, n) cout << v[i] << endl
#define ei else if
#define all(a) a.begin(), a.end()
#define size(s) ((LL)s.size())
#define F first
#define S second
#define check() cout << "! ! !"
#define endl "\n"
#define _y() cout << "Yes" << endl
#define _Y() cout << "YES" << endl
#define _n() cout << "No" << endl
#define _N() cout << "NO" << endl
#define INT_INF 1 << 29
#define LL_INF 1LL << 60
#define MOD 1000000007

#pragma endregion

#pragma region _using

using namespace std;

using LL = long long;
using st = string;
using vi = vector<LL>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vd = vector<double>;
using vvd = vector<vd>;
using vvvd = vector<vvd>;
using vc = vector<char>;
using vvc = vector<vc>;
using vs = vector<st>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvvb = vector<vvb>;
using qi = queue<LL>;
using qc = queue<char>;
using qs = queue<st>;
using si = stack<LL>;
using sc = stack<char>;
using ss = stack<st>;
using pi = pair<LL, LL>;
using ppi = pair<pi, LL>;
using mll = map<LL, LL>;
using mcl = map<char, LL>;
using vpi = vector<pi>;
using vppi = vector<ppi>;

#pragma endregion

struct edge {
  int from, to, cost;
};

void y_n(bool p) { p ? _y() : _n(); }

void Y_N(bool p) { p ? _Y() : _N(); }

LL vmax(vi v, LL n) {
  int MAX = 0;
  f(i, 0, n) { MAX = max(MAX, v[i]); }
  return MAX;
}

LL vmin(vi v, LL n) {
  int MIN = LL_INF;
  f(i, 0, n) { MIN = min(MIN, v[i]); }
  return MIN;
}

LL gcd(LL a, LL b) {
  LL r;
  while ((r = a % b) != 0) {
    a = b;
    b = r;
  }
  return b;
}
LL lcm(LL a, LL b) { return (a / gcd(a, b) * b); }

// 素数判定
bool is_prime(int n) {
  for (int i = 2; i * i <= n; i++) {
    if (n % i == 0) {
      return false;
    }
  }
  return true;
}

// エラトステネスの篩
void sieve(LL n) {
  vb s(n + 1, true);
  f(i, 2, n + 1) {
    for (int j = 2; i * j <= n; j++) {
      s[i * j] = false;
    }
  }
  cout << "2から" << n << "までの素数" << endl;
  f(i, 2, n + 1) {
    if (s[i]) {
      cout << i << " ";
    }
  }
}

// 階乗計算
LL factorial(LL n) {
  LL a = 1, ret = 1;
  while (a < n) {
    a++;
    ret *= a;
    ret %= MOD;
  }
  return ret;
}

#pragma endregion

/*****************************************************************************/
signed main(void) {
  int n, c;
  cin >> n >> c;
  vvi d(c, vi(c));
  rep(i, c) {
    rep(j, c) { cin >> d[i][j]; }
  }
  vvi fi(n, vi(n, 0));
  rep(i, n) {
    rep(j, n) {
      cin >> fi[i][j];
      fi[i][j]--;
    }
  }
  vvi cost(3, vi(c, 0));
  rep(k, n) {
    rep(i, n) {
      rep(j, n) { cost[(i + j) % 3][k] += d[fi[i][j]][k]; }
    }
  }
  int ans = LL_INF;
  int co[3];
  for (co[0] = 0; co[0] < c; co[0]++) {
    for (co[1] = 0; co[1] < c; co[1]++) {
      if (co[1] == co[0])
        continue;
      for (co[2] = 0; co[2] < c; co[2]++) {
        if (co[2] == co[0] || co[2] == co[1])
          continue;
        int tmp = 0;
        rep(it, 3) { tmp += cost[it][co[it]]; }
        ans = min(ans, tmp);
      }
    }
  }
  cout << ans;
  return 0;
}

Fixed submission:
#pragma region _head

#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>

void Init() {
  std::cin.tie(0);
  std::ios::sync_with_stdio(false);
  struct Init_caller {
    Init_caller() { Init(); }
  } caller;
}

#pragma region _define

#define int LL
#define f(i, a, b) for (LL i = a; i < b; i++)
#define rep(i, n) for (LL i = 0; i < n; i++)
#define f_vI(v, n) f(i, 0, n) cin >> v[i]
#define f_v2I(v1, v2, n) f(i, 0, n) cin >> v1[i] >> v2[i]
#define f_v3I(v1, v2, v3, n) f(i, 0, n) cin >> v1[i] >> v2[i] >> v3[i]
#define f_vO(v, n) f(i, 0, n) cout << v[i] << endl
#define ei else if
#define all(a) a.begin(), a.end()
#define size(s) ((LL)s.size())
#define F first
#define S second
#define check() cout << "! ! !"
#define endl "\n"
#define _y() cout << "Yes" << endl
#define _Y() cout << "YES" << endl
#define _n() cout << "No" << endl
#define _N() cout << "NO" << endl
#define INT_INF 1 << 29
#define LL_INF 1LL << 60
#define MOD 1000000007

#pragma endregion

#pragma region _using

using namespace std;

using LL = long long;
using st = string;
using vi = vector<LL>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vd = vector<double>;
using vvd = vector<vd>;
using vvvd = vector<vvd>;
using vc = vector<char>;
using vvc = vector<vc>;
using vs = vector<st>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvvb = vector<vvb>;
using qi = queue<LL>;
using qc = queue<char>;
using qs = queue<st>;
using si = stack<LL>;
using sc = stack<char>;
using ss = stack<st>;
using pi = pair<LL, LL>;
using ppi = pair<pi, LL>;
using mll = map<LL, LL>;
using mcl = map<char, LL>;
using vpi = vector<pi>;
using vppi = vector<ppi>;

#pragma endregion

struct edge {
  int from, to, cost;
};

void y_n(bool p) { p ? _y() : _n(); }

void Y_N(bool p) { p ? _Y() : _N(); }

LL vmax(vi v, LL n) {
  int MAX = 0;
  f(i, 0, n) { MAX = max(MAX, v[i]); }
  return MAX;
}

LL vmin(vi v, LL n) {
  int MIN = LL_INF;
  f(i, 0, n) { MIN = min(MIN, v[i]); }
  return MIN;
}

LL gcd(LL a, LL b) {
  LL r;
  while ((r = a % b) != 0) {
    a = b;
    b = r;
  }
  return b;
}
LL lcm(LL a, LL b) { return (a / gcd(a, b) * b); }

// 素数判定
bool is_prime(int n) {
  for (int i = 2; i * i <= n; i++) {
    if (n % i == 0) {
      return false;
    }
  }
  return true;
}

// エラトステネスの篩
void sieve(LL n) {
  vb s(n + 1, true);
  f(i, 2, n + 1) {
    for (int j = 2; i * j <= n; j++) {
      s[i * j] = false;
    }
  }
  cout << "2から" << n << "までの素数" << endl;
  f(i, 2, n + 1) {
    if (s[i]) {
      cout << i << " ";
    }
  }
}

// 階乗計算
LL factorial(LL n) {
  LL a = 1, ret = 1;
  while (a < n) {
    a++;
    ret *= a;
    ret %= MOD;
  }
  return ret;
}

#pragma endregion

/*****************************************************************************/
signed main(void) {
  int n, c;
  cin >> n >> c;
  vvi d(c, vi(c));
  rep(i, c) {
    rep(j, c) { cin >> d[i][j]; }
  }
  vvi fi(n, vi(n, 0));
  rep(i, n) {
    rep(j, n) {
      cin >> fi[i][j];
      fi[i][j]--;
    }
  }
  vvi cost(3, vi(c, 0));
  rep(k, c) {
    rep(i, n) {
      rep(j, n) { cost[(i + j) % 3][k] += d[fi[i][j]][k]; }
    }
  }
  int ans = LL_INF;
  int co[3];
  for (co[0] = 0; co[0] < c; co[0]++) {
    for (co[1] = 0; co[1] < c; co[1]++) {
      if (co[1] == co[0])
        continue;
      for (co[2] = 0; co[2] < c; co[2]++) {
        if (co[2] == co[0] || co[2] == co[1])
          continue;
        int tmp = 0;
        rep(it, 3) { tmp += cost[it][co[it]]; }
        ans = min(ans, tmp);
      }
    }
  }
  cout << ans;
  return 0;
}