結果

問題 No.769 UNOシミュレータ
ユーザー tonnnura172tonnnura172
提出日時 2020-04-10 13:13:44
言語 Python3
(3.12.2 + numpy 1.26.4 + scipy 1.12.0)
結果
RE  
(最新)
AC  
(最初)
実行時間 -
コード長 2,952 bytes
コンパイル時間 252 ms
コンパイル使用メモリ 13,056 KB
実行使用メモリ 11,776 KB
最終ジャッジ日時 2024-05-02 00:47:23
合計ジャッジ時間 2,452 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 RE -
testcase_01 RE -
testcase_02 RE -
testcase_03 RE -
testcase_04 RE -
testcase_05 RE -
testcase_06 RE -
testcase_07 RE -
testcase_08 RE -
testcase_09 RE -
testcase_10 RE -
testcase_11 RE -
testcase_12 RE -
testcase_13 RE -
testcase_14 RE -
testcase_15 RE -
testcase_16 RE -
testcase_17 RE -
testcase_18 RE -
testcase_19 RE -
testcase_20 RE -
testcase_21 RE -
testcase_22 RE -
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul, add
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

N, M = MAP()
lis = [input() for _ in range(M)]

players = list(range(1, N+1))
now = 0
reverse = 0
skipped = False
draw_two_count = 0
draw_four_count = 0
all_cards = defaultdict(int)
extra_cards = defaultdict(int)

for i, l in enumerate(lis):
	if l == "number":
		if draw_two_count:
			extra_cards[players[now]] += 2*draw_two_count
			if reverse:
				now = (now-1-1*skipped)%N
			else:
				now = (now+1+1*skipped)%N
			draw_two_count = 0
		elif draw_four_count:
			extra_cards[players[now]] += 4*draw_four_count
			if reverse:
				now = (now-1-1*skipped)%N
			else:
				now = (now+1+1*skipped)%N
			draw_four_count = 0

		all_cards[players[now]] += 1
	elif l == "drawtwo":
		if draw_four_count:
			extra_cards[players[now]] += 4*draw_four_count
			if reverse:
				now = (now-1-1*skipped)%N
			else:
				now = (now+1+1*skipped)%N
			draw_four_count = 0
		all_cards[players[now]] += 1
		draw_two_count += 1
	elif l == "drawfour":
		if draw_two_count:
			extra_cards[players[now]] += 2*draw_two_count
			if reverse:
				now = (now-1-1*skipped)%N
			else:
				now = (now+1+1*skipped)%N
			draw_two_count = 0
		all_cards[players[now]] += 1
		draw_four_count += 1
	elif l == "skip":
		if draw_two_count:
			extra_cards[players[now]] += 2*draw_two_count
			if reverse:
				now = (now-1-1*skipped)%N
			else:
				now = (now+1+1*skipped)%N
			draw_two_count = 0
		elif draw_four_count:
			extra_cards[players[now]] += 4*draw_four_count
			if reverse:
				now = (now-1-1*skipped)%N
			else:
				now = (now+1+1*skipped)%N
			draw_four_count = 0
		all_cards[players[now]] += 1
		skipped = True
	elif l == "reverse":
		if draw_two_count:
			extra_cards[players[now]] += 2*draw_two_count
			if reverse:
				now = (now-1-1*skipped)%N
			else:
				now = (now+1+1*skipped)%N
			draw_two_count = 0
		elif draw_four_count:
			extra_cards[players[now]] += 4*draw_four_count
			if reverse:
				now = (now-1-1*skipped)%N
			else:
				now = (now+1+1*skipped)%N
			draw_four_count = 0
		all_cards[players[now]] += 1
		reverse ^= 1
	if i == M-1:
		break
	if reverse:
		now = (now-1-1*skipped)%N
	else:
		now = (now+1+1*skipped)%N
	skipped = False

print(players[now], all_cards[players[now]]-extra_cards[players[now]])
0