結果

問題 No.2889 Rusk
ユーザー kemunikukemuniku
提出日時 2024-09-13 02:19:46
言語 Nim
(2.0.2)
結果
AC  
実行時間 222 ms / 2,000 ms
コード長 3,958 bytes
コンパイル時間 3,620 ms
コンパイル使用メモリ 77,192 KB
実行使用メモリ 22,312 KB
最終ジャッジ日時 2024-09-13 02:19:59
合計ジャッジ時間 13,031 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 1 ms
6,812 KB
testcase_02 AC 1 ms
6,944 KB
testcase_03 AC 2 ms
6,940 KB
testcase_04 AC 2 ms
6,940 KB
testcase_05 AC 2 ms
6,940 KB
testcase_06 AC 2 ms
6,940 KB
testcase_07 AC 2 ms
6,944 KB
testcase_08 AC 2 ms
6,944 KB
testcase_09 AC 2 ms
6,944 KB
testcase_10 AC 1 ms
6,940 KB
testcase_11 AC 1 ms
6,944 KB
testcase_12 AC 2 ms
6,940 KB
testcase_13 AC 2 ms
6,944 KB
testcase_14 AC 10 ms
6,940 KB
testcase_15 AC 36 ms
6,944 KB
testcase_16 AC 93 ms
10,880 KB
testcase_17 AC 26 ms
6,944 KB
testcase_18 AC 78 ms
9,472 KB
testcase_19 AC 151 ms
15,616 KB
testcase_20 AC 183 ms
18,656 KB
testcase_21 AC 148 ms
15,872 KB
testcase_22 AC 129 ms
13,952 KB
testcase_23 AC 101 ms
11,392 KB
testcase_24 AC 207 ms
18,640 KB
testcase_25 AC 100 ms
11,392 KB
testcase_26 AC 145 ms
15,616 KB
testcase_27 AC 189 ms
19,696 KB
testcase_28 AC 111 ms
12,288 KB
testcase_29 AC 116 ms
13,056 KB
testcase_30 AC 115 ms
12,800 KB
testcase_31 AC 186 ms
18,768 KB
testcase_32 AC 81 ms
9,984 KB
testcase_33 AC 23 ms
6,940 KB
testcase_34 AC 221 ms
21,896 KB
testcase_35 AC 218 ms
21,772 KB
testcase_36 AC 222 ms
21,772 KB
testcase_37 AC 219 ms
21,900 KB
testcase_38 AC 220 ms
22,312 KB
testcase_39 AC 183 ms
20,460 KB
testcase_40 AC 135 ms
16,400 KB
testcase_41 AC 180 ms
20,772 KB
testcase_42 AC 127 ms
15,232 KB
testcase_43 AC 59 ms
8,704 KB
testcase_44 AC 161 ms
18,924 KB
testcase_45 AC 124 ms
14,976 KB
testcase_46 AC 35 ms
6,940 KB
testcase_47 AC 65 ms
9,216 KB
testcase_48 AC 143 ms
17,324 KB
testcase_49 AC 2 ms
6,944 KB
testcase_50 AC 2 ms
6,944 KB
testcase_51 AC 2 ms
6,940 KB
testcase_52 AC 4 ms
6,940 KB
testcase_53 AC 1 ms
6,944 KB
testcase_54 AC 222 ms
21,644 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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"

var N = ii()
var A = lii(N)
var B = lii(N)
var C = lii(N)

#状態は(まだトースターを使っていない,今使用中,トースターを使った後)^2*N
#トースターは1から使うようにする

var DP = newseqwith(3,newseqwith(3,newseqwith(N+1,-INF)))
DP[0][0][0] = 0

for i in range(N):
    var ABC = [A[i],B[i],C[i]]
    for a in range(3):
        for b in range(3):
            for c in range(a,3):
                for d in range(b,3):
                    DP[c][d][i+1].max = DP[a][b][i] + ABC[[c,d].count(1)]

var ans = -INF
for a in range(3):
    for b in range(3):
        ans.max = DP[a][b][^1]
echo ans
0