Problem p03426 (C++)

Buggy submission (status: Runtime Error):
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define vvi vector<vector<int>>
#define vec vector
#define pq priority_queue
#define all(v) (v).begin(), (v).end()
#define rep(i, n) for (int(i) = (0); (i) < (n); ++(i))
#define repp(i, m, n) for (int(i) = (m); (i) < (n); ++(i))
#define debug(x) cerr << #x << ": " << x << endl;
#define debug2(x, y)                                                           \
  cerr << "(" << #x << ", " << #y << ") = "                                    \
       << "(" << x << ", " << y << ")" << endl;
#define debug3(x, y, z)                                                        \
  cerr << "(" << #x << ", " << #y << ", " << #z << ") = "                      \
       << "(" << x << ", " << y << ", " << z << ")" << endl;
#define debugB(x, y) cerr << #x << ": " << bitset<y>(x) << endl;
#define line() cerr << "---------------" << endl;

const int dx[] = {1, -1, 0, 0};
const int dy[] = {0, 0, -1, 1};

template <typename T> void printA(vector<T> &printArray, char between = ' ') {
  int paSize = printArray.size();
  for (int i = 0; i < paSize; i++) {
    cerr << printArray[i] << between;
  }
  if (between != '\n') {
    cerr << endl;
  }
}

// ------------------------------------------------------------------------------------------

int H, W, D;
int A[333][333];
map<int, pair<int, int>> m;
int a[111111];

int main() {
  cin >> H >> W >> D;
  rep(i, H) {
    rep(j, W) {
      cin >> A[i][j];
      m.insert({A[i][j], {i, j}});
    }
  }

  // for (int i = D+1; i <= H*W; i++) {
  //    a[i] = a[i-D] + abs(m[i-D].first - m[i].first) + abs(m[i-D].second -
  //    m[i].second);
  // }
  for (int i = 1; i <= H * W; i++) {
    a[i + D] = a[i] + abs(m[i + D].first - m[i].first) +
               abs(m[i + D].second - m[i].second);
  }

  int Q;
  cin >> Q;
  while (Q--) {
    int l, r;
    cin >> l >> r;
    cout << a[r] - a[l] << endl;
  }

  return 0;
}

Fixed submission:
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define vvi vector<vector<int>>
#define vec vector
#define pq priority_queue
#define all(v) (v).begin(), (v).end()
#define rep(i, n) for (int(i) = (0); (i) < (n); ++(i))
#define repp(i, m, n) for (int(i) = (m); (i) < (n); ++(i))
#define debug(x) cerr << #x << ": " << x << endl;
#define debug2(x, y)                                                           \
  cerr << "(" << #x << ", " << #y << ") = "                                    \
       << "(" << x << ", " << y << ")" << endl;
#define debug3(x, y, z)                                                        \
  cerr << "(" << #x << ", " << #y << ", " << #z << ") = "                      \
       << "(" << x << ", " << y << ", " << z << ")" << endl;
#define debugB(x, y) cerr << #x << ": " << bitset<y>(x) << endl;
#define line() cerr << "---------------" << endl;

const int dx[] = {1, -1, 0, 0};
const int dy[] = {0, 0, -1, 1};

template <typename T> void printA(vector<T> &printArray, char between = ' ') {
  int paSize = printArray.size();
  for (int i = 0; i < paSize; i++) {
    cerr << printArray[i] << between;
  }
  if (between != '\n') {
    cerr << endl;
  }
}

// ------------------------------------------------------------------------------------------

int H, W, D;
int A[333][333];
map<int, pair<int, int>> m;
int a[111111];

int main() {
  cin >> H >> W >> D;
  rep(i, H) {
    rep(j, W) {
      cin >> A[i][j];
      m.insert({A[i][j], {i, j}});
    }
  }

  // for (int i = D+1; i <= H*W; i++) {
  //    a[i] = a[i-D] + abs(m[i-D].first - m[i].first) + abs(m[i-D].second -
  //    m[i].second);
  // }
  for (int i = 1; i <= H * W - D; i++) {
    a[i + D] = a[i] + abs(m[i + D].first - m[i].first) +
               abs(m[i + D].second - m[i].second);
  }

  int Q;
  cin >> Q;
  while (Q--) {
    int l, r;
    cin >> l >> r;
    cout << a[r] - a[l] << endl;
  }

  return 0;
}