結果

問題 No.1668 Grayscale
ユーザー lam6er
提出日時 2025-03-20 21:09:02
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 2,547 ms / 4,000 ms
コード長 1,191 bytes
コンパイル時間 252 ms
コンパイル使用メモリ 81,892 KB
実行使用メモリ 428,172 KB
最終ジャッジ日時 2025-03-20 21:10:01
合計ジャッジ時間 12,579 ms
ジャッジサーバーID
(参考情報)
judge2 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 22
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import sys
from collections import defaultdict
def main():
H, W, N = map(int, sys.stdin.readline().split())
C = []
for _ in range(H):
row = list(map(int, sys.stdin.readline().split()))
C.append(row)
adj = defaultdict(set)
for i in range(H):
for j in range(W):
current = C[i][j]
for dx, dy in [(-1, 0), (1, 0), (0, -1), (0, 1)]:
ni, nj = i + dx, j + dy
if 0 <= ni < H and 0 <= nj < W:
neighbor = C[ni][nj]
if current != neighbor:
adj[current].add(neighbor)
adj[neighbor].add(current)
max_color = 0
d = [0] * (N + 1) # d[1..N]
for k in range(1, N + 1):
current_max_neighbor = 0
for neighbor in adj.get(k, set()):
if neighbor < k:
if d[neighbor] > current_max_neighbor:
current_max_neighbor = d[neighbor]
current_d = max(max_color, current_max_neighbor + 1)
d[k] = current_d
if current_d > max_color:
max_color = current_d
print(max_color)
if __name__ == "__main__":
main()
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0