結果
問題 | No.1701 half price |
ユーザー |
|
提出日時 | 2021-11-03 09:46:10 |
言語 | Nim (2.2.0) |
結果 |
CE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 4,407 bytes |
コンパイル時間 | 903 ms |
コンパイル使用メモリ | 72,304 KB |
最終ジャッジ日時 | 2024-11-15 01:53:30 |
合計ジャッジ時間 | 1,303 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。(リジャッジ後のコンパイルエラーは公開されます)
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
コンパイルメッセージ
/home/judge/data/code/Main.nim(110, 21) Error: type mismatch: got 'seq[int]' for 'inputInts()' but expected 'tuple'
ソースコード
when not declared ATCODER_YULY3HEADER_HPP:const ATCODER_YULY3HEADER_HPP* = 1importalgorithm,bitops,deques,heapqueue,math,macros,sets,sequtils,strformat,strutils,sugar,tablesproc transLastStmt(n, res, bracketExpr: NimNode): (NimNode, NimNode, NimNode) =# Looks for the last statement of the last statement, etc...case n.kindof nnkIfExpr, nnkIfStmt, nnkTryStmt, nnkCaseStmt:result[0] = copyNimTree(n)result[1] = copyNimTree(n)result[2] = copyNimTree(n)for i in ord(n.kind == nnkCaseStmt)..<n.len:(result[0][i], result[1][^1], result[2][^1]) = transLastStmt(n[i], res, bracketExpr)of nnkStmtList, nnkStmtListExpr, nnkBlockStmt, nnkBlockExpr, nnkWhileStmt,nnkForStmt, nnkElifBranch, nnkElse, nnkElifExpr, nnkOfBranch, nnkExceptBranch:result[0] = copyNimTree(n)result[1] = copyNimTree(n)result[2] = copyNimTree(n)if n.len >= 1:(result[0][^1], result[1][^1], result[2][^1]) = transLastStmt(n[^1],res, bracketExpr)of nnkTableConstr:result[1] = n[0][0]result[2] = n[0][1]if bracketExpr.len == 1:bracketExpr.add([newCall(bindSym"typeof", newEmptyNode()), newCall(bindSym"typeof", newEmptyNode())])template adder(res, k, v) = res[k] = vresult[0] = getAst(adder(res, n[0][0], n[0][1]))of nnkCurly:result[2] = n[0]if bracketExpr.len == 1:bracketExpr.add(newCall(bindSym"typeof", newEmptyNode()))template adder(res, v) = res.incl(v)result[0] = getAst(adder(res, n[0]))else:result[2] = nif bracketExpr.len == 1:bracketExpr.add(newCall(bindSym"typeof", newEmptyNode()))template adder(res, v) = res.add(v)result[0] = getAst(adder(res, n))macro collect*(init, body: untyped): untyped =runnableExamples:import sets, tableslet data = @["bird", "word"]## seq:let k = collect(newSeq):for i, d in data.pairs:if i mod 2 == 0: dassert k == @["bird"]## seq with initialSize:let x = collect(newSeqOfCap(4)):for i, d in data.pairs:if i mod 2 == 0: dassert x == @["bird"]## HashSet:let y = initHashSet.collect:for d in data.items: {d}assert y == data.toHashSet## Table:let z = collect(initTable(2)):for i, d in data.pairs: {i: d}assert z == {0: "bird", 1: "word"}.toTablelet res = genSym(nskVar, "collectResult")expectKind init, {nnkCall, nnkIdent, nnkSym}let bracketExpr = newTree(nnkBracketExpr,if init.kind == nnkCall: init[0] else: init)let (resBody, keyType, valueType) = transLastStmt(body, res, bracketExpr)if bracketExpr.len == 3:bracketExpr[1][1] = keyTypebracketExpr[2][1] = valueTypeelse:bracketExpr[1][1] = valueTypelet call = newTree(nnkCall, bracketExpr)if init.kind == nnkCall:for i in 1 ..< init.len:call.add init[i]result = newTree(nnkStmtListExpr, newVarStmt(res, call), resBody, res)proc input*(): string {.inline.} = stdin.readLineproc inputs*(): seq[string] {.inline.} = stdin.readLine.splitproc inputInt*(): int {.inline.} = stdin.readLine.parseIntproc inputInts*(): seq[int] {.inline.} = stdin.readLine.split.map(parseInt)proc chmax*[T](n: var T, m: T) {.inline.} = n = max(n, m)proc chmin*[T](n: var T, m: T) {.inline.} = n = min(n, m)proc `%=`*[T: SomeInteger](n: var T, m: T) {.inline.} = n = floorMod(n, m)proc `|=`*[T: SomeInteger or bool](n: var T, m: T) {.inline.} = n = n or mproc `&=`*[T: SomeInteger or bool](n: var T, m: T) {.inline.} = n = n and mproc `^=`*[T: SomeInteger or bool](n: var T, m: T) {.inline.} = n = n xor mproc `<<=`*[T: SomeInteger](n: var T, m: T) {.inline.} = n = n shl mproc `>>=`*[T: SomeInteger](n: var T, m: T) {.inline.} = n = n shr mwhen isMainModule:var N, W: int(N, W) = inputInts()var a = inputInts()var cmb = initHashSet[int]()proc dfs(T, cur, sm: int) =if cur == N:if sm == W:cmb.incl(T)returnif bitand(T shr cur, 1) == 1:dfs(T, cur + 1, sm + a[cur])dfs(T, cur + 1, sm + a[cur] div 2)else:dfs(T, cur + 1, sm)for S in 1..<1 shl N:dfs(S, 0, 0)echo cmb.len