結果

問題 No.2428 Returning Shuffle
ユーザー t98slidert98slider
提出日時 2023-08-18 21:34:47
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 296 ms / 2,000 ms
コード長 6,608 bytes
コンパイル時間 1,882 ms
コンパイル使用メモリ 183,860 KB
実行使用メモリ 62,848 KB
最終ジャッジ日時 2024-11-28 05:58:59
合計ジャッジ時間 4,832 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 145 ms
50,048 KB
testcase_01 AC 296 ms
62,848 KB
testcase_02 AC 296 ms
62,720 KB
testcase_03 AC 5 ms
7,168 KB
testcase_04 AC 5 ms
7,168 KB
testcase_05 AC 5 ms
7,040 KB
testcase_06 AC 5 ms
7,168 KB
testcase_07 AC 4 ms
7,168 KB
testcase_08 AC 4 ms
7,168 KB
testcase_09 AC 4 ms
7,168 KB
testcase_10 AC 5 ms
7,168 KB
testcase_11 AC 4 ms
7,168 KB
testcase_12 AC 4 ms
7,168 KB
testcase_13 AC 5 ms
7,168 KB
testcase_14 AC 5 ms
7,168 KB
testcase_15 AC 5 ms
7,168 KB
testcase_16 AC 5 ms
7,168 KB
testcase_17 AC 4 ms
7,168 KB
testcase_18 AC 4 ms
7,040 KB
testcase_19 AC 207 ms
60,160 KB
testcase_20 AC 201 ms
60,288 KB
testcase_21 AC 5 ms
7,168 KB
testcase_22 AC 5 ms
7,168 KB
testcase_23 AC 4 ms
7,168 KB
testcase_24 AC 175 ms
49,956 KB
testcase_25 AC 175 ms
49,956 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

template<class T> istream& operator >> (istream& is, vector<T>& vec) {
    for(T& x : vec) is >> x;
    return is;
}

template<class T> ostream& operator << (ostream& os, const vector<T>& vec) {
    if(vec.empty()) return os;
    os << vec[0];
    for(auto it = vec.begin(); ++it != vec.end(); ) os << ' ' << *it;
    return os;
}

template<const unsigned int MOD> struct prime_modint {
    using mint = prime_modint;
    unsigned int v;
    prime_modint() : v(0) {}
    prime_modint(unsigned int a) { a %= MOD; v = a; }
    prime_modint(unsigned long long a) { a %= MOD; v = a; }
    prime_modint(int a) { a %= (int)(MOD); if(a < 0)a += MOD; v = a; }
    prime_modint(long long a) { a %= (int)(MOD); if(a < 0)a += MOD; v = a; }
    static constexpr int mod() { return MOD; }
    mint& operator++() {v++; if(v == MOD)v = 0; return *this;}
    mint& operator--() {if(v == 0)v = MOD; v--; return *this;}
    mint operator++(int) { mint result = *this; ++*this; return result; }
    mint operator--(int) { mint result = *this; --*this; return result; }
    mint& operator+=(const mint& rhs) { v += rhs.v; if(v >= MOD) v -= MOD; return *this; }
    mint& operator-=(const mint& rhs) { if(v < rhs.v) v += MOD; v -= rhs.v; return *this; }
    mint& operator*=(const mint& rhs) {
        v = (unsigned int)((unsigned long long)(v) * rhs.v % MOD);
        return *this;
    }
    mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }
    mint operator+() const { return *this; }
    mint operator-() const { return mint() - *this; }
    mint pow(long long n) const {
        assert(0 <= n);
        mint r = 1, x = *this;
        while (n) {
            if (n & 1) r *= x;
            x *= x;
            n >>= 1;
        }
        return r;
    }
    mint inv() const { assert(v); return pow(MOD - 2); }
    friend mint operator+(const mint& lhs, const mint& rhs) { return mint(lhs) += rhs; }
    friend mint operator-(const mint& lhs, const mint& rhs) { return mint(lhs) -= rhs; }
    friend mint operator*(const mint& lhs, const mint& rhs) { return mint(lhs) *= rhs; }
    friend mint operator/(const mint& lhs, const mint& rhs) { return mint(lhs) /= rhs; }
    friend bool operator==(const mint& lhs, const mint& rhs) { return (lhs.v == rhs.v); }
    friend bool operator!=(const mint& lhs, const mint& rhs) { return (lhs.v != rhs.v); }
    friend std::ostream& operator << (std::ostream &os, const mint& rhs) noexcept { return os << rhs.v; }
};
//using mint = prime_modint<1000000007>;
using mint = prime_modint<998244353>;

