Language: C++

//Written by Zhu Zeqi
//Come on,baby
//Hack,please
#include<cmath>
#include<math.h>
#include<ctype.h>
#include<algorithm>
#include<bitset>
#include<cassert>
#include<cctype>
#include<cerrno>
#include<cfloat>
#include<ciso646>
#include<climits>
#include<clocale>
#include<complex>
#include<csetjmp>
#include<csignal>
#include<cstdarg>
#include<cstddef>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<cwchar>
#include<cwctype>
#include<deque>
#include<exception>
#include<fstream>
#include<functional>
#include<iomanip>
#include<ios>
#include<iosfwd>
#include<iostream>
#include<istream>
#include<iterator>
#include<limits>
#include<list>
#include<locale>
#include<map>
#include<memory>
#include<new>
#include<numeric>
#include<ostream>
#include<queue>
#include<set>
#include<sstream>
#include<stack>
#include<stdexcept>
#include<streambuf>
#include<string>
#include<typeinfo>
#include<utility>
#include<valarray>
#include<vector>
#include<string.h>
#include<stdlib.h>
#include<stdio.h>
#define CLR(x) memset(x,0,sizeof x)
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define pii pair<int,int>
#define vi vector<int>
#define MAX 1000000000000000000
#define MOD 1000000007
#define PI 3.141592653589793238462
#define INF 0x3f3f3f3f
typedef long long ll;
//orz yht
using namespace std;
string i_s(int x){
	if(x==0)
	return "0";
	string ret="";
	while(x){
		ret=ret+(char)(x%10+'0');
		x/=10;
	}
	reverse(ret.begin(),ret.end());
	return ret;
}
string add(string a,string b){
	if(a=="")
	a="0";
	if(b=="")
	b="0";
	if(a.length()<b.length())
	swap(a,b);
	while(b.length()<a.length()){
		b='0'+b;
	}
	for(int i=0;i<a.length();i++){
		a[i]=a[i]+(b[i]-'0');
	}
	bool big=false;
	for(int i=a.length()-1;i>=0;i--){
		if(big){
			a[i]++;
		}
		big=false;
		if(a[i]>'9'){
			a[i]=a[i]-10;
			big=true;
		}
	}
	if(big)
	a='1'+a;
	return a;
}
string mul(string a,string b){
	vector<int> va,vb;
	if(a=="0" || b=="0")
	return "0";
	string ans;
	for(int i=0;i<a.length();i++){
		va.push_back(a[i]-'0');
	}
	for(int i=0;i<b.length();i++){
		vb.push_back(b[i]-'0');
	}
	reverse(va.begin(),va.end());
	reverse(vb.begin(),vb.end());
	vector<int> res;
	res.clear();
	res.resize(1005);
	for(int i=0;i<a.length();i++){
		for(int j=0;j<b.length();j++){
			res[i+j]+=(va[i]*vb[j]);
		}
	}
	for(int i=0;i<1005;i++){
		if(res[i]>9){
			res[i+1]+=(res[i]/10);
			res[i]%=10;
		}
	}
	for(int i=0;i<1005;i++){
		ans+=(res[i]+'0');
	}
	reverse(ans.begin(),ans.end());
	int k=0;
	while(ans[k]=='0'){
		k++;
	}
	ans=ans.substr(k);
	return ans;
}
bool is_prime(int n){
	if(n<2)
    return false;
    for(int i=2;i*i<=n;i++)
    if(n%i==0)
    return false;
    return true;
}
ll c(ll n,ll k){
	if(n==0 || n<k)
	return 0;
	if(n==k || k==0)
	return 1;
	else
	return c(n-1,k)+c(n-1,k-1);
}
int n,m,d,q;
ll mmp[305][305];
ll ans[100005];
struct Node{
	int x,y;
	Node(int xx=0,int yy=0){
		x=xx,y=yy;
	}
}a[maxn*maxn];
int main(){
	//freopen("input.in","r",stdin);
	//freopen("output.out","w",stdout);
    cin>>n>>m>>d;
	int l,r;
	for(int i=1;i<=n;i++)
	for(int j=1;j<=m;j++)
	cin>>mmp[i][j],a[mmp[i][j]]=Node(i,j);
	for(int i=1;i<=d;i++){
		int s=i;
		while(s<n*m){
			int v=s+d;
			ans[v]=ans[s]+abs(a[v].x-a[s].x)+abs(a[v].y-a[s].y);
			s+=d;
		}
	}
	cin>>q;
	while(q--){
		cin>>l>>r;
		cout<<ans[r]-ans[l]<<endl;
	}
	//system("pause");
	return 0;
}

Compiler output:
a.cc:174:4: error: 'maxn' was not declared in this scope
  174 | }a[maxn*maxn];
      |    ^~~~
a.cc:174:9: error: 'maxn' was not declared in this scope
  174 | }a[maxn*maxn];
      |         ^~~~
a.cc: In function 'int main()':
a.cc:182:24: error: 'a' was not declared in this scope
  182 |         cin>>mmp[i][j],a[mmp[i][j]]=Node(i,j);
      |                        ^
a.cc:187:43: error: 'a' was not declared in this scope
  187 |                         ans[v]=ans[s]+abs(a[v].x-a[s].x)+abs(a[v].y-a[s].y);
      |                                           ^