#472224 (Python3) No.1004 サイコロの実装 (2)

• 問題: No.1004 サイコロの実装 (2)
• ユーザー: Coki628
• 提出日時: 2020-04-28 23:52:46
• 言語: Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0)
• 結果: AC
• 実行時間: 30 ms / 2,000 ms
• コード長: 1,533 bytes
• コンパイル時間: 85 ms
• コンパイル使用メモリ: 12,672 KB
• 実行使用メモリ: 10,880 KB
• 最終ジャッジ日時: 2024-11-26 01:42:17
• 合計ジャッジ時間: 2,091 ms
• ジャッジサーバーID （参考情報）: judge3 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	28 ms; 10,752 KB
testcase_01	AC	28 ms; 10,624 KB
testcase_02	AC	26 ms; 10,624 KB
testcase_03	AC	26 ms; 10,752 KB
testcase_04	AC	30 ms; 10,752 KB
testcase_05	AC	25 ms; 10,880 KB
testcase_06	AC	25 ms; 10,624 KB
testcase_07	AC	25 ms; 10,624 KB
testcase_08	AC	25 ms; 10,624 KB
testcase_09	AC	25 ms; 10,624 KB
testcase_10	AC	25 ms; 10,880 KB
testcase_11	AC	25 ms; 10,624 KB
testcase_12	AC	25 ms; 10,752 KB
testcase_13	AC	26 ms; 10,624 KB
testcase_14	AC	26 ms; 10,624 KB
testcase_15	AC	26 ms; 10,880 KB
testcase_16	AC	26 ms; 10,624 KB
testcase_17	AC	26 ms; 10,752 KB
testcase_18	AC	26 ms; 10,752 KB
testcase_19	AC	26 ms; 10,624 KB
testcase_20	AC	28 ms; 10,624 KB
testcase_21	AC	28 ms; 10,624 KB
testcase_22	AC	27 ms; 10,752 KB
testcase_23	AC	25 ms; 10,752 KB
testcase_24	AC	26 ms; 10,752 KB
testcase_25	AC	26 ms; 10,752 KB
testcase_26	AC	26 ms; 10,752 KB
testcase_27	AC	27 ms; 10,624 KB
testcase_28	AC	25 ms; 10,624 KB
testcase_29	AC	25 ms; 10,752 KB
testcase_30	AC	26 ms; 10,752 KB
testcase_31	AC	25 ms; 10,752 KB
testcase_32	AC	26 ms; 10,752 KB
testcase_33	AC	26 ms; 10,752 KB
testcase_34	AC	26 ms; 10,752 KB
testcase_35	AC	26 ms; 10,624 KB
testcase_36	AC	26 ms; 10,752 KB
testcase_37	AC	26 ms; 10,624 KB
testcase_38	AC	26 ms; 10,752 KB
testcase_39	AC	26 ms; 10,752 KB

ソースコード

# -*- coding: utf-8 -*-

import sys

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 18
MOD = 10 ** 9 + 7
EPS = 10 ** -10

a, b, x, N = MAP()

# mod = 2**32
# def test(x):
#     acnt = bcnt = 0
#     abl = awh = bbl = bwh = 0
#     for i in range(N*2):
#         x = (a*x + b) % mod
#         if i % 2 == 0:
#             acnt += x % 6 + 1
#             if acnt % 2 == 1:
#                 abl += 1
#             else:
#                 awh += 1
#         else:
#             bcnt += x % 6 + 1
#             if bcnt % 2 == 1:
#                 bbl += 1
#             else:
#                 bwh += 1
#     aans = min(abl, awh)
#     bans = min(bbl, bwh)
#     return aans, bans
# print(*test(x))

a %= 2
b %= 2
x %= 2
if a == 1 and b == 1 and x == 0:
    ans1 = 0
    ans2 = N // 2
elif a == 1 and b == 1 and x == 1:
    ans1 = N // 2
    ans2 = 0
elif a == 1 and b == 0 and x == 0:
    ans1 = N // 2
    ans2 = N // 2
else:
    ans1 = ans2 = 0
print(ans1, ans2)