結果
問題 | No.2727 Tetrahedron Game |
ユーザー | MasKoaTS |
提出日時 | 2023-09-28 17:25:52 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,942 bytes |
コンパイル時間 | 143 ms |
コンパイル使用メモリ | 82,092 KB |
実行使用メモリ | 80,704 KB |
最終ジャッジ日時 | 2024-09-17 20:53:08 |
合計ジャッジ時間 | 3,921 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge6 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | AC | 473 ms
80,704 KB |
testcase_02 | AC | 370 ms
78,320 KB |
testcase_03 | AC | 264 ms
77,088 KB |
testcase_04 | AC | 255 ms
76,524 KB |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
ソースコード
# WA? import sys input = sys.stdin.readline MOD = 101 INV2, INV3 = pow(2, MOD - 2, MOD), pow(3, MOD - 2, MOD) def det(A): ret = 0 B = A[:] + [A[0]] + [A[1]] for i in range(3): ret += B[i][0] * B[i+1][1] * B[i+2][2] ret -= B[i][2] * B[i+1][1] * B[i+2][0] return ret def solve(N, K, P, a, s): d = abs(det(P)) div2, div3 = (d % 2 == 0), (d % 3 == 0) dp = [[-1] * 4 for _ in [0] * MOD] for j in range(MOD): for k in range(3): if(div2 and not(k & 1)): continue if(div3 and not((k >> 1) & 1)): continue dp[j][k] = 2 dp[j][3] = int(j >= K) for i in range(N - 1, -1, -1): ndp = [[-1] * 4 for _ in [0] * MOD] player_is_koa = (s[i] == 'K') val = a[i] + 1 val_div2, val_div3 = (val % 2 == 0), (val % 3 == 0) for j in range(MOD): for k in range(4): hands = [dp[j * val % MOD][k | val_div2 | (val_div3 << 1)], dp[j][k]] if(player_is_koa): if(1 in hands): ndp[j][k] = 1 elif(2 in hands): ndp[j][k] = 2 elif(0 in hands): ndp[j][k] = 0 else: if(0 in hands): ndp[j][k] = 0 elif(2 in hands): ndp[j][k] = 2 elif(1 in hands): ndp[j][k] = 1 dp = ndp[:] stat_init = dp[d % MOD * INV2 * INV3 % MOD][div2 | (div3 << 1)] if(stat_init == 1): return 'K' elif(stat_init == 0): return 'P' return 'D' t = int(input()) for _ in [0] * t: N, K = map(int, input().split()) P = [list(map(int, input().split())) for _ in [0] * 3] a = list(map(int, input().split())) s = input()[:-1] print(solve(N, K, P, a, s))