結果
問題 | No.769 UNOシミュレータ |
ユーザー | _KingdomOfMoray |
提出日時 | 2019-11-27 14:41:26 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
AC
|
実行時間 | 920 ms / 2,000 ms |
コード長 | 1,712 bytes |
コンパイル時間 | 94 ms |
コンパイル使用メモリ | 12,800 KB |
実行使用メモリ | 29,184 KB |
最終ジャッジ日時 | 2024-11-22 09:30:31 |
合計ジャッジ時間 | 8,396 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 31 ms
10,880 KB |
testcase_01 | AC | 31 ms
10,752 KB |
testcase_02 | AC | 32 ms
10,880 KB |
testcase_03 | AC | 31 ms
10,880 KB |
testcase_04 | AC | 34 ms
10,624 KB |
testcase_05 | AC | 35 ms
10,880 KB |
testcase_06 | AC | 39 ms
10,752 KB |
testcase_07 | AC | 36 ms
10,752 KB |
testcase_08 | AC | 34 ms
10,880 KB |
testcase_09 | AC | 62 ms
11,264 KB |
testcase_10 | AC | 60 ms
11,264 KB |
testcase_11 | AC | 60 ms
11,264 KB |
testcase_12 | AC | 327 ms
16,512 KB |
testcase_13 | AC | 312 ms
16,640 KB |
testcase_14 | AC | 320 ms
16,640 KB |
testcase_15 | AC | 637 ms
22,912 KB |
testcase_16 | AC | 619 ms
22,912 KB |
testcase_17 | AC | 632 ms
22,784 KB |
testcase_18 | AC | 918 ms
28,928 KB |
testcase_19 | AC | 904 ms
28,928 KB |
testcase_20 | AC | 920 ms
29,184 KB |
testcase_21 | AC | 903 ms
29,056 KB |
testcase_22 | AC | 31 ms
10,752 KB |
ソースコード
# 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 d2_continue = 0 d4_continue = 0 for i in range(len(card)): if i == len(card)-1: res = turn count[turn-1] += 1 break count[turn-1] += 1 if card[i] == 'number': turn = get_next_turn(turn, direction) elif card[i] == 'drawtwo': d2_continue += 1 if card[i+1] == 'drawtwo': turn = get_next_turn(turn, direction) else: turn = get_next_turn(turn, direction) count[turn-1] += -2 * d2_continue d2_continue= 0 turn = get_next_turn(turn, direction) elif card[i] == 'drawfour': d4_continue += 1 if card[i+1] == 'drawfour': turn = get_next_turn(turn, direction) else: turn = get_next_turn(turn, direction) count[turn-1] += -4 * d4_continue d4_continue= 0 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]))