Language: C++

#define _CRT_SECURE_NO_WARNINGS
#define _SCL_SECURE_NO_WARNINGS
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <iostream>
#include <string>
#include <vector>
#include <list>
#include <utility>
#include <algorithm>
#include <functional>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <sstream>
#include <bitset>
#include <limits>
#include <numeric>
#include <valarray>
#include <fstream>

using namespace std;
typedef unsigned int uint;
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<LL, LL> PP;
#define REP(i, a, n) for(LL i = (a), i##_max = (n); i < i##_max; ++i)
#define REM(i, a, n) for(LL i = (LL)(n) - 1, i##min = (a); i >= i##min; --i)
#define ALL(arr) (arr).begin(), (arr).end()
#define FLOAT fixed << setprecision(16)
#define SPEEDUP {cin.tie(NULL); ios::sync_with_stdio(false);}
const int INF = 0x3FFFFFFF;
const LL INFLL = 0x3FFFFFFF3FFFFFFF;
const double INFD = 1.0e+308;
const string INFSTR = "\x7f";
const double EPS = 1.0e-9;

void YesNo(bool b) { cout << (b ? "Yes" : "No") << endl; }
void YESNO(bool b) { cout << (b ? "YES" : "NO") << endl; }
template <class T, class U>
istream& operator>>(istream& ist, pair<T, U>& right) { return ist >> right.first >> right.second; }
template <class T, class U>
ostream& operator<<(ostream& ost, const pair<T, U>& right) { return ost << right.first << ' ' << right.second; }
template <class T, class TCompatible, size_t N>
void Fill(T(&dest)[N], const TCompatible& val) { fill(dest, dest + N, val); }
template <class T, class TCompatible, size_t M, size_t N>
void Fill(T(&dest)[M][N], const TCompatible& val) { for (int i = 0; i < M; ++i) Fill(dest[i], val); }
template<class T>
T Compare(T left, T right) { return left > right ? 1 : (left < right ? -1 : 0); }
istream& Ignore(istream& ist) { string s; ist >> s; return ist; }
bool Inside(int i, int j, int h, int w) { return i >= 0 && i < h && j >= 0 && j < w; }
template <class T>
T Next() { T buf; cin >> buf; return buf; }

#ifdef ONLY_MY_ENVIR
#include "IntMod.h"
#include "Union_Find.h"
#include "Graph.h"
#include "Range.h"
#include "Global.h"
#include "Flow_Solver.h"
#include "Tree.h"
#include "Suffix_Array.h"
#include "Geometry.h"
#include "Matrix.h"
#include "Segment_Tree.h"
#include "BIT.h"
#include "Rational.h"
#include "Position.h"
#include "Factorization.h"
#endif

#ifdef __GNUC__
typedef __int128 LLL;
istream& operator>> (istream& ist, __int128& val) { LL tmp;  ist >> tmp; val = tmp; return ist; }
ostream& operator<< (ostream& ost, __int128 val) { LL tmp = val; ost << tmp; return ost; }
#endif

#if 1234567891
#include <array>
#include <random>
#include <unordered_set>
#include <unordered_map>
template<typename T>
using PriorityQ = priority_queue<T, vector<T>, greater<T> >;
// template <class T>
// auto Is(const T& value) { return [value](const auto& comparand) -> bool { return comparand == value; }; }
#endif

const int MAX = 1 << 11;
int N, D;
int C[2 * MAX][2 * MAX];
int D[100001];
int cmax;

int QueryCol(int i, int l, int r) {
	l += MAX;
	r += MAX;
	int mx = 0;
	while (l < r) {
		if (l & 1) mx = max(mx, C[i][l++]);
		if (r & 1) mx = max(mx, C[i][--r]);
		l >>= 1;
		r >>= 1;
	}
	return mx;
}

int Query(int u, int d, int l, int r) {
	if (u >= d) return 0;
	if (l >= r) return 0;

	int mx = 0;
	u += MAX;
	d += MAX;
	while (u < d) {
		if (u & 1) mx = max(mx, QueryCol(u++, l, r));
		if (d & 1) mx = max(mx, QueryCol(--d, l, r));
		u >>= 1;
		d >>= 1;
	}

	return mx;
}

bool ok(LL size) {
	LL times = (size + 1) / D;
	int h = (size + 1) % D;
	int w = (size + 1) % D;

	if (cmax <= times * times) return true;
	if (cmax > (times + 1) * (times + 1)) return false;

	REP(i, 0, D) {
		REP(j, 0, D) {
			if (Query(i + h, i + D, j + w, j + D) > times * times) continue;
			if (Query(i, i + h, j + w, j + D) > (times + 1) * times) continue;
			if (Query(i + h, i + D, j, j + w) > times * (times + 1)) continue;
			//if (Query(i, i + h, j, j + w) > (times + 1) * (times + 1)) continue;
			return true;
		}
	}
	return false;
}

int main() {
	cin >> N >> D;
	REP(i, 0, N) {
		int x, y;
		scanf("%d %d", &x, &y);
		++C[x % D + MAX][y % D + MAX];
	}

	cmax = 0;
	REM(i, MAX, MAX + D) {
		REM(j, MAX, MAX + D) {
			cmax = max(cmax, C[i][j]);
			C[i + D][j] = C[i][j];
			C[i][j + D] = C[i][j];
			C[i + D][j + D] = C[i][j];
		}
	}

	REM(i, MAX, 2 * MAX) {
		REM(j, 1, MAX) {
			C[i][j] = max(C[i][2 * j], C[i][2 * j + 1]);
		}
	}

	REM(i, 1, MAX) {
		REM(j, 1, 2 * MAX) {
			C[i][j] = max(C[2 * i][j], C[2 * i + 1][j]);
		}
	}

	int lo = -1;
	int hi = 320000;
	while (hi - lo > 1) {
		int mid = (lo + hi) / 2;
		if (ok(mid)) {
			hi = mid;
		} else {
			lo = mid;
		}
	}
	cout << hi << endl;
	return 0;
}

Compiler output:
a.cc:98:5: error: conflicting declaration 'int D [100001]'
   98 | int D[100001];
      |     ^
a.cc:96:8: note: previous declaration as 'int D'
   96 | int N, D;
      |        ^