結果
問題 | No.2428 Returning Shuffle |
ユーザー |
![]() |
提出日時 | 2024-02-25 09:25:30 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 267 ms / 2,000 ms |
コード長 | 4,867 bytes |
コンパイル時間 | 1,486 ms |
コンパイル使用メモリ | 142,164 KB |
最終ジャッジ日時 | 2025-02-19 21:15:14 |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 23 |
ソースコード
#include <iostream>#include <vector>#include <algorithm>#include <array>#include <iterator>#include <string>#include <cctype>#include <cstring>#include <cstdlib>#include <cassert>#include <cmath>#include <ctime>#include <iomanip>#include <numeric>#include <stack>#include <queue>#include <map>#include <unordered_map>#include <set>#include <unordered_set>#include <bitset>#include <random>#include <utility>#include <functional>using namespace std;template<int m> struct modint{private:unsigned int value;static constexpr int mod() {return m;}public:constexpr modint(const long long x = 0) noexcept{long long y = x;if(y < 0 || y >= mod()){y %= mod();if(y < 0) y += mod();}value = (unsigned int)y;}static constexpr int get_mod() noexcept {return m;}static constexpr int primitive_root() noexcept{assert(m == 998244353);return 3;}constexpr unsigned int val() noexcept {return value;}constexpr modint &operator+=(const modint &other) noexcept{value += other.value;if(value >= mod()) value -= mod();return *this;}constexpr modint &operator-=(const modint &other) noexcept{unsigned int x = value;if(x < other.value) x += mod();x -= other.value;value = x;return *this;}constexpr modint &operator*=(const modint &other) noexcept{unsigned long long x = value;x *= other.value;value = (unsigned int) (x % mod());return *this;}constexpr modint &operator/=(const modint &other) noexcept{return *this *= other.inverse();}constexpr modint inverse() const noexcept{assert(value);long long a = value,b = mod(),x = 1,y = 0;while(b){long long q = a/b;a -= q*b; swap(a,b);x -= q*y; swap(x,y);}return modint(x);}constexpr modint power(long long N) const noexcept{assert(N >= 0);modint p = *this,ret = 1;while(N){if(N & 1) ret *= p;p *= p;N >>= 1;}return ret;}constexpr modint operator+() {return *this;}constexpr modint operator-() {return modint() - *this;}constexpr modint &operator++(int) noexcept {return *this += 1;}constexpr modint &operator--(int) noexcept {return *this -= 1;}friend modint operator+(const modint& lhs, const modint& rhs) {return modint(lhs) += rhs;}friend modint operator-(const modint& lhs, const modint& rhs) {return modint(lhs) -= rhs;}friend modint operator*(const modint& lhs, const modint& rhs) {return modint(lhs) *= rhs;}friend modint operator/(const modint& lhs, const modint& rhs) {return modint(lhs) /= rhs;}friend ostream &operator<<(ostream &os,const modint &x) {return os << x.value;}};using mint = modint<998244353>;/* using mint = modint<1000000007>; */#include<algorithm>#include<vector>#include<cassert>using namespace std;struct UnionFind{private:int n;vector<int> par,siz;public:UnionFind(int n) :n(n),par(n,-1),siz(n,1) {}int root(int u){assert(0 <= u && u < n);return (par[u] < 0 ? u:par[u] = root(par[u]));}bool same(int u,int v){assert(0 <= u && u < n && 0 <= v && v < n);return root(u) == root(v);}bool unite(int u,int v){assert(0 <= u && u < n && 0 <= v && v < n);u = root(u),v = root(v);if(u == v) return false;if(siz[u] < siz[v]) swap(u,v);siz[u] += siz[v];par[v] = u;return true;}int size(int u){assert(0 <= u && u < n);return siz[root(u)];}vector<vector<int>> components(){vector<vector<int>> ret(n);for(int u = 0;u < n;u++) ret[root(u)].push_back(u);ret.erase(remove_if(ret.begin(),ret.end(),[](vector<int> v) { return v.empty();}),ret.end());return ret;}};vector<pair<long long,int>> PrimeFactorize(long long N){vector<pair<long long,int>> res;for(long long p = 2;p * p <= N;p++){if(N % p != 0){continue;}res.push_back(make_pair(p,0));while(N % p == 0){N /= p;res.back().second++;}}if(N > 1){res.push_back(make_pair(N,1));}return res;}void Main(){int N,M;cin >> N >> M;vector<int> P(N);iota(P.begin(),P.end(),0);for(;M--;){int T;cin >> T;vector<int> S(T);for(int i = 0;i < T;i++){cin >> S[i];S[i]--;}vector<int> tmp;for(int s : S){tmp.push_back(P[s]);}rotate(tmp.begin(),tmp.begin() + (int)tmp.size() - 1,tmp.end());for(int i = 0;i < T;i++){P[S[i]] = tmp[i];}}UnionFind uf(N);for(int i = 0;i < N;i++){uf.unite(i,P[i]);}map<int,int> L;for(int i = 0;i < N;i++){if(i == uf.root(i)){int sz = uf.size(i);auto pf = PrimeFactorize(sz);for(const auto &[p,e] : pf){L[p] = max(L[p],e);}}}mint ans = 1;for(const auto &[p,e] : L){ans *= mint(p).power(e);}cout << ans << "\n";}int main(){ios::sync_with_stdio(false);cin.tie(nullptr);int tt = 1;/* cin >> tt; */while(tt--) Main();}