Language: C++

/// Containers Start
#include <iostream>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <vector>
#include <utility>
#include <iomanip>
#include <sstream>
#include <bitset>
#include <cstdlib>
#include <iterator>
#include <algorithm>
#include<random>
/// Containers End


using namespace std;


/// Math Start
#define PI                    acos(-1.0)
#define Pi                    3.141592653589793
#define EPS (1e-7)
#define INF (0x3f3f3f3f)
/// Math End


/// Extra Start
#define nn                    '\n'
#define pb                    push_back
#define SS                    stringstream
#define ull                   unsigned long long
#define mod                   1000000007
#define SIZE                  2000001
#define _cin                  ios_base::sync_with_stdio(0);  cin.tie(0);
#define sz(a)                 int((a).size())
#define space                 " "
#define All(x)                (x).begin(), (x).end()
#define rall(x)               (x).rbegin(), (x).rend()
#define Ignore                cin.ignore()
#define StringToInt           if ( ! (istringstream(s) >> n) ) n = 0;
#define SORT(c) sort(All((c)))
#define RSORT(c) sort(rall((c)))
/// Extra End


/// Functions Start
template<class T>
T gcd(T a, T b) {
    if (b == 0)return a;
    return gcd(b, a % b);
}

template<class T>
T lcm(T a, T b) { return a / gcd(a, b) * b; }

template<class T>
string converter(T n) {
    SS x;
    x << n;
    return x.str();
}

#define rep(i, n) for(int i = 0;i < n;i++)
#define FOR(i, a, b) for(int i=(a);i<=(b);i++)
#define FORD(i, a, b) for(int i=(a);i>=(b);i--)
#define FORA(arr) for(auto &i:arr)
#define Cin(a)     cin >>a;
#define Cin2(a, b)        cin>>a>>b;
#define Cin3(a, b, c)        cin>>a>>b>>c;
#define Cin4(a, b, c, d)   cin>>a>>b>>c>>d;
#define Cini(a)        int a; cin>>a;
#define Cinii(a, b)        int a,b; cin>>a>>b;
#define Cins(s)         string s; cin >> s;
#define Cinc(c)         char c; cin >> c;
/// Functions End


/// Array Start
#define SET(a)                memset( a, -1,    sizeof a )
#define CLR(a)                memset( a,  0,    sizeof a )
#define MEM(a, val)            memset( a,  val,  sizeof(a) )
/// Array End


/// Debug Start
#define deb(x) cout << #x << ": " << x << endl
#define deb2(x, y) cout << #x << ": " << x << '\t' << #y << ": " << y << endl
#define deb3(x, y, z) cout << #x << ": " << x << '\t' << #y << ": " << y << '\t' << #z << ": " << z << end
/// Debug End


/// TypeDef Start
typedef long long int ll;
typedef map<string, int> msi;
typedef map<int, int> mii;
typedef map<ll, ll> mll;
typedef map<char, int> mci;
typedef map<int, string> mis;
typedef pair<int, int> pii;
typedef pair<string, int> psi;
typedef pair<string, string> pss;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<pii> vii;
/// TypeDef End


/**>>>>>>>>>>>>>>>>>>> END <<<<<<<<<<<<<<<<<<**/


///topcoder template

////
int main(void) {
    Cinii(h, w);
    Cini(d);
    pair<int, int> num[h * w + d];
    int a[h + 10][w + 10];
    rep(i, h) rep(j, w) {
            cin >> a[i + 1][j + 1];
            num[a[i + 1][j + 1]] = make_pair(i + 1, j + 1);
        }
    Cini(q);
    int l[q], r[q];
    rep(i, q) cin >> l[i] >> r[i];
    deb(l[2]);
    deb(r[2]);

    int subsum[h * w + 10][w * h + d + 100];
    MEM(subsum, 0);
    rep(i, h * w) for (int j = i; j <= h * w + 10; j += 1) {
            subsum[i + 1][j + 1 + d] = subsum[i + 1][j + 1] +
                                       abs(num[j + 1].first - num[j + 1 + d].first) +
                                       abs(num[j + 1].second - num[j + 1 + d].second);

        }


    rep(i, q) {
        int a = gcd(l[i], r[i]);
        cout << subsum[a][r[i]] - subsum[a][l[i]] << endl;
    }




//
//    long int flag[h * 10][w * 10];
//    rep(i, q) {
//        long int sum = 0;
//        int s = l[i];
//        if (flag[l[i]][r[i]] == 0) {
//            while (s + d <= r[i]) {
//                sum += PointDistanceHorVer(num[s].first, num[s].second, num[s + d].first, num[s + d].second);
//                s += d;
//            }
//            flag[l[i]][r[i]] = sum;
//        }else { sum = flag[l[i]][r[i]]; }
//        cout << sum << nn;
//    }


    return 0;
}




Compiler output:
a.cc: In function 'int main()':
a.cc:85:32: error: 'memset' was not declared in this scope
   85 | #define MEM(a, val)            memset( a,  val,  sizeof(a) )
      |                                ^~~~~~
a.cc:136:5: note: in expansion of macro 'MEM'
  136 |     MEM(subsum, 0);
      |     ^~~
a.cc:17:1: note: 'memset' is defined in header '<cstring>'; this is probably fixable by adding '#include <cstring>'
   16 | #include<random>
  +++ |+#include <cstring>
   17 | /// Containers End