結果

問題 No.2639 Longest Increasing Walk
ユーザー kemuniku
提出日時 2024-02-19 22:19:21
言語 Nim
(2.2.0)
結果
AC  
実行時間 186 ms / 2,000 ms
コード長 3,619 bytes
コンパイル時間 4,003 ms
コンパイル使用メモリ 78,736 KB
実行使用メモリ 27,120 KB
最終ジャッジ日時 2024-09-29 02:14:13
合計ジャッジ時間 6,920 ms
ジャッジサーバーID
(参考情報)
judge5 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 33
権限があれば一括ダウンロードができます

ソースコード

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

import macros;macro ImportExpand(s:untyped):untyped = parseStmt($s[2])
ImportExpand "cplib/tmpl/sheep.nim" <=== "when not declared CPLIB_TMPL_SHEEP:\n const CPLIB_TMPL_SHEEP* = 1\n {.warning[UnusedImport]: off.}\n
     {.hint[XDeclaredButNotUsed]: off.}\n import algorithm\n import sequtils\n import tables\n import macros\n import math\n import
    sets\n import strutils\n import strformat\n import sugar\n import heapqueue\n import streams\n import deques\n import
    bitops\n import std/lenientops\n import options\n #\n proc scanf(formatstr: cstring){.header: \"<stdio.h>\", varargs.}\n proc
    getchar(): char {.importc: \"getchar_unlocked\", header: \"<stdio.h>\", discardable.}\n proc ii(): int {.inline.} = scanf(\"%lld\\n\", addr
    result)\n proc lii(N: int): seq[int] {.inline.} = newSeqWith(N, ii())\n proc si(): string {.inline.} =\n result = \"\"\n var c
    : char\n while true:\n c = getchar()\n if c == ' ' or c == '\\n':\n break\n result &= c\n
     #chmin,chmax\n template `max=`(x, y) = x = max(x, y)\n template `min=`(x, y) = x = min(x, y)\n #bit\n proc `%`(x: int, y: int):
    int = (((x mod y)+y) mod y)\n proc `//`(x: int, y: int): int = (((x) - (x%y)) div (y))\n proc `%=`(x: var int, y: int): void = x = x%y\n
    proc `//=`(x: var int, y: int): void = x = x//y\n proc `**`(x: int, y: int): int = x^y\n proc `^`(x: int, y: int): int = x xor y\n proc
    `|`(x: int, y: int): int = x or y\n proc `&`(x: int, y: int): int = x and y\n proc `>>`(x: int, y: int): int = x shr y\n proc `<<`(x: int
    , y: int): int = x shl y\n proc `^=`(x: var int, y: int): void = x = x ^ y\n proc `&=`(x: var int, y: int): void = x = x & y\n proc `|=`
    (x: var int, y: int): void = x = x | y\n proc `>>=`(x: var int, y: int): void = x = x >> y\n proc `<<=`(x: var int, y: int): void = x = x <<
    y\n proc `[]`(x: int, n: int): bool = (x and (1 shl n)) != 0\n proc `@`(x: int): seq[int] =\n for i in 0..<64:\n if x[i]
    :\n result.add(i)\n #便\n proc `!`(x: char, a = '0'): int = int(x)-int(a)\n #\n const INF = int
    (3300300300300300491)\n #converter\n\n #range\n iterator range(start: int, ends: int, step: int): int =\n var i = start\n
    if step < 0:\n while i > ends:\n yield i\n i += step\n elif step > 0:\n while i < ends
    :\n yield i\n i += step\n iterator range(ends: int): int = (for i in 0..<ends: yield i)\n iterator range(start
    : int, ends: int): int = (for i in\n start..<ends: yield i)\n"
var H,W = ii()
var A = newSeqWith(H,newSeqWith(W,ii()))
var x : seq[(int,int,int)]
for i in range(H):
for j in range(W):
x.add((A[i][j],i,j))
var alr = newSeqWith(H,newSeqWith(W,-1))
x.sort(Descending)
for (a,i,j) in x:
if alr[i][j] == -1:
var hq = initHeapQueue[(int,int,int,int)]()
hq.push((-a,-1,i,j))
while len(hq) != 0:
var (a,c,i,j) = hq.pop()
if alr[i][j] > -c:
continue
c = -c
a = -a
alr[i][j] = c
for (di,dj) in [(0,1),(1,0),(-1,0),(0,-1)]:
if i+di in 0..<H and j+dj in 0..<W:
if a > A[i+di][j+dj] and alr[i+di][j+dj] < (c+1):
hq.push((-A[i+di][j+dj],-(c+1),i+di,j+dj))
# for i in range(H):
# echo alr[i]
# echo ""
echo alr.mapit(max(it)).max
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0