結果

問題 No.769 UNOシミュレータ
ユーザー takumi152
提出日時 2019-05-28 18:30:54
言語 Python3
(3.13.1 + numpy 2.2.1 + scipy 1.14.1)
結果
AC  
実行時間 721 ms / 2,000 ms
コード長 1,348 bytes
コンパイル時間 222 ms
コンパイル使用メモリ 12,672 KB
実行使用メモリ 29,056 KB
最終ジャッジ日時 2024-11-22 09:20:21
合計ジャッジ時間 6,850 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 23
権限があれば一括ダウンロードができます

ソースコード

diff # 

def main():
    buf = input()
    buflist = buf.split()
    N = int(buflist[0])
    M = int(buflist[1])
    cardlog = []
    for i in range(M):
        buf = input()
        cardlog.append(buf)
    card_count = []
    for i in range(N):
        card_count.append(0)
    current_turn = 0
    reverse = False
    lastlog = ''
    draw_stack = 0
    for log in cardlog:
        if draw_stack > 0 and lastlog != log:
            card_count[current_turn] -= draw_stack
            draw_stack = 0
            current_turn = next_turn(current_turn, reverse, N)
        card_count[current_turn] += 1
        if log == 'number':
            pass
        elif log == 'drawtwo':
            draw_stack += 2
        elif log == 'drawfour':
            draw_stack += 4
        elif log == 'skip':
            current_turn = next_turn(current_turn, reverse, N)
        elif log == 'reverse':
            reverse = not reverse
        lastlog = log
        current_turn = next_turn(current_turn, reverse, N)
    winner = next_turn(current_turn, not reverse, N)
    if lastlog == 'skip':
        winner = next_turn(winner, not reverse, N)
    print(winner + 1, card_count[winner])

def next_turn(current_turn, reverse, N):
    if reverse:
        return (current_turn - 1) % N
    else:
        return (current_turn + 1) % N

if __name__ == '__main__':
    main()
0