#926121 (Python3) No.2529 Treasure Hunter

• 問題: No.2529 Treasure Hunter
• ユーザー: 👑 KA37RI
• 提出日時: 2023-11-03 23:43:03
• 言語: Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0)
• 結果: WA
• 実行時間: -
• コード長: 710 bytes
• コンパイル時間: 174 ms
• コンパイル使用メモリ: 12,672 KB
• 実行使用メモリ: 10,880 KB
• 最終ジャッジ日時: 2024-09-25 21:35:49
• 合計ジャッジ時間: 12,119 ms
• ジャッジサーバーID （参考情報）: judge3 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	54 ms; 10,624 KB
testcase_01	WA	-
testcase_02	AC	456 ms; 10,624 KB
testcase_03	AC	473 ms; 10,624 KB
testcase_04	AC	479 ms; 10,752 KB
testcase_05	AC	483 ms; 10,752 KB
testcase_06	AC	483 ms; 10,624 KB
testcase_07	AC	473 ms; 10,624 KB
testcase_08	WA	-
testcase_09	AC	428 ms; 10,624 KB
testcase_10	AC	475 ms; 10,624 KB
testcase_11	AC	480 ms; 10,624 KB
testcase_12	AC	507 ms; 10,752 KB
testcase_13	AC	526 ms; 10,624 KB
testcase_14	AC	531 ms; 10,752 KB
testcase_15	AC	523 ms; 10,752 KB
testcase_16	AC	539 ms; 10,624 KB
testcase_17	AC	519 ms; 10,752 KB
testcase_18	AC	534 ms; 10,624 KB
testcase_19	AC	542 ms; 10,624 KB
testcase_20	AC	546 ms; 10,752 KB
testcase_21	AC	548 ms; 10,624 KB
testcase_22	AC	554 ms; 10,624 KB

ソースコード

mod = 998244353

t = int(input())
for _ in range(t):
	n, m = [int(x) for x in input().split()]
	can_place_0 = 1
	can_place_1 = n
	can_place_2 = n * (n - 1) // 2 - n
	can_place_2 %= mod
	
	for _ in range(m - 1):
		next_cp0 = can_place_0 + can_place_1 + can_place_2
		next_cp1 = n * can_place_0
		next_cp1 += (n - 1) * can_place_1 
		next_cp1 += (n - 2) * can_place_2
		next_cp2 = (n * (n - 1) // 2 - n) * can_place_0
		next_cp2 += ((n - 1) * (n - 2) // 2 - (n - 2)) * can_place_1
		if n >= 4:
			next_cp2 += ((n - 2) * (n - 3) // 2 - (n - 4)) * can_place_2
		
		can_place_0 = next_cp0 % mod
		can_place_1 = next_cp1 % mod
		can_place_2 = next_cp2 % mod
		
	print((can_place_0 + can_place_1 + can_place_2) % mod)