提出 #13539241

---

ソースコード 拡げる

#include<cstdio>
int n;
int dist[510][510];
int occupied[510][510];
int perm[300100];
int q[1200100][2];
int qs, qe;
int getdist(int x, int y) {
	if (x < 0 || y < 0 || x >= n || y >= n)return 0;
	return dist[x][y];
}
void qpush(int x, int y) {
	int cdist = dist[x][y];
	if (cdist > getdist(x + 1, y)) {
		cdist = getdist(x + 1, y);
	}
	if (cdist > getdist(x - 1, y)) {
		cdist = getdist(x - 1, y);
	}
	if (cdist > getdist(x, y + 1)) {
		cdist = getdist(x, y + 1);
	}
	if (cdist > getdist(x, y - 1)) {
		cdist = getdist(x, y - 1);
	}
	cdist += occupied[x][y];
	if (cdist < dist[x][y]) {
		dist[x][y] = cdist;
		q[qe][0] = x;
		q[qe][1] = y;
		qe++;
	}
}
void unoccupy(int x, int y) {
	occupied[x][y] = 0;
	qpush(x, y);
}
void qpoll() {
	int x = q[qs][0];
	int y = q[qs][1];
	qpush(x + 1, y);
	qpush(x - 1, y);
	qpush(x, y + 1);
	qpush(x, y - 1);
	qs++;
}
int main() {
	scanf("%d", &n);
	for (int i = 0; i < n*n; i++) {
		scanf("%d", &perm[i]);
	}
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			occupied[i][j] = 1;
			dist[i][j] = i + 1;
			if (dist[i][j] > j + 1)dist[i][j] = j + 1;
			if (dist[i][j] > n - i)dist[i][j] = n - i;
			if (dist[i][j] > n - j)dist[i][j] = n - j;
		}
	}
	int ans = 0;
	for (int i = 0; i < n*n; i++) {
		int x = (perm[i] - 1) / n;
		int y = (perm[i] - 1) % n;
		qs = 0;
		qe = 0;
		unoccupy(x, y);
		while (qs < qe) {
			qpoll();
		}
		ans += getdist(x, y);
	}
	printf("%d", ans);
	return 0;
}

提出情報

コンパイルエラー

./Main.cpp: In function ‘int main()’:
./Main.cpp:48:7: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   48 |  scanf("%d", &n);
      |  ~~~~~^~~~~~~~~~
./Main.cpp:50:8: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   50 |   scanf("%d", &perm[i]);
      |   ~~~~~^~~~~~~~~~~~~~~~

ジャッジ結果