OI-wiki 算法基础 模拟
https://oi-wiki.org/basic/simulate/
习题答案
NOIP2014 生活大爆炸版石头剪刀布 python
https://uoj.ac/problem/15
直接模拟N次
N, NA, NB = list(map(int, input().split()))
cycleA = list(map(int, input().split()))
cycleB = list(map(int, input().split()))
scoreA = 0
scoreB = 0
win_lose_table = [[0] * 5 for _ in range(5)]
temp = [[0, 2], [0, 3], [1, 3], [2, 4], [3, 4], [1, 0], [4, 0], [2, 1], [4, 1], [3, 2]]
for element in temp:
i = element[0]
j = element[1]
win_lose_table[i][j] = 1
# 如果数据范围比较小的话,可以直接循环N次
for i in range(N):
i1 = i % NA
i2 = i % NB
if win_lose_table[cycleA[i1]][cycleB[i2]] == 1:
scoreA += 1
if win_lose_table[cycleB[i2]][cycleA[i1]] == 1:
scoreB += 1
print(f"{scoreA} {scoreB}")
每 NA NB 次做一次记录
N, NA, NB = list(map(int, input().split()))
cycleA = list(map(int, input().split()))
cycleB = list(map(int, input().split()))
scoreA = 0
scoreB = 0
win_lose_table = [[0] * 5 for _ in range(5)]
temp = [[0, 2], [0, 3], [1, 3], [2, 4], [3, 4], [1, 0], [4, 0], [2, 1], [4, 1], [3, 2]]
for element in temp:
i = element[0]
j = element[1]
win_lose_table[i][j] = 1
# 如果数据范围比较大的话,可以先求出来一个循环内的分数 即 NA * NB 内的分数,然后看有几次循环
cycle = N // (NA * NB)
if cycle < 1:
for i in range(N):
i1 = i % NA
i2 = i % NB
if win_lose_table[cycleA[i1]][cycleB[i2]] == 1:
scoreA += 1
if win_lose_table[cycleB[i2]][cycleA[i1]] == 1:
scoreB += 1
else:
for i in range(NA * NB):
i1 = i % NA
i2 = i % NB
if win_lose_table[cycleA[i1]][cycleB[i2]] == 1:
scoreA += 1
if win_lose_table[cycleB[i2]][cycleA[i1]] == 1:
scoreB += 1
scoreA *= cycle
scoreB *= cycle
for i in range(N % (NA * NB)):
i1 = i % NA
i2 = i % NB
if win_lose_table[cycleA[i1]][cycleB[i2]] == 1:
scoreA += 1
if win_lose_table[cycleB[i2]][cycleA[i1]] == 1:
scoreB += 1
print(f"{scoreA} {scoreB}")