제출 #127275

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
127275		E869120	Maxcomp (info1cup18_maxcomp)	C++14	30 / 100	1068 ms	760 KiB

maxcomp

#include <iostream>
#include <queue>
#include <algorithm>
#include <functional>
#include <cassert>
using namespace std;
#pragma warning (disable: 4996)

int N, M, A[1009][1009], dist[1009][1009];

int main() {
	scanf("%d%d", &N, &M);
	assert(N * M <= 2500);
	for (int i = 1; i <= N; i++) {
		for (int j = 1; j <= M; j++) { scanf("%d", &A[i][j]); dist[i][j] = A[i][j] - 1; }
	}
	priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>>Q;
	for (int i = 1; i <= N; i++) { for (int j = 1; j <= M; j++) Q.push(make_pair(A[i][j], i * 10000 + j)); }

	while (!Q.empty()) {
		int pos = Q.top().second; Q.pop();
		int px = pos / 10000, py = pos % 10000;
		int dx[4] = { 1, 0, -1, 0 }, dy[4] = { 0, 1, 0, -1 };
		for (int i = 0; i < 4; i++) {
			int ex = px + dx[i], ey = py + dy[i];
			if (ex <= 0 || ey <= 0 || ex > N || ey > M) continue;
			if (dist[ex][ey] < dist[px][py] - 1) {
				dist[ex][ey] = dist[px][py] - 1;
				Q.push(make_pair(dist[ex][ey], ex * 10000 + ey));
			}
		}
	}

	int maxn = -1;
	for (int i = 1; i <= N; i++) {
		for (int j = 1; j <= M; j++) maxn = max(maxn, dist[i][j] - A[i][j]);
	}
	cout << maxn << endl;
	return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

maxcomp.cpp:7:0: warning: ignoring #pragma warning  [-Wunknown-pragmas]
 #pragma warning (disable: 4996)
 
maxcomp.cpp: In function 'int main()':
maxcomp.cpp:12:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &N, &M);
  ~~~~~^~~~~~~~~~~~~~~~
maxcomp.cpp:15:39: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   for (int j = 1; j <= M; j++) { scanf("%d", &A[i][j]); dist[i][j] = A[i][j] - 1; }
                                  ~~~~~^~~~~~~~~~~~~~~~

• Subtask 1: 15 / 15
• Subtask 2: 15 / 15
• Subtask 3: 0 / 30
• Subtask 4: 0 / 40