結果
問題 | No.769 UNOシミュレータ |
ユーザー | iad_2889 |
提出日時 | 2019-05-09 18:42:32 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,145 bytes |
コンパイル時間 | 83 ms |
コンパイル使用メモリ | 12,800 KB |
実行使用メモリ | 29,312 KB |
最終ジャッジ日時 | 2024-05-02 00:34:44 |
合計ジャッジ時間 | 7,654 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 32 ms
10,880 KB |
testcase_01 | AC | 32 ms
10,880 KB |
testcase_02 | AC | 30 ms
10,880 KB |
testcase_03 | AC | 30 ms
10,880 KB |
testcase_04 | AC | 33 ms
10,880 KB |
testcase_05 | AC | 32 ms
10,880 KB |
testcase_06 | AC | 33 ms
11,008 KB |
testcase_07 | AC | 32 ms
10,880 KB |
testcase_08 | AC | 32 ms
10,880 KB |
testcase_09 | WA | - |
testcase_10 | AC | 57 ms
11,392 KB |
testcase_11 | AC | 57 ms
11,392 KB |
testcase_12 | WA | - |
testcase_13 | AC | 308 ms
16,768 KB |
testcase_14 | AC | 301 ms
16,640 KB |
testcase_15 | WA | - |
testcase_16 | AC | 582 ms
22,912 KB |
testcase_17 | AC | 590 ms
22,784 KB |
testcase_18 | AC | 866 ms
29,056 KB |
testcase_19 | AC | 856 ms
29,184 KB |
testcase_20 | WA | - |
testcase_21 | AC | 862 ms
29,312 KB |
testcase_22 | WA | - |
ソースコード
def get_next(N): def _(current,reverse): if reverse: next = current - 1 if next < 0: next-=N else: next = current + 1 return next % N return _ N,M = map(int,input().split()) log = [input() for x in range(M)] players = [0 for x in range(N)] g_next = get_next(N) current = -1 reverse = False d_two = 0 d_four = 0 for card in log: if current == -1: current = 0 else: current = g_next(current,reverse) if d_two: if card == "drawtwo": d_two+=2 else: players[current]-=d_two d_two = 0 current = g_next(current,reverse) if d_four: if card == "drawfour": d_four+=4 else: players[current]-=d_four d_four = 0 current = g_next(current,reverse) players[current]+=1 if card == "drawtwo": d_two+=2 elif card == "drawfour": d_four+=4 elif card == "skip": current = g_next(current,reverse) elif card == "reverse": reverse^=True print(current + 1,players[current])