結果

問題 No.2428 Returning Shuffle
ユーザー siganaisiganai
提出日時 2023-08-18 21:29:25
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 360 ms / 2,000 ms
コード長 9,406 bytes
コンパイル時間 2,842 ms
コンパイル使用メモリ 220,904 KB
最終ジャッジ日時 2025-02-16 09:38:02
ジャッジサーバーID
(参考情報)
judge4 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 23
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#line 1 "main.cpp"
//#pragma GCC target("avx,avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...) (static_cast<void>(0))
#endif
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using pii = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vpii = vector<pii>;
using vpll = vector<pll>;
using vs = vector<string>;
template<class T> using pq = priority_queue<T, vector<T>, greater<T>>;
#define overload4(_1, _2, _3, _4, name, ...) name
#define overload3(a,b,c,name,...) name
#define rep1(n) for (ll UNUSED_NUMBER = 0; UNUSED_NUMBER < (n); ++UNUSED_NUMBER)
#define rep2(i, n) for (ll i = 0; i < (n); ++i)
#define rep3(i, a, b) for (ll i = (a); i < (b); ++i)
#define rep4(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep1(n) for(ll i = (n) - 1;i >= 0;i--)
#define rrep2(i,n) for(ll i = (n) - 1;i >= 0;i--)
#define rrep3(i,a,b) for(ll i = (b) - 1;i >= (a);i--)
#define rrep4(i,a,b,c) for(ll i = (a) + ((b)-(a)-1) / (c) * (c);i >= (a);i -= c)
#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)
#define all1(i) begin(i) , end(i)
#define all2(i,a) begin(i) , begin(i) + a
#define all3(i,a,b) begin(i) + a , begin(i) + b
#define all(...) overload3(__VA_ARGS__, all3, all2, all1)(__VA_ARGS__)
#define sum(...) accumulate(all(__VA_ARGS__),0LL)
template<class T> bool chmin(T &a, const T &b){ if(a > b){ a = b; return 1; } else return 0; }
template<class T> bool chmax(T &a, const T &b){ if(a < b){ a = b; return 1; } else return 0; }
template<class T> auto min(const T& a){return *min_element(all(a));}
template<class T> auto max(const T& a){return *max_element(all(a));}
template<class... Ts> void in(Ts&... t);
#define INT(...) int __VA_ARGS__; in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__; in(__VA_ARGS__)
#define STR(...) string __VA_ARGS__; in(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__; in(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__; in(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__; in(__VA_ARGS__)
#define VEC(type, name, size) vector<type> name(size); in(name)
#define VV(type, name, h, w) vector<vector<type>> name(h, vector<type>(w)); in(name)
ll intpow(ll a, ll b){ ll ans = 1; while(b){if(b & 1) ans *= a; a *= a; b /= 2;} return ans;}
ll modpow(ll a, ll b, ll p){ ll ans = 1; a %= p;if(a < 0) a += p;while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
ll GCD(ll a,ll b) { if(a == 0 || b == 0) return 0; if(a % b == 0) return b; else return GCD(b,a%b);}
ll LCM(ll a,ll b) { if(a == 0) return b; if(b == 0) return a;return a / GCD(a,b) * b;}
namespace IO{
#define VOID(a) decltype(void(a))
struct setting{ setting(){cin.tie(nullptr); ios::sync_with_stdio(false);fixed(cout); cout.precision(12);}} setting;
template<int I> struct P : P<I-1>{};
template<> struct P<0>{};
template<class T> void i(T& t){ i(t, P<3>{}); }
void i(vector<bool>::reference t, P<3>){ int a; i(a); t = a; }
template<class T> auto i(T& t, P<2>) -> VOID(cin >> t){ cin >> t; }
template<class T> auto i(T& t, P<1>) -> VOID(begin(t)){ for(auto&& x : t) i(x); }
template<class T, size_t... idx> void ituple(T& t, index_sequence<idx...>){in(get<idx>(t)...);}
template<class T> auto i(T& t, P<0>) -> VOID(tuple_size<T>{}){ituple(t, make_index_sequence<tuple_size<T>::value>{});}
#undef VOID
}
#define unpack(a) (void)initializer_list<int>{(a, 0)...}
template<class... Ts> void in(Ts&... t){ unpack(IO :: i(t)); }
#undef unpack
static const double PI = 3.1415926535897932;
template <class F> struct REC {
F f;
REC(F &&f_) : f(forward<F>(f_)) {}
template <class... Args> auto operator()(Args &&...args) const { return f(*this, forward<Args>(args)...); }};
//constexpr int mod = 1000000007;
constexpr int mod = 998244353;
#line 2 "library/modint/Modint.hpp"
template <int mod>
struct Modint{
int x;
Modint():x(0) {}
Modint(long long y): x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
Modint &operator += (const Modint &p) {
if((x += p.x) >= mod) x -= mod;
return *this;}
Modint &operator -= (const Modint &p) {
if ((x += mod - p.x) >= mod) x -= mod;
return *this;}
Modint &operator *= (const Modint &p) {
x = (int)(1LL * x * p.x % mod);
return *this;}
Modint &operator /= (const Modint &p) {
*this *= p.inverse();
return *this;}
Modint operator -() const{return Modint(-x);}
Modint operator +(const Modint &p) const {return Modint(*this) += p;}
Modint operator -(const Modint &p) const {return Modint(*this) -= p;}
Modint operator *(const Modint &p) const {return Modint(*this) *= p;}
Modint operator /(const Modint &p) const {return Modint(*this) /= p;}
Modint &operator ++() {if(x == mod - 1) x = 0; else x++; return *this;}
Modint &operator --() {if(x == 0) x = mod - 1; else x--; return *this;}
bool operator == (const Modint &p) const {return x == p.x;}
bool operator != (const Modint &p) const {return x != p.x;}
Modint inverse() const {
int a = x, b = mod, u = 1, v = 0, t;
while (b > 0) {
t = a / b;
swap(a -= t * b, b);
swap(u -= t * v, v);
}
return Modint(u);}
Modint pow(long long n) const {
Modint ret(1), mul(x);
while (n > 0) {
if (n & 1) ret *= mul;
mul *= mul;
n >>= 1;
}
return ret;}
friend ostream &operator<<(ostream &os, const Modint &p) { return os << p.x; }
friend istream &operator>>(istream &is, Modint &a) {
long long t;
is >> t;
a = Modint<mod>(t);
return (is);
}
int get() const { return x; }
static constexpr int get_mod() {return mod;}
};
#line 85 "main.cpp"
using mint = Modint<mod>;
using vm = vector<mint>;
using vvm = vector<vm>;
using vvvm = vector<vvm>;
#line 1 "library/data-structure/unionfind.hpp"
struct unionfind {
public:
unionfind() : _n(0) {}
explicit unionfind(int n) : _n(n), parent_or_size(n, -1) {}
int merge(int a, int b) {
assert(0 <= a && a < _n);
assert(0 <= b && b < _n);
int x = find(a), y = find(b);
if (x == y) return x;
if (-parent_or_size[x] < -parent_or_size[y]) swap(x, y);
parent_or_size[x] += parent_or_size[y];
parent_or_size[y] = x;
return x;
}
bool same(int a, int b) {
assert(0 <= a && a < _n);
assert(0 <= b && b < _n);
return find(a) == find(b);
}
int find(int a) {
assert(0 <= a && a < _n);
if (parent_or_size[a] < 0) return a;
return parent_or_size[a] = find(parent_or_size[a]);
}
int size(int a) {
assert(0 <= a && a < _n);
return -parent_or_size[find(a)];
}
vector<vector<int>> groups() {
vector<int> leader_buf(_n), group_size(_n);
for (int i = 0; i < _n; i++) {
leader_buf[i] = find(i);
group_size[leader_buf[i]]++;
}
vector<vector<int>> result(_n);
for (int i = 0; i < _n; i++) {
result[i].reserve(group_size[i]);
}
for (int i = 0; i < _n; i++) {
result[leader_buf[i]].push_back(i);
}
result.erase(
remove_if(result.begin(), result.end(),
[&](const vector<int>& v) { return v.empty(); }),
result.end());
return result;
}
private:
int _n;
// root node: -1 * component size
// otherwise: parent
vector<int> parent_or_size;
};
#line 2 "library/math/factorize.hpp"
vector<pair<long long,int>> prime_factorization(long long n) {
vector<pair<long long,int>> ret;
int c = 0;
while(n % 2 == 0) {
c++;
n >>= 1;
}
if(c) ret.emplace_back(2,c);
for(long long i = 3; i * i <= n; i += 2) {
c = 0;
while(n % i == 0) {
n /= i;
c++;
}
if(c) ret.emplace_back(i,c);
}
if (n != 1) ret.emplace_back(n,1);
return ret;
}
vector<long long> divisor(long long n) {
vector<long long> ret;
for(long long i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if(i * i != n) {ret.push_back(n / i);}
}
}
sort(ret.begin(),ret.end());
return ret;
}
#line 91 "main.cpp"
int main() {
INT(n,m);
vi t(m);
vvi s(m);
rep(i,m) {
cin >> t[i];
rep(j,t[i]) {
INT(x);
x--;
s[i].emplace_back(x);
}
}
vi P(n);
iota(all(P),0);
debug(t,s);
rep(i,m) {
int tmp = P[s[i][t[i]-1]];
rrep(j,t[i]-1) {
P[s[i][j+1]] = P[s[i][j]];
}
P[s[i][0]] = tmp;
debug(P);
}
unionfind uf(n);
rep(i,n) uf.merge(i,P[i]);
mint ans = 1;
auto gs = uf.groups();
map<int,int> mp;
rep(i,gs.size()) {
auto ret = prime_factorization((int)gs[i].size());
for(auto &[p,c]:ret) chmax(mp[p],c);
}
for(auto &[p,c]:mp) ans *= mint(p).pow(c);
cout << ans << '\n';
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0