Habitat

#pragma GCC optimize("O3")
#pragma GCC target("arch=skylake")
#include <iostream>

using namespace std;
typedef long long ll;

const int N = 100;

int n;
int t[N+5][N+5];

int miv = 1000000005;
int miy = -1, mix = -1;
int smv = 1000000005;
int smy = -1, smx = -1;

ll res[N*N+5];

void lisaa_range(int a, int b, ll x) {
	res[a] += x;
	res[b+1] -= x;
}

int dist(int y1, int x1, int y2, int x2) {
	return abs(y2-y1) + abs(x2-x1);
}

bool ok(int y, int x, int k) {
	if (k >= 2*n-2) {
		if (y == miy && x == mix) {
			return smv <= k;
		}
		return miv <= k;
	}
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= n; ++j) {
			if ((dist(y, x, i, j) <= k) && (t[i][j] <= k)) {
				return true;
			}
		}
	}
	return false;
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cin >> n;
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= n; ++j) {
			cin >> t[i][j];
			int cv = t[i][j];
			if (cv <= miv) {
				smv = miv;
				smx = mix;
				smy = miy;

				miv = cv;
				mix = j;
				miy = i;
			}

		}
	}
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= n; ++j) {
			int k = -1;
			for (int jp = (1<<14); jp >= 1; jp /= 2) {
				if (k+jp < t[i][j] && !ok(i, j, k+jp)) k += jp;
			}
			k++;
			if (k < t[i][j]) {
				lisaa_range(k, t[i][j]-1, 1);
			}
		}
	}
	ll cres = 0;
	for (int i = 0; i <= n*n; ++i) {
		cres += res[i];
		cout << cres << " ";
	}
	cout << "\n";
	return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: TIME LIMIT EXCEEDED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED