#1008219 (Nim) No.1211 円環はお断り

提出ソース

結果

問題	No.1211 円環はお断り
ユーザー	👑 seekworser
提出日時	2024-09-08 03:29:44
言語	Nim (2.0.2)
結果	WA
実行時間	-
コード長	9,077 bytes
コンパイル時間	4,769 ms
コンパイル使用メモリ	91,264 KB
実行使用メモリ	54,200 KB
最終ジャッジ日時	2024-09-08 03:30:21
合計ジャッジ時間	36,328 ms
ジャッジサーバーID （参考情報）	judge2 / judge1

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	WA	-
testcase_01	WA	-
testcase_02	AC	2 ms 6,940 KB
testcase_03	AC	1 ms 6,940 KB
testcase_04	AC	1 ms 6,944 KB
testcase_05	WA	-
testcase_06	AC	2 ms 6,944 KB
testcase_07	AC	2 ms 6,944 KB
testcase_08	WA	-
testcase_09	AC	2 ms 6,940 KB
testcase_10	AC	2 ms 6,940 KB
testcase_11	AC	2 ms 6,944 KB
testcase_12	AC	1 ms 6,940 KB
testcase_13	AC	724 ms 28,284 KB
testcase_14	AC	919 ms 37,564 KB
testcase_15	AC	1,049 ms 36,656 KB
testcase_16	AC	1,912 ms 53,000 KB
testcase_17	AC	99 ms 7,040 KB
testcase_18	AC	873 ms 31,708 KB
testcase_19	AC	115 ms 7,168 KB
testcase_20	AC	128 ms 8,704 KB
testcase_21	AC	130 ms 8,576 KB
testcase_22	AC	773 ms 29,044 KB
testcase_23	AC	955 ms 34,844 KB
testcase_24	AC	503 ms 20,580 KB
testcase_25	AC	23 ms 6,940 KB
testcase_26	AC	1,128 ms 39,376 KB
testcase_27	AC	505 ms 20,680 KB
testcase_28	AC	1,171 ms 40,356 KB
testcase_29	AC	1,101 ms 31,352 KB
testcase_30	AC	1,188 ms 41,988 KB
testcase_31	AC	484 ms 18,516 KB
testcase_32	AC	1,762 ms 46,860 KB
testcase_33	AC	1,825 ms 53,992 KB
testcase_34	AC	1,827 ms 54,200 KB
testcase_35	AC	1,764 ms 53,164 KB
testcase_36	AC	1,856 ms 54,008 KB
testcase_37	AC	1,832 ms 53,524 KB
testcase_38	AC	1,846 ms 53,996 KB
testcase_39	AC	1,825 ms 53,264 KB
testcase_40	WA	-
testcase_41	AC	2 ms 6,948 KB
testcase_42	AC	1 ms 6,944 KB

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

ソースコード

raw source code

import macros;macro ImportExpand(s:untyped):untyped = parseStmt($s[2])
# source: https://github.com/kemuniku/cplib/tree/main/src/cplib/tmpl/citrus.nim
ImportExpand "cplib/tmpl/citrus" <=== "when not declared CPLIB_TMPL_CITRUS:\n    const CPLIB_TMPL_CITRUS* = 1\n    {.warning[UnusedImport]: off.}\n    {.hint[XDeclaredButNotUsed]: off.}\n    import os\n    import algorithm\n    import sequtils\n    import tables\n    import macros\n    import std/math\n    import sets\n    import strutils\n    import strformat\n    import sugar\n    import streams\n    import deques\n    import bitops\n    import heapqueue\n    import options\n    import hashes\n    const MODINT998244353* = 998244353\n    const MODINT1000000007* = 1000000007\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    \n    const INFL = INF64\n    type double* = float64\n    let readNext = iterator(getsChar: bool = false): string {.closure.} =\n        while true:\n            var si: string\n            try: si = stdin.readLine\n            except EOFError: yield \"\"\n            for s in si.split:\n                if getsChar:\n                    for i in 0..<s.len():\n                        yield s[i..i]\n                else:\n                    if s.isEmptyOrWhitespace: continue\n                    yield s\n    proc input*(t: typedesc[string]): string = readNext()\n    proc input*(t: typedesc[char]): char = readNext(true)[0]\n    proc input*(t: typedesc[int]): int = readNext().parseInt\n    proc input*(t: typedesc[float]): float = readNext().parseFloat\n    macro input*(t: typedesc, n: varargs[int]): untyped =\n        var repStr = \"\"\n        for arg in n:\n            repStr &= &\"({arg.repr}).newSeqWith \"\n        parseExpr(&\"{repStr}input({t})\")\n    macro input*(ts: varargs[auto]): untyped =\n        var tupStr = \"\"\n        for t in ts:\n            tupStr &= &\"input({t.repr}),\"\n        parseExpr(&\"({tupStr})\")\n    macro input*(n: int, ts: varargs[auto]): untyped =\n        for typ in ts:\n            if typ.typeKind != ntyAnything:\n                error(\"Expected typedesc, got \" & typ.repr, typ)\n        parseExpr(&\"({n.repr}).newSeqWith input({ts.repr})\")\n    proc `fmtprint`*(x: int or string or char or bool): string = return $x\n    proc `fmtprint`*(x: float or float32 or float64): string = return &\"{x:.16f}\"\n    proc `fmtprint`*[T](x: seq[T] or Deque[T] or HashSet[T] or set[T]): string = return x.toSeq.join(\" \")\n    proc `fmtprint`*[T, N](x: array[T, N]): string = return x.toSeq.join(\" \")\n    proc `fmtprint`*[T](x: HeapQueue[T]): string =\n        var q = x\n        while q.len != 0:\n            result &= &\"{q.pop()}\"\n            if q.len != 0: result &= \" \"\n    proc `fmtprint`*[T](x: CountTable[T]): string =\n        result = x.pairs.toSeq.mapIt(&\"{it[0]}: {it[1]}\").join(\" \")\n    proc `fmtprint`*[K, V](x: Table[K, V]): string =\n        result = x.pairs.toSeq.mapIt(&\"{it[0]}: {it[1]}\").join(\" \")\n    proc print*(prop: tuple[f: File, sepc: string, endc: string, flush: bool], args: varargs[string, `fmtprint`]) =\n        for i in 0..<len(args):\n            prop.f.write(&\"{args[i]}\")\n            if i != len(args) - 1: prop.f.write(prop.sepc) else: prop.f.write(prop.endc)\n        if prop.flush: prop.f.flushFile()\n    proc print*(args: varargs[string, `fmtprint`]) = print((f: stdout, sepc: \" \", endc: \"\\n\", flush: false), args)\n    const LOCAL_DEBUG{.booldefine.} = false\n    macro getSymbolName(x: typed): string = x.toStrLit\n    macro debug*(args: varargs[untyped]): untyped =\n        when LOCAL_DEBUG:\n            result = newNimNode(nnkStmtList, args)\n            template prop(e: string = \"\"): untyped = (f: stderr, sepc: \"\", endc: e, flush: true)\n            for i, arg in args:\n                if arg.kind == nnkStrLit:\n                    result.add(quote do: print(prop(), \"\\\"\", `arg`, \"\\\"\"))\n                else:\n                    result.add(quote do: print(prop(\": \"), getSymbolName(`arg`)))\n                    result.add(quote do: print(prop(), `arg`))\n                if i != args.len - 1: result.add(quote do: print(prop(), \", \"))\n                else: result.add(quote do: print(prop(), \"\\n\"))\n        else:\n            return (quote do: discard)\n    proc `%`*(x: SomeInteger, y: SomeInteger): 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: SomeInteger, y: SomeInteger): int =\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: SomeInteger, y: SomeInteger): int = x xor y\n    proc `&`*(x: SomeInteger, y: SomeInteger): int = x and y\n    proc `|`*(x: SomeInteger, y: SomeInteger): int = x or y\n    proc `>>`*(x: SomeInteger, y: SomeInteger): int = x shr y\n    proc `<<`*(x: SomeInteger, y: SomeInteger): int = x shl y\n    proc `%=`*(x: var SomeInteger, y: SomeInteger): void = x = x % y\n    proc `//=`*(x: var SomeInteger, y: SomeInteger): void = x = x // y\n    proc `^=`*(x: var SomeInteger, y: SomeInteger): void = x = x ^ y\n    proc `&=`*(x: var SomeInteger, y: SomeInteger): void = x = x & y\n    proc `|=`*(x: var SomeInteger, y: SomeInteger): void = x = x | y\n    proc `>>=`*(x: var SomeInteger, y: SomeInteger): void = x = x >> y\n    proc `<<=`*(x: var SomeInteger, y: SomeInteger): void = x = x << y\n    proc `[]`*(x, n: int): bool = (x and (1 shl n)) != 0\n    proc `[]=`*(x: var int, n: int, i: bool) =\n        if i: x = x or (1 << n)\n        else: (if x[n]: x = x xor (1 << n))\n    proc pow*(a, n: int, m = INF64): int =\n        var\n            rev = 1\n            a = a\n            n = n\n        while n > 0:\n            if n % 2 != 0: rev = (rev * a) mod m\n            if n > 1: a = (a * a) mod m\n            n >>= 1\n        return rev\n    when not declared CPLIB_MATH_ISQRT:\n        const CPLIB_MATH_ISQRT* = 1\n        proc isqrt*(n: int): int =\n            var x = n\n            var y = (x + 1) shr 1\n            while y < x:\n                x = y\n                y = (x + n div x) shr 1\n            return x\n    \n    proc chmax*[T](x: var T, y: T): bool {.discardable.} = (if x < y: (x = y; return true; ) return false)\n    proc chmin*[T](x: var T, y: T): bool {.discardable.} = (if x > y: (x = y; return true; ) return false)\n    proc `max=`*[T](x: var T, y: T) = x = max(x, y)\n    proc `min=`*[T](x: var T, y: T) = x = min(x, y)\n    proc at*(x: char, a = '0'): int = int(x) - int(a)\n    proc Yes*(b: bool = true): void = print(if b: \"Yes\" else: \"No\")\n    proc No*(b: bool = true): void = Yes(not b)\n    proc YES_upper*(b: bool = true): void = print(if b: \"YES\" else: \"NO\")\n    proc NO_upper*(b: bool = true): void = Yes_upper(not b)\n    const DXY* = [(0, -1), (0, 1), (-1, 0), (1, 0)]\n    const DDXY* = [(1, -1), (1, 0), (1, 1), (0, -1), (0, 1), (-1, -1), (-1, 0), (-1, 1)]\n    macro exit*(statement: untyped): untyped = (quote do: (`statement`; quit()))\n    proc initHashSet[T](): Hashset[T] = initHashSet[T](0)\n"
# source: https://github.com/kemuniku/cplib/tree/main/src/cplib/utils/binary_search.nim
ImportExpand "cplib/utils/binary_search" <=== "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"

{.checks: off.}

var n, k = input(int)
var a = input(int, n)
var cum = (@[0] & a & a).cumsummed
var m = 20

proc cnt(x: int): int =
    var d = newSeqWith(m, newSeqWith(n, (-1, -1)))
    for i in 0..<n:
        var nx = cum.lowerBound(cum[i] + x)
        d[0][i] = (nx % n, (nx - i))
    for di in 1..<m:
        for i in 0..<n:
            var (nx, cnt) = d[di-1][i]
            var (nxn, cntn) = d[di-1][nx]
            d[di][i] = (nxn, cnt + cntn)
    
    result = 0
    for i in 0..<n:
        var rem = n
        var p = i
        var cnt = 0
        while d[0][p][1] <= rem:
            var add = 1
            var dx = 0
            while d[dx + 1][p][1] <= rem:
                dx += 1
                add *= 2
            cnt += add
            rem -= d[dx][p][1]
            p = d[dx][p][0]
        if cnt >= k: result += 1
    
proc ok(x: int): bool = (cnt(x) != 0)
var asum = a.sum
var ans = meguru_bisect(0, asum, ok)

print(ans)

yukicoder

結果

テストケース

ソースコード