struct dsu {
    public:
    int csz;
    dsu() : _n(0) {}
    dsu(int n) : _n(n), csz(n), parent_or_size(n, -1) {}

    int merge(int a, int b) {
        assert(0 <= a && a < _n);
        assert(0 <= b && b < _n);
        int x = leader(a), y = leader(b);
        if (x == y) return x;
        if (-parent_or_size[x] < -parent_or_size[y]) std::swap(x, y);
        csz--;
        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 leader(a) == leader(b);
    }

    int leader(int a) {
        assert(0 <= a && a < _n);
        if (parent_or_size[a] < 0) return a;
        return parent_or_size[a] = leader(parent_or_size[a]);
    }

    int size(int a) {
        assert(0 <= a && a < _n);
        return -parent_or_size[leader(a)];
    }

    std::vector<std::vector<int>> groups() {
        std::vector<int> leader_buf(_n), group_size(_n);
        for (int i = 0; i < _n; i++) {
            leader_buf[i] = leader(i);
            group_size[leader_buf[i]]++;
        }
        std::vector<std::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(
            std::remove_if(result.begin(), result.end(),
                           [&](const std::vector<int>& v) { return v.empty(); }),
            result.end());
        return result;
    }

    private:
    int _n;
    // root node: -1 * component size
    // otherwise: parent
    std::vector<int> parent_or_size;
};

//osa_k法に基づく素因数分解
struct osa_k{
    int n;
    vector<int> osak_calc;
    osa_k(int n = 1000001) {
        osak_calc.resize(n, -1);
        int d;
        for(int i = 2; i < n; i += 2) osak_calc[i] = 2;
        for(int i = 3; i < n; i += 2){
            if(osak_calc[i] != -1)continue;
            d = i << 1;
            for(int j = i; j < n; j += d){
                if(osak_calc[j] != -1)continue;
                osak_calc[j] = i;
            }
        }
    }
    bool is_Prime(int x){
        return (osak_calc[x] == x);
    }
    vector<pair<int, int>> prime_factor(int x){
        vector<pair<int, int>> ret;
        if(x <= 1)return ret;
        ret.emplace_back(osak_calc[x], 1);
        x /= osak_calc[x];
        while(osak_calc[x] != -1){
            if(osak_calc[x] == ret.back().first){
                ret.back().second++;
            }else{
                ret.emplace_back(osak_calc[x], 1);
            }
            x /= osak_calc[x];
        }
        return ret;
    }
    //最小公倍数の数列を返す
    vector<int> array_lcm(vector<int> a){
        vector<int> tb(1000000);
        for(int i = 0; i < (int)a.size(); i++){
            vector<pair<int,int>> b = prime_factor(a[i]);
            for(int j = 0; j < (int)b.size(); j++){
                tb[b[j].first] = max(tb[b[j].first], b[j].second);
            }
        }
        return tb;
    }
};

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, m;
    cin >> n >> m;
    vector<int> p(n);
    iota(p.begin(), p.end(), 0);
    for(int i = 0; i < m; i++){
        int c;
        cin >> c;
        vector<int> b(c), d(c);
        cin >> b;
        for(auto &&v : b) v--;
        for(int i = 0; i < c; i++){
            d[i] = p[b[i]];
        }
        for(int i = 0; i < c; i++){
            p[b[(i + 1) % c]] = d[i];
        }
    }
    //cerr << p << '\n';
    dsu uf(n);
    for(int i = 0; i < n; i++){
        uf.merge(i, p[i]);
    }
    osa_k osa(n + 5);
    vector<int> a;
    for(auto &&G : uf.groups()) a.emplace_back(G.size());
    //cerr << a << '\n';
    auto tb = osa.array_lcm(a);
    mint ans = 1;
    for(int i = 2; i < tb.size(); i++){
        if(tb[i] == 0) continue;
        ans *= mint(i).pow(tb[i]);
    }
    cout << ans << '\n';
}
0