結果

問題 No.2619 Sorted Nim
ユーザー 👑 seekworserseekworser
提出日時 2024-01-26 22:41:37
言語 Nim
(2.0.2)
結果
AC  
実行時間 41 ms / 2,000 ms
コード長 7,829 bytes
コンパイル時間 4,534 ms
コンパイル使用メモリ 91,736 KB
実行使用メモリ 10,368 KB
最終ジャッジ日時 2024-09-28 08:37:56
合計ジャッジ時間 8,560 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 33 ms
9,728 KB
testcase_03 AC 37 ms
9,984 KB
testcase_04 AC 33 ms
9,984 KB
testcase_05 AC 33 ms
9,728 KB
testcase_06 AC 41 ms
10,112 KB
testcase_07 AC 33 ms
9,856 KB
testcase_08 AC 39 ms
9,984 KB
testcase_09 AC 1 ms
5,376 KB
testcase_10 AC 38 ms
9,984 KB
testcase_11 AC 35 ms
9,856 KB
testcase_12 AC 37 ms
9,984 KB
testcase_13 AC 1 ms
5,376 KB
testcase_14 AC 37 ms
10,112 KB
testcase_15 AC 35 ms
9,856 KB
testcase_16 AC 37 ms
9,984 KB
testcase_17 AC 38 ms
10,368 KB
testcase_18 AC 38 ms
9,984 KB
testcase_19 AC 30 ms
9,728 KB
testcase_20 AC 31 ms
9,728 KB
testcase_21 AC 39 ms
10,112 KB
testcase_22 AC 33 ms
9,984 KB
testcase_23 AC 36 ms
9,984 KB
testcase_24 AC 37 ms
9,984 KB
testcase_25 AC 36 ms
10,112 KB
testcase_26 AC 35 ms
9,856 KB
testcase_27 AC 31 ms
9,728 KB
testcase_28 AC 40 ms
10,112 KB
testcase_29 AC 38 ms
10,368 KB
testcase_30 AC 35 ms
9,984 KB
testcase_31 AC 1 ms
5,376 KB
testcase_32 AC 32 ms
9,728 KB
testcase_33 AC 34 ms
9,984 KB
testcase_34 AC 32 ms
9,728 KB
testcase_35 AC 35 ms
9,856 KB
testcase_36 AC 38 ms
9,984 KB
testcase_37 AC 1 ms
5,376 KB
testcase_38 AC 33 ms
9,856 KB
testcase_39 AC 38 ms
10,112 KB
testcase_40 AC 32 ms
9,856 KB
testcase_41 AC 33 ms
9,984 KB
testcase_42 AC 31 ms
9,856 KB
testcase_43 AC 38 ms
10,112 KB
testcase_44 AC 35 ms
10,112 KB
testcase_45 AC 37 ms
9,984 KB
testcase_46 AC 34 ms
9,856 KB
testcase_47 AC 31 ms
9,728 KB
testcase_48 AC 1 ms
5,376 KB
testcase_49 AC 36 ms
9,856 KB
testcase_50 AC 31 ms
9,728 KB
testcase_51 AC 33 ms
9,856 KB
testcase_52 AC 1 ms
5,376 KB
testcase_53 AC 40 ms
10,240 KB
testcase_54 AC 33 ms
9,984 KB
testcase_55 AC 40 ms
10,112 KB
testcase_56 AC 34 ms
9,856 KB
testcase_57 AC 39 ms
10,112 KB
testcase_58 AC 38 ms
9,984 KB
testcase_59 AC 35 ms
9,856 KB
testcase_60 AC 30 ms
9,728 KB
testcase_61 AC 32 ms
9,856 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import macros;macro ImportExpand(s:untyped):untyped = parseStmt($s[2])
# {.checks: off.}
ImportExpand "cplib/tmpl/citrus.nim" <=== "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    const MODINT998244353* = 998244353\n    const MODINT1000000007* = 1000000007\n    const INF* = 100100111\n    const INFL* = int(3300300300300300491)\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 = (((x mod y) + y) mod y)\n    proc `//`*(x: SomeInteger, y: SomeInteger): int = ((x - (x % y)) div y)\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 = INFL): 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    proc sqrt*(x: int): int =\n        assert(x >= 0)\n        result = int(sqrt(float64(x)))\n        while result * result > x: result -= 1\n        while (result+1) * (result+1) <= x: result += 1\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    converter tofloat*(n: int): float = float(n)\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    discard\n"


# var dp = newSeqWith(10, newSeqWith(10, newSeqWith(10, newSeqWith(10, newSeqWith(10, 0)))))
# for i in 0..<10:
#     for j in i..<10:
#         for k in j..<10:
#             for l in k..<10:
#                 for s in l..<10:
#                     var st = initHashSet[int](0)
#                     for x in 0..<i: st.incl(dp[x][j][k][l][s])
#                     for y in i..<j: st.incl(dp[i][y][k][l][s])
#                     for z in j..<k: st.incl(dp[i][j][z][l][s])
#                     for z in k..<l: st.incl(dp[i][j][k][z][s])
#                     for z in l..<s: st.incl(dp[i][j][k][l][z])
#                     for x in 0..<200:
#                         if x notin st:
#                             dp[i][j][k][l][s] = x
#                             if x == 0:
#                                 debug(i, j, k, l, s, x)
#                             break

var n = input(int)
var a = input(int, n)
if n % 2 == 1: a.insert(0, 0)
var d = (0..<a.len // 2).toSeq.mapIt(a[2*it+1] - a[2*it])
var g = d.foldl(a ^ b, 0)
if g == 0: print("Second")
else: print("First")
0