#904041 (C++17) No.2428 Returning Shuffle

• 問題: No.2428 Returning Shuffle
• ユーザー: Kirby0717
• 提出日時: 2023-08-15 03:03:51
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: WA
• 実行時間: -
• コード長: 1,196 bytes
• コンパイル時間: 2,204 ms
• コンパイル使用メモリ: 208,520 KB
• 実行使用メモリ: 26,828 KB
• 最終ジャッジ日時: 2024-11-23 19:57:46
• 合計ジャッジ時間: 6,498 ms
• ジャッジサーバーID （参考情報）: judge3 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	317 ms; 19,016 KB
testcase_01	AC	447 ms; 21,964 KB
testcase_02	AC	448 ms; 21,924 KB
testcase_03	AC	2 ms; 5,248 KB
testcase_04	AC	2 ms; 5,248 KB
testcase_05	AC	1 ms; 5,248 KB
testcase_06	AC	1 ms; 5,248 KB
testcase_07	AC	2 ms; 5,248 KB
testcase_08	AC	2 ms; 5,248 KB
testcase_09	AC	1 ms; 5,248 KB
testcase_10	AC	2 ms; 5,248 KB
testcase_11	AC	2 ms; 5,248 KB
testcase_12	AC	1 ms; 5,248 KB
testcase_13	AC	2 ms; 5,248 KB
testcase_14	AC	2 ms; 5,248 KB
testcase_15	AC	2 ms; 5,248 KB
testcase_16	AC	2 ms; 5,248 KB
testcase_17	WA	-
testcase_18	WA	-
testcase_19	AC	335 ms; 18,944 KB
testcase_20	AC	335 ms; 19,008 KB
testcase_21	AC	1 ms; 5,248 KB
testcase_22	AC	2 ms; 5,248 KB
testcase_23	AC	2 ms; 5,248 KB
testcase_24	AC	346 ms; 26,828 KB
testcase_25	AC	351 ms; 26,828 KB

ソースコード

#include <bits/stdc++.h>
using namespace std;
using ll  = long long;
template<class T>
using vec = vector<T>;
template<class T, size_t S>
using arr = array<T, S>;
int main(){
	vec<ll> A, S;
	ll N, M, T;
	vec<ll> L;
	cin >> N >> M;
	for (ll n = 0; n <= N; n++) A.emplace_back(n);
	for (ll m = 0; m < M; m++) {
		cin >> T;
		S.resize(T);
		for (ll t = 0; t < T; t++) cin >> S[t];
		S.emplace_back(0);
		for (ll t = T - 1; t >= 0; t--) A[S[t + 1]] = A[S[t]];
		A[S[0]] = A[0];
	}
	for (ll n = 1; n <= N; n++) if (A[n] != n) {
		ll now = n, d = 1, next;
		while (A[now] != n) {
			d++;
			next = A[now];
			A[now] = now;
			now = next;
		}
		A[now] = now;
		L.emplace_back(d);
	}
	vec<bool> P(1001, true);
	P[0] = P[1] = false;
	for (ll n = 2; n <= 1000; n++) if (P[n]) for (ll t = 2 * n; t <= 1000; t += n) P[t] = false;
	vec<ll> ans_fac(N + 1, 0);
	for (auto e : L) {
		ll rt = sqrt(e);
		for (ll p = 2; p <= rt; p++) if (P[p]) {
			ll c = 0;
			while (e % p == 0) c++, e /= p;
			ans_fac[p] = max(ans_fac[p], c);
		}
		ans_fac[e] = max(ans_fac[e], 1LL);
	}
	ll ans = 1;
	for (ll n = 1; n < N; n++) for (ll i = 0; i < ans_fac[n]; i++) ans = (ans * n) % 998244353;
	cout << ans << endl;
	return 0;
}