結果

問題 No.769 UNOシミュレータ
ユーザー _KingdomOfMoray
提出日時 2019-11-27 13:33:17
言語 Python3
(3.13.1 + numpy 2.2.1 + scipy 1.14.1)
結果
RE  
実行時間 -
コード長 1,471 bytes
コンパイル時間 316 ms
コンパイル使用メモリ 12,800 KB
実行使用メモリ 29,184 KB
最終ジャッジ日時 2024-11-22 09:29:00
合計ジャッジ時間 8,155 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 8 WA * 4 RE * 11
権限があれば一括ダウンロードができます

ソースコード

diff # 

# coding: utf-8
# Your code here!

input_params = list(map(int,input().split()))
n = input_params[0]
m = input_params[1]
card = [input() for i in range(m)]
count = [0] * n

def get_next_turn(turn, direction):
    if direction == 1:
        if turn == n:
            return 1
        else:
            return turn + 1
    else:
        if turn == 1:
            return n
        else:
            return turn -1
        
turn = 1
direction = 1
res = -1
for i in range(len(card)):
    # print('turn: {}'.format(turn))
    if i == len(card)-1:
        res = turn
        
        
    count[turn-1] += 1
    
    if card[i] == 'number':
        turn = get_next_turn(turn, direction)
    elif card[i] == 'drawtwo':
        if card[i+1] == 'drawtwo':
            turn = get_next_turn(turn, direction)
        else:
            turn = get_next_turn(turn, direction)
            count[turn-1] -= 2
            turn = get_next_turn(turn, direction)
    elif card[i] == 'drawfour':
        if card[i+1] == 'drawfour':
            turn = get_next_turn(turn, direction)
        else:
            turn = get_next_turn(turn, direction)
            count[turn-1] -= 4
            turn = get_next_turn(turn, direction)
    elif card[i] == 'skip':
        turn = get_next_turn(turn, direction)
        turn = get_next_turn(turn, direction)
    elif card[i] == 'reverse':
        direction *= -1
        turn = get_next_turn(turn, direction)
    
print('{} {}'.format(res, count[res-1]))
0