結果
問題 | No.769 UNOシミュレータ |
ユーザー | _KingdomOfMoray |
提出日時 | 2019-11-27 13:40:13 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,475 bytes |
コンパイル時間 | 537 ms |
コンパイル使用メモリ | 12,544 KB |
実行使用メモリ | 29,056 KB |
最終ジャッジ日時 | 2024-11-22 09:30:10 |
合計ジャッジ時間 | 8,372 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 31 ms
10,752 KB |
testcase_01 | AC | 31 ms
10,880 KB |
testcase_02 | AC | 32 ms
10,752 KB |
testcase_03 | AC | 32 ms
10,880 KB |
testcase_04 | AC | 34 ms
10,752 KB |
testcase_05 | AC | 35 ms
10,752 KB |
testcase_06 | AC | 34 ms
10,752 KB |
testcase_07 | AC | 34 ms
10,752 KB |
testcase_08 | AC | 34 ms
10,752 KB |
testcase_09 | WA | - |
testcase_10 | AC | 60 ms
11,264 KB |
testcase_11 | AC | 59 ms
11,392 KB |
testcase_12 | WA | - |
testcase_13 | AC | 322 ms
16,512 KB |
testcase_14 | AC | 311 ms
16,512 KB |
testcase_15 | WA | - |
testcase_16 | AC | 604 ms
22,784 KB |
testcase_17 | AC | 596 ms
22,656 KB |
testcase_18 | AC | 901 ms
28,928 KB |
testcase_19 | AC | 874 ms
29,056 KB |
testcase_20 | WA | - |
testcase_21 | AC | 893 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 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': 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]))