結果
問題 | No.2428 Returning Shuffle |
ユーザー |
|
提出日時 | 2023-08-19 00:21:40 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 310 ms / 2,000 ms |
コード長 | 3,782 bytes |
コンパイル時間 | 5,721 ms |
コンパイル使用メモリ | 327,912 KB |
実行使用メモリ | 62,624 KB |
最終ジャッジ日時 | 2024-11-28 12:21:23 |
合計ジャッジ時間 | 8,687 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 23 |
ソースコード
#include "bits/stdc++.h"#include <unordered_map>#include <unordered_set>#include <stdio.h>#include <math.h>#include <cassert>#pragma warning(push)#pragma warning(disable:26498 26450 26451 26812)#include "atcoder/all"#pragma warning(pop)#include <float.h>//#include <boost/multiprecision/cpp_int.hpp>//using namespace boost::multiprecision;// std::fixed << std::setprecision(10) <<using namespace std;using namespace atcoder;using ll = long long;using ull = unsigned long long;using mint = modint998244353;using mint2 = modint1000000007;const double eps = 1e-9;#define REP(i, n) for (ll i = 0; i < ll(n); ++i)#define REPI(i, init, n) for (ll i = init; i < ll(n); ++i)#define REPD(i, init) for (ll i = init; i >=0; --i)#define REPDI(i, init, n) for (ll i = init; i >=n; --i)#define REPE(i, c) for (const auto& i : c)using vl = vector<ll>;#define VL(a, n) vector<ll> a; a.assign(n, 0);#define VLI(a, n) vector<ll> a; a.assign(n, 0); for(auto& x : a) cin >> x;#define VSI(a, n) vector<string> a; a.assign(n, ""); for(auto& x : a) cin >> x;using vvl = vector<vector<ll>>;#define VVLI(a, n, m, init) vector<vector<ll>> a(n); for(auto& x : a) x.assign(m, init);using pl = pair<ll, ll>;struct uv { ll u; ll v; ll c; };#define VUVI(a, n) vector<uv> a; a.assign(n, {0, 0, 1}); for(auto& x : a) {cin >> x.u >> x.v; x.u--; x.v--;}#define VUVCI(a, n) vector<uv> a; a.assign(n, {0, 0, 0}); for(auto& x : a) {cin >> x.u >> x.v >> x.c; x.u--; x.v--;}vvl to_edge(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) ret[x.u].push_back(x.v); return ret; }vvl to_edge_d(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) { ret[x.u].push_back(x.v); ret[x.v].push_back(x.u); } return ret; }template <class T = long long> using pql = priority_queue<T>;template <class T = long long> using pqg = priority_queue<T, vector<T>, greater<T>>;using vm = vector<mint>;using vvm = vector<vm>;const char* YES = "Yes";const char* NO = "No";void yn(bool f) { std::cout << (f ? YES : NO) << endl; };template<class T> void ov(const T& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << *it; } };template<> void ov(const vm& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << it->val(); } };const ll llhuge = 1LL << 60; //十分でかいが多少足しても溢れない数値template<class T, class U> bool chmin(T& a, const U& b) { a = min(a, b); return b == a; }template<class T, class U> bool chmax(T& a, const U& b) { a = max(a, b); return b == a; }template<class T> void mysort(T& v) { std::sort(begin(v), end(v)); };template<class T, class U> void mysort(T& v, U pr) { std::sort(begin(v), end(v), pr); };template<class T> void myrev(T& v) { std::reverse(begin(v), end(v)); };//素因数分解(O(√n))template <typename T>vector<pair<T, T>> prime_factor(T n) {vector<pair<T, T>> ret;for (T i = 2; i * i <= n; i++) {if (n % i != 0) continue;T tmp = 0;while (n % i == 0) {tmp++;n /= i;}ret.push_back(make_pair(i, tmp));}if (n != 1) ret.push_back(make_pair(n, 1));return ret;}int main() {cin.tie(nullptr);ios::sync_with_stdio(false);ll n, m;cin >> n >> m;vl a(n);REP(i, n) a[i] = i;REP(i, m) {ll t;cin >> t;VLI(s, t);REP(j, t) s[j]--;ll lv = a[s[t - 1]];REPD(j, t-2) {a[s[(j + 1) % t]] = a[s[j]];}a[s[0]] = lv;}dsu uf(n);REP(i, n) {uf.merge(i, a[i]);}map<ll, ll> mp;REPE(g, uf.groups()) {if (g.size() == 1) continue;auto m = prime_factor(g.size());REPE(e, m) {chmax(mp[e.first], ll(e.second));}}mint ans = 1;REPE(e, mp) {ans *= mint(e.first).pow(e.second);}cout << ans.val() << endl;return 0;}