#1004386 (Nim) No.2855 Move on Grid

提出ソース

結果

問題	No.2855 Move on Grid
ユーザー	kemuniku
提出日時	2024-08-25 14:05:21
言語	Nim (2.0.2)
結果	AC
実行時間	278 ms / 3,000 ms
コード長	5,133 bytes
コンパイル時間	3,552 ms
コンパイル使用メモリ	77,572 KB
実行使用メモリ	9,600 KB
最終ジャッジ日時	2024-08-25 14:05:42
合計ジャッジ時間	10,181 ms
ジャッジサーバーID （参考情報）	judge5 / judge4

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	61 ms 6,812 KB
testcase_01	AC	89 ms 6,940 KB
testcase_02	AC	51 ms 6,940 KB
testcase_03	AC	37 ms 6,940 KB
testcase_04	AC	27 ms 6,944 KB
testcase_05	AC	58 ms 6,944 KB
testcase_06	AC	57 ms 6,940 KB
testcase_07	AC	7 ms 6,944 KB
testcase_08	AC	46 ms 6,944 KB
testcase_09	AC	23 ms 6,940 KB
testcase_10	AC	2 ms 6,948 KB
testcase_11	AC	2 ms 6,944 KB
testcase_12	AC	1 ms 6,944 KB
testcase_13	AC	1 ms 6,940 KB
testcase_14	AC	1 ms 6,944 KB
testcase_15	AC	1 ms 6,940 KB
testcase_16	AC	1 ms 6,940 KB
testcase_17	AC	1 ms 6,940 KB
testcase_18	AC	1 ms 6,940 KB
testcase_19	AC	1 ms 6,944 KB
testcase_20	AC	253 ms 6,944 KB
testcase_21	AC	255 ms 8,064 KB
testcase_22	AC	246 ms 6,940 KB
testcase_23	AC	246 ms 6,940 KB
testcase_24	AC	255 ms 7,040 KB
testcase_25	AC	276 ms 8,064 KB
testcase_26	AC	247 ms 6,944 KB
testcase_27	AC	248 ms 8,192 KB
testcase_28	AC	245 ms 6,940 KB
testcase_29	AC	258 ms 6,944 KB
testcase_30	AC	251 ms 8,064 KB
testcase_31	AC	257 ms 8,192 KB
testcase_32	AC	278 ms 8,064 KB
testcase_33	AC	255 ms 8,192 KB
testcase_34	AC	260 ms 8,064 KB
testcase_35	AC	254 ms 8,192 KB
testcase_36	AC	231 ms 9,600 KB
testcase_37	AC	272 ms 8,064 KB
testcase_38	AC	267 ms 8,192 KB
testcase_39	AC	259 ms 8,064 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

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 =\n        result = x mod y\n        if y > 0 and result < 0: result += y\n        if y < 0 and result > 0: result += y\n    proc `//`*(x: int, y: int): int{.inline.} =\n        result = x div y\n        if y > 0 and result * y > x: result -= 1\n        if y < 0 and result * y < x: result -= 1\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: var int, y: int): void = x = 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: int): int = not x\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    #便利な変換\n    proc `!`(x: char, a = '0'): int = int(x)-int(a)\n    #定数\n    #[ include cplib/utils/constants ]#\n    when not declared CPLIB_UTILS_CONSTANTS:\n        const CPLIB_UTILS_CONSTANTS* = 1\n        const INF32*: int32 = 100100111.int32\n        const INF64*: int = int(3300300300300300491)\n    const INF = INF64\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\n    #joinが非stringでめちゃくちゃ遅いやつのパッチ\n    proc join*[T: not string](a: openArray[T], sep: string = \"\"): string = a.mapit($it).join(sep)\n"
ImportExpand "cplib/utils/binary_search.nim" <=== "when not declared CPLIB_UTILS_BINARY_SEARCH:\n    const CPLIB_UTILS_BINARY_SEARCH* = 1\n    proc meguru_bisect*(ok, ng: int, is_ok: proc(x: int): bool): int =\n        var\n            ok = ok\n            ng = ng\n        while abs(ok - ng) > 1:\n            var mid = (ok + ng) div 2\n            if is_ok(mid): ok = mid\n            else: ng = mid\n        return ok\n\n    proc meguru_bisect*(ok, ng: SomeFloat, is_ok: proc(x: SomeFloat): bool, eps: SomeFloat = 1e-10): SomeFloat =\n        var\n            ok = ok\n            ng = ng\n        while abs(ok - ng) > eps and abs(ok - ng) / max(ok, ng) > eps:\n            var mid = (ok + ng) / 2\n            if is_ok(mid): ok = mid\n            else: ng = mid\n        return ok\n"
var N,M,K = ii()

if K >= (N-1)+(M-1):
    echo 10**9
    quit()

var A = newseqwith(N,lii(M))
proc is_ok(arg:int):bool=
    var X = newSeqWith(N,newseqwith(M,-1))
    for i in range(N):
        for j in range(M):
            if A[i][j] < arg:
                X[i][j] = 1
            else:
                X[i][j] = 0
    
    var d = initDeque[(int,int,int)]()
    d.addLast((0,0,X[0][0]))
    var cost = newSeqWith(N,newSeqwith(M,INF))
    cost[0][0] = X[0][0]
    while len(d) != 0:
        var (i,j,c) = d.popFirst()
        if c != cost[i][j]:
            continue
        for (di,dj) in [(1,0),(-1,0),(0,-1),(0,1)]:
            if i+di in 0..<N and j+dj in 0..<M and cost[i+di][j+dj] > c+X[i+di][j+dj]:
                if X[i+di][j+dj] == 0:
                    cost[i+di][j+dj] = c
                    d.addFirst((i+di,j+dj,c))
                else:
                    cost[i+di][j+dj] = c+1
                    d.addLast((i+di,j+dj,c+1))
    return cost[^1][^1] <= K




echo meguru_bisect(0,10**9+1,is_ok)

yukicoder

結果

テストケース

ソースコード