#926163 (Python3) No.2529 Treasure Hunter

• 問題: No.2529 Treasure Hunter
• ユーザー: 👑 KA37RI
• 提出日時: 2023-11-04 00:11:21
• 言語: Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0)
• 結果: AC
• 実行時間: 509 ms / 2,000 ms
• コード長: 724 bytes
• コンパイル時間: 676 ms
• コンパイル使用メモリ: 11,960 KB
• 実行使用メモリ: 10,156 KB
• 最終ジャッジ日時: 2023-11-04 00:11:35
• 合計ジャッジ時間: 11,971 ms
• ジャッジサーバーID （参考情報）: judge13 / judge11

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	49 ms; 10,140 KB
testcase_01	AC	436 ms; 10,156 KB
testcase_02	AC	407 ms; 10,140 KB
testcase_03	AC	449 ms; 10,140 KB
testcase_04	AC	429 ms; 10,140 KB
testcase_05	AC	434 ms; 10,140 KB
testcase_06	AC	458 ms; 10,140 KB
testcase_07	AC	441 ms; 10,140 KB
testcase_08	AC	438 ms; 10,140 KB
testcase_09	AC	389 ms; 10,140 KB
testcase_10	AC	440 ms; 10,140 KB
testcase_11	AC	439 ms; 10,140 KB
testcase_12	AC	489 ms; 10,140 KB
testcase_13	AC	460 ms; 10,140 KB
testcase_14	AC	459 ms; 10,140 KB
testcase_15	AC	474 ms; 10,140 KB
testcase_16	AC	509 ms; 10,140 KB
testcase_17	AC	465 ms; 10,140 KB
testcase_18	AC	458 ms; 10,140 KB
testcase_19	AC	472 ms; 10,140 KB
testcase_20	AC	488 ms; 10,140 KB
testcase_21	AC	475 ms; 10,140 KB
testcase_22	AC	485 ms; 10,140 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 = max(n * (n - 1) // 2 - n, 0)
	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 = max(n * (n - 1) // 2 - n, 0) * 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)