結果

問題 No.2732 Similar Permutations
ユーザー 👑 seekworserseekworser
提出日時 2024-04-19 23:39:30
言語 Nim
(2.0.2)
結果
AC  
実行時間 79 ms / 2,000 ms
コード長 7,522 bytes
コンパイル時間 5,815 ms
コンパイル使用メモリ 91,288 KB
実行使用メモリ 41,216 KB
最終ジャッジ日時 2024-10-11 18:24:32
合計ジャッジ時間 21,393 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 23 ms
11,892 KB
testcase_03 AC 42 ms
21,120 KB
testcase_04 AC 14 ms
7,808 KB
testcase_05 AC 12 ms
7,168 KB
testcase_06 AC 6 ms
5,248 KB
testcase_07 AC 33 ms
15,488 KB
testcase_08 AC 16 ms
8,704 KB
testcase_09 AC 9 ms
5,888 KB
testcase_10 AC 79 ms
40,704 KB
testcase_11 AC 7 ms
5,248 KB
testcase_12 AC 76 ms
37,376 KB
testcase_13 AC 75 ms
37,376 KB
testcase_14 AC 75 ms
37,368 KB
testcase_15 AC 75 ms
37,376 KB
testcase_16 AC 55 ms
25,088 KB
testcase_17 AC 53 ms
24,320 KB
testcase_18 AC 70 ms
34,048 KB
testcase_19 AC 74 ms
37,376 KB
testcase_20 AC 76 ms
37,888 KB
testcase_21 AC 75 ms
37,248 KB
testcase_22 AC 45 ms
21,120 KB
testcase_23 AC 75 ms
38,016 KB
testcase_24 AC 44 ms
21,248 KB
testcase_25 AC 78 ms
38,016 KB
testcase_26 AC 61 ms
25,856 KB
testcase_27 AC 76 ms
38,128 KB
testcase_28 AC 57 ms
24,320 KB
testcase_29 AC 76 ms
38,016 KB
testcase_30 AC 54 ms
23,168 KB
testcase_31 AC 76 ms
37,376 KB
testcase_32 AC 69 ms
32,896 KB
testcase_33 AC 75 ms
37,376 KB
testcase_34 AC 49 ms
21,504 KB
testcase_35 AC 74 ms
37,376 KB
testcase_36 AC 69 ms
33,024 KB
testcase_37 AC 75 ms
37,504 KB
testcase_38 AC 62 ms
26,368 KB
testcase_39 AC 77 ms
37,376 KB
testcase_40 AC 60 ms
25,984 KB
testcase_41 AC 75 ms
37,376 KB
testcase_42 AC 55 ms
23,936 KB
testcase_43 AC 75 ms
37,376 KB
testcase_44 AC 41 ms
20,608 KB
testcase_45 AC 74 ms
37,368 KB
testcase_46 AC 67 ms
32,896 KB
testcase_47 AC 73 ms
37,248 KB
testcase_48 AC 45 ms
21,288 KB
testcase_49 AC 75 ms
37,376 KB
testcase_50 AC 44 ms
21,336 KB
testcase_51 AC 70 ms
36,864 KB
testcase_52 AC 60 ms
25,344 KB
testcase_53 AC 78 ms
41,216 KB
testcase_54 AC 77 ms
37,888 KB
testcase_55 AC 74 ms
37,248 KB
testcase_56 AC 75 ms
37,376 KB
testcase_57 AC 44 ms
21,888 KB
testcase_58 AC 57 ms
26,112 KB
testcase_59 AC 51 ms
23,296 KB
testcase_60 AC 45 ms
22,272 KB
testcase_61 AC 39 ms
20,536 KB
testcase_62 AC 62 ms
27,136 KB
testcase_63 AC 2 ms
5,248 KB
testcase_64 AC 1 ms
5,248 KB
testcase_65 AC 2 ms
5,248 KB
testcase_66 AC 2 ms
5,248 KB
testcase_67 AC 2 ms
5,248 KB
testcase_68 AC 2 ms
5,248 KB
testcase_69 AC 2 ms
5,248 KB
testcase_70 AC 1 ms
5,248 KB
testcase_71 AC 1 ms
5,248 KB
testcase_72 AC 2 ms
5,248 KB
testcase_73 AC 1 ms
5,248 KB
testcase_74 AC 2 ms
5,248 KB
testcase_75 AC 1 ms
5,248 KB
testcase_76 AC 2 ms
5,248 KB
testcase_77 AC 2 ms
5,248 KB
testcase_78 AC 2 ms
5,248 KB
testcase_79 AC 1 ms
5,248 KB
testcase_80 AC 2 ms
5,248 KB
testcase_81 AC 1 ms
5,248 KB
testcase_82 AC 1 ms
5,248 KB
testcase_83 AC 2 ms
5,248 KB
testcase_84 AC 2 ms
5,248 KB
testcase_85 AC 2 ms
5,248 KB
testcase_86 AC 2 ms
5,248 KB
testcase_87 AC 1 ms
5,248 KB
testcase_88 AC 2 ms
5,248 KB
testcase_89 AC 1 ms
5,248 KB
testcase_90 AC 2 ms
5,248 KB
testcase_91 AC 1 ms
5,248 KB
testcase_92 AC 1 ms
5,248 KB
testcase_93 AC 1 ms
5,248 KB
testcase_94 AC 1 ms
5,248 KB
testcase_95 AC 1 ms
5,248 KB
testcase_96 AC 2 ms
5,248 KB
testcase_97 AC 2 ms
5,248 KB
testcase_98 AC 1 ms
5,248 KB
testcase_99 AC 2 ms
5,248 KB
testcase_100 AC 1 ms
5,248 KB
testcase_101 AC 2 ms
5,248 KB
testcase_102 AC 1 ms
5,248 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    import hashes\n    const MODINT998244353* = 998244353\n    const MODINT1000000007* = 1000000007\n    #[ include cplib/utils/infl ]#\n    when not declared CPLIB_UTILS_INFL:\n        const CPLIB_UTILS_INFL* = 1\n        const INFi32* = 100100111.int32\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 =\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 = 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    #[ include cplib/math/isqrt ]#\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    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"

var n = input(int)
var a = input(int, n)

var t = initTable[int, seq[int]](n)
var ans = (1..n).toseq
while true:
    var x = 0
    for i in 0..<n:
        x ^= ans[i] + a[i]
    if x in t:
        print(t[x])
        print(ans)
        quit()
    t[x] = ans
    if not ans.nextPermutation: break
print(-1)
0