結果

問題 No.2278 Time Bomb Game 2
ユーザー Daylight
提出日時 2023-04-21 22:10:31
言語 Nim
(2.2.0)
結果
WA  
(最新)
AC  
(最初)
実行時間 -
コード長 3,314 bytes
コンパイル時間 5,098 ms
コンパイル使用メモリ 75,708 KB
実行使用メモリ 6,824 KB
最終ジャッジ日時 2024-11-06 17:03:54
合計ジャッジ時間 6,794 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 69 WA * 1
権限があれば一括ダウンロードができます
コンパイルメッセージ
/home/judge/data/code/Main.nim(25, 12) Warning: imported and not used: 'sugar' [UnusedImport]
/home/judge/data/code/Main.nim(23, 15) Warning: imported and not used: 'math' [UnusedImport]
/home/judge/data/code/Main.nim(15, 12) Warning: imported and not used: 'algorithm' [UnusedImport]
/home/judge/data/code/Main.nim(18, 12) Warning: imported and not used: 'lists' [UnusedImport]
/home/judge/data/code/Main.nim(21, 12) Warning: imported and not used: 'sequtils' [UnusedImport]

ソースコード

diff # 

import macros
macro Please(x): untyped = nnkStmtList.newTree()

Please use Nim-ACL
Please use Nim-ACL
Please use Nim-ACL



#[ include daylight/base ]#
when not declared DAYLIGHT_BASE_HPP:
    const DAYLIGHT_BASE_HPP* = 1
    import system
    import macros
    import algorithm
    import tables
    import sets
    import lists
    import intsets
    import critbits
    import sequtils
    import strutils
    import std/math
    import strformat
    import sugar
    let readToken* = iterator(oneChar: bool = false): string {.closure.}= 
        while true:
            var line = stdin.readLine.split
            for s in line:
                if oneChar:
                    for i in 0..<s.len():
                        yield s[i..i]
                else:
                    yield s
    proc read*(t: typedesc[string]): string = 
        result = readToken()
        while result == "":
            result = readToken()
    proc read*(t: typedesc[int]): int = read(string).parseInt
    proc read*(t: typedesc[float]): float = read(string).parseFloat
    proc read*(t: typedesc[char]): char = readToken(true)[0]

    macro readSeq*(t: typedesc, n: varargs[int]): untyped =
        var repStr = ""
        for arg in n:
            repStr &= &"({arg.repr}).newSeqWith "
        parseExpr(&"{repStr}read({t})")
    
    macro read*(ts: varargs[auto]): untyped=
        var tupStr = ""
        for t in ts:
            tupStr &= &"read({t.repr}),"
        parseExpr(&"({tupStr})")
        
    macro readTupleSeq*(n: int, ts:varargs[auto]): untyped=
        for typ in ts:
            if typ.typeKind != ntyAnything:
                error("Expected typedesc, got " & typ.repr, typ)
        parseExpr(&"({n.repr}).newSeqWith read({ts.repr})")
        
    macro initSeq*(t: typedesc, n: varargs[int]): untyped =
        var repStr = ""
        for i, arg in n:
            if i == n.len - 1:
                repStr &= &"newSeq[{t}]({arg.repr}) "
            else:
                repStr &= &"({arg.repr}).newSeqWith "
        parseExpr(repStr)
    
    
    proc `-`*(a,b: char): int = ord(a) - ord(b)
    proc `+`*(a: char,b: int): char = char(ord(a) + b)
    proc `-`*(a: char,b: int): char = char(ord(a) - b)
    proc `++`*(a: var int) = a += 1
    proc `--`*(a: var int) = a += 1

    proc chmin*[T](a: var T, b: T): bool {.discardable.} =
        if a > b:
            a = b
            return true
        return false
    
    proc chmax*[T](a: var T, b: T): bool {.discardable.} =
        if a < b:
            a = b
            return true
        return false
    const INF* = (1e9+100).int
    const LINF* = (4e18 + 100).int
    discard

proc solve() =
    var
        (N, K, T) = read(int, int, int)
        C = read(string)
        L = -1
        R = -1
        
    for i in countdown(K-2,0):
        if C[i] != C[K - 1]:
            L = i
            break
    for i in countup(K,N-1):
        if C[i] != C[K-1]:
            R = i
            break
    if L != -1 and (K - 1 - L ) mod 2 == T mod 2 and (K - 1 - L) <= T:
        echo (if C[K-1] == 'A': "Alice" else: "Bob")
        return
    if R != -1 and (R - K + 1) mod 2 == T mod 2 and (R - K + 1) <= T:
        echo (if C[K-1] == 'A': "Alice" else: "Bob")
        return
    
    echo if C[K-1] == 'A': "Bob" else: "Alice"
        

solve()
0