結果

問題 No.2584 The University of Tree
ユーザー heno239heno239
提出日時 2023-12-12 06:17:36
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 417 ms / 3,000 ms
コード長 8,798 bytes
コンパイル時間 2,515 ms
コンパイル使用メモリ 168,044 KB
実行使用メモリ 121,928 KB
最終ジャッジ日時 2023-12-12 06:17:52
合計ジャッジ時間 14,718 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 14 ms
25,148 KB
testcase_01 AC 14 ms
25,148 KB
testcase_02 AC 14 ms
25,148 KB
testcase_03 AC 14 ms
25,148 KB
testcase_04 AC 14 ms
25,148 KB
testcase_05 AC 14 ms
25,148 KB
testcase_06 AC 14 ms
25,148 KB
testcase_07 AC 14 ms
25,148 KB
testcase_08 AC 14 ms
25,148 KB
testcase_09 AC 14 ms
25,148 KB
testcase_10 AC 14 ms
25,148 KB
testcase_11 AC 14 ms
25,148 KB
testcase_12 AC 14 ms
25,148 KB
testcase_13 AC 14 ms
25,148 KB
testcase_14 AC 14 ms
25,148 KB
testcase_15 AC 14 ms
25,276 KB
testcase_16 AC 13 ms
25,148 KB
testcase_17 AC 14 ms
25,148 KB
testcase_18 AC 14 ms
25,148 KB
testcase_19 AC 14 ms
25,148 KB
testcase_20 AC 14 ms
25,148 KB
testcase_21 AC 14 ms
25,148 KB
testcase_22 AC 209 ms
73,276 KB
testcase_23 AC 176 ms
45,292 KB
testcase_24 AC 118 ms
34,492 KB
testcase_25 AC 126 ms
36,156 KB
testcase_26 AC 93 ms
37,592 KB
testcase_27 AC 172 ms
50,664 KB
testcase_28 AC 109 ms
43,836 KB
testcase_29 AC 60 ms
33,724 KB
testcase_30 AC 364 ms
68,012 KB
testcase_31 AC 417 ms
89,688 KB
testcase_32 AC 96 ms
46,396 KB
testcase_33 AC 269 ms
120,048 KB
testcase_34 AC 67 ms
32,804 KB
testcase_35 AC 402 ms
87,368 KB
testcase_36 AC 292 ms
57,808 KB
testcase_37 AC 314 ms
49,992 KB
testcase_38 AC 304 ms
49,992 KB
testcase_39 AC 358 ms
67,176 KB
testcase_40 AC 361 ms
89,724 KB
testcase_41 AC 369 ms
79,332 KB
testcase_42 AC 380 ms
81,224 KB
testcase_43 AC 368 ms
77,000 KB
testcase_44 AC 409 ms
101,576 KB
testcase_45 AC 410 ms
101,576 KB
testcase_46 AC 272 ms
121,928 KB
testcase_47 AC 278 ms
57,808 KB
testcase_48 AC 116 ms
34,876 KB
testcase_49 AC 289 ms
48,148 KB
testcase_50 AC 267 ms
44,224 KB
testcase_51 AC 134 ms
36,156 KB
testcase_52 AC 63 ms
30,140 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
#include<chrono>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
//ll mod = 1;
constexpr ll mod = 998244353;
//constexpr ll mod = 1000000007;
const int mod17 = 1000000007;
const ll INF = (ll)mod17 * mod17;
typedef pair<int, int>P;

#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;

using ld = double;
typedef pair<ld, ld> LDP;
const ld eps = 1e-10;
const ld pi = acosl(-1.0);

template<typename T>
void chmin(T& a, T b) {
    a = min(a, b);
}
template<typename T>
void chmax(T& a, T b) {
    a = max(a, b);
}
template<typename T>
vector<T> vmerge(vector<T>& a, vector<T>& b) {
    vector<T> res;
    int ida = 0, idb = 0;
    while (ida < a.size() || idb < b.size()) {
        if (idb == b.size()) {
            res.push_back(a[ida]); ida++;
        }
        else if (ida == a.size()) {
            res.push_back(b[idb]); idb++;
        }
        else {
            if (a[ida] < b[idb]) {
                res.push_back(a[ida]); ida++;
            }
            else {
                res.push_back(b[idb]); idb++;
            }
        }
    }
    return res;
}
template<typename T>
void cinarray(vector<T>& v) {
    rep(i, v.size())cin >> v[i];
}
template<typename T>
void coutarray(vector<T>& v) {
    rep(i, v.size()) {
        if (i > 0)cout << " "; cout << v[i];
    }
    cout << "\n";
}
ll mod_pow(ll x, ll n, ll m = mod) {
    if (n < 0) {
        ll res = mod_pow(x, -n, m);
        return mod_pow(res, m - 2, m);
    }
    if (abs(x) >= m)x %= m;
    if (x < 0)x += m;
    //if (x == 0)return 0;
    ll res = 1;
    while (n) {
        if (n & 1)res = res * x % m;
        x = x * x % m; n >>= 1;
    }
    return res;
}
//mod should be <2^31
struct modint {
    int n;
    modint() :n(0) { ; }
    modint(ll m) {
        if (m < 0 || mod <= m) {
            m %= mod; if (m < 0)m += mod;
        }
        n = m;
    }
    operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
bool operator<(modint a, modint b) { return a.n < b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= (int)mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += (int)mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
    if (n == 0)return modint(1);
    modint res = (a * a) ^ (n / 2);
    if (n % 2)res = res * a;
    return res;
}

ll inv(ll a, ll p) {
    return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init_f() {
    fact[0] = modint(1);
    for (int i = 0; i < max_n - 1; i++) {
        fact[i + 1] = fact[i] * modint(i + 1);
    }
    factinv[max_n - 1] = modint(1) / fact[max_n - 1];
    for (int i = max_n - 2; i >= 0; i--) {
        factinv[i] = factinv[i + 1] * modint(i + 1);
    }
}
modint comb(int a, int b) {
    if (a < 0 || b < 0 || a < b)return 0;
    return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
    if (a < 0 || b < 0 || a < b)return 0;
    return fact[a] * factinv[a - b];
}

ll gcd(ll a, ll b) {
    a = abs(a); b = abs(b);
    if (a < b)swap(a, b);
    while (b) {
        ll r = a % b; a = b; b = r;
    }
    return a;
}
template<typename T>
void addv(vector<T>& v, int loc, T val) {
    if (loc >= v.size())v.resize(loc + 1, 0);
    v[loc] += val;
}
/*const int mn = 2000005;
bool isp[mn];
vector<int> ps;
void init() {
    fill(isp + 2, isp + mn, true);
    for (int i = 2; i < mn; i++) {
        if (!isp[i])continue;
        ps.push_back(i);
        for (int j = 2 * i; j < mn; j += i) {
            isp[j] = false;
        }
    }
}*/

//[,val)
template<typename T>
auto prev_itr(set<T>& st, T val) {
    auto res = st.lower_bound(val);
    if (res == st.begin())return st.end();
    res--; return res;
}

//[val,)
template<typename T>
auto next_itr(set<T>& st, T val) {
    auto res = st.lower_bound(val);
    return res;
}
using mP = pair<modint, modint>;
mP operator+(mP a, mP b) {
    return { a.first + b.first,a.second + b.second };
}
mP operator+=(mP& a, mP b) {
    a = a + b; return a;
}
mP operator-(mP a, mP b) {
    return { a.first - b.first,a.second - b.second };
}
mP operator-=(mP& a, mP b) {
    a = a - b; return a;
}
LP operator+(LP a, LP b) {
    return { a.first + b.first,a.second + b.second };
}
LP operator+=(LP& a, LP b) {
    a = a + b; return a;
}
LP operator-(LP a, LP b) {
    return { a.first - b.first,a.second - b.second };
}
LP operator-=(LP& a, LP b) {
    a = a - b; return a;
}

mt19937 mt(time(0));

const string drul = "DRUL";
string senw = "SENW";
//DRUL,or SENW
//int dx[4] = { 1,0,-1,0 };
//int dy[4] = { 0,1,0,-1 };

//------------------------------------



const int mn = 1 << 18;
struct edge {
    int to;
};
using Data = modint;
vector<edge> G[mn];
vector<Data> memo[mn];
int root;



Data dfs(int id, int fr) {
    Data res;
    //
    //initialize
    res = 0;
    //
    int chk = -1;
    rep(j, G[id].size())if (G[id][j].to == fr) {
        chk = j;
    }

    memo[id].resize(G[id].size());
    
    modint pro = 1;
    for (int j = chk + 1; j < G[id].size(); j++) {
        pro *= id + 1;
        int to = G[id][j].to;
        Data nex = dfs(to, id);
        memo[id][j] = nex;
        res += pro * nex;
    }
    pro *= id + 1;
    res += pro;
    for (int j = 0; j < chk; j++) {
        pro *= id + 1;
        int to = G[id][j].to;
        Data nex = dfs(to, id);
        memo[id][j] = nex;
        res += pro * nex;
    }
    return res;
}

modint ans[mn];
void invdfs(int id, int fr, Data pre) {
    vector<Data> v;
    for (Data d : memo[id])v.push_back(d);
    if (fr >= 0)v.push_back(pre);
    int len = v.size();
    //
    //calcurate id's ans
    if (fr >= 0) {
        //assert(G[id].size() == memo[id].size());
        rep(j, G[id].size()) {
            if (G[id][j].to == fr) {
                memo[id][j] = pre;
            }
        }
    }
    modint pro = 1;
    rep(j, G[id].size()) {
        pro *= id + 1;
        int to = G[id][j].to;
        ans[id] += memo[id][j] * pro;
    }
    //


    vector<modint> vals;
    rep(j, G[id].size()) {
        vals.push_back(memo[id][j]);
    }
    vals.push_back(1);
    int sz = vals.size();
    rep(j, sz)vals.push_back(vals[j]);
    vector<modint> tts(2 * sz + 1);
    tts[0] = 1;
    rep(i, 2 * sz)tts[i + 1] = tts[i] * (modint)(id + 1);
    vector<modint> rvals(2 * sz + 1);
    rvals[2 * sz] = 0;
    per(i, 2*sz) {
        rvals[i] = rvals[i + 1] * (modint)(id + 1) + vals[i];
    }

    rep(j, G[id].size()) {
        int to = G[id][j].to;
        if (to == fr)continue;
        modint v = rvals[j] - rvals[j + sz] * tts[sz];
        v -= vals[j];
        invdfs(to, id, v);
    }
}
void yaru() {
    dfs(root, -1);
    invdfs(root, -1, 0);
}
void solve() {
    int n; cin >> n;
    vector<vector<int>> v(n);
    rep(i, n) {
        int len; cin >> len;
        v[i].resize(len);
        rep(j, len) {
            cin >> v[i][j]; v[i][j]--;
        }
    }
    vector<array<int, 2>> ps(n - 1, array<int, 2>{-1, -1});
    rep(i, n) {
        for (int id : v[i]) {
            rep(j, 2) {
                if (ps[id][j] < 0) {
                    ps[id][j] = i;
                    break;
                }
            }
        }
    }

    rep(i, n) {
        for (int id : v[i]) {
            int to = ps[id][0] ^ ps[id][1] ^ i;
            G[i].push_back({ to });
        }
    }

    yaru();
    rep(i, n)cout << ans[i] << "\n";
}



signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    //cout << fixed<<setprecision(10);
    //init_f();
    //init();
    //while(true)
    //expr();
    //int t; cin >> t; rep(i, t)
    solve();
    return 0;
}
0