#937976 (C++17) No.2584 The University of Tree

提出ソース

結果

問題	No.2584 The University of Tree
ユーザー	tko919
提出日時	2023-12-12 01:44:09
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	214 ms / 3,000 ms
コード長	10,935 bytes
コンパイル時間	2,509 ms
コンパイル使用メモリ	217,812 KB
実行使用メモリ	55,680 KB
最終ジャッジ日時	2024-09-27 04:45:10
合計ジャッジ時間	9,934 ms
ジャッジサーバーID （参考情報）	judge1 / judge5

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	2 ms 5,376 KB
testcase_02	AC	2 ms 5,376 KB
testcase_03	AC	2 ms 5,376 KB
testcase_04	AC	2 ms 5,376 KB
testcase_05	AC	2 ms 5,376 KB
testcase_06	AC	2 ms 5,376 KB
testcase_07	AC	2 ms 5,376 KB
testcase_08	AC	2 ms 5,376 KB
testcase_09	AC	2 ms 5,376 KB
testcase_10	AC	2 ms 5,376 KB
testcase_11	AC	2 ms 5,376 KB
testcase_12	AC	2 ms 5,376 KB
testcase_13	AC	2 ms 5,376 KB
testcase_14	AC	2 ms 5,376 KB
testcase_15	AC	2 ms 5,376 KB
testcase_16	AC	2 ms 5,376 KB
testcase_17	AC	3 ms 5,376 KB
testcase_18	AC	2 ms 5,376 KB
testcase_19	AC	2 ms 5,376 KB
testcase_20	AC	3 ms 5,376 KB
testcase_21	AC	2 ms 5,376 KB
testcase_22	AC	102 ms 29,568 KB
testcase_23	AC	84 ms 19,656 KB
testcase_24	AC	52 ms 13,184 KB
testcase_25	AC	64 ms 15,488 KB
testcase_26	AC	40 ms 12,504 KB
testcase_27	AC	78 ms 20,860 KB
testcase_28	AC	47 ms 14,976 KB
testcase_29	AC	23 ms 9,088 KB
testcase_30	AC	188 ms 35,584 KB
testcase_31	AC	201 ms 43,904 KB
testcase_32	AC	39 ms 14,976 KB
testcase_33	AC	138 ms 54,656 KB
testcase_34	AC	28 ms 9,628 KB
testcase_35	AC	214 ms 43,648 KB
testcase_36	AC	148 ms 29,972 KB
testcase_37	AC	158 ms 29,184 KB
testcase_38	AC	161 ms 30,592 KB
testcase_39	AC	158 ms 34,176 KB
testcase_40	AC	183 ms 42,748 KB
testcase_41	AC	189 ms 39,728 KB
testcase_42	AC	190 ms 39,936 KB
testcase_43	AC	173 ms 38,400 KB
testcase_44	AC	212 ms 48,640 KB
testcase_45	AC	208 ms 48,512 KB
testcase_46	AC	139 ms 55,680 KB
testcase_47	AC	139 ms 29,756 KB
testcase_48	AC	54 ms 13,696 KB
testcase_49	AC	154 ms 27,648 KB
testcase_50	AC	116 ms 23,552 KB
testcase_51	AC	60 ms 14,848 KB
testcase_52	AC	28 ms 8,704 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#line 1 "library/Template/template.hpp"
#include <bits/stdc++.h>
using namespace std;

#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(v) (v).begin(),(v).end()
#define UNIQUE(v) sort(ALL(v)),(v).erase(unique(ALL(v)),(v).end())
#define SZ(v) (int)v.size()
#define MIN(v) *min_element(ALL(v))
#define MAX(v) *max_element(ALL(v))
#define LB(v,x) int(lower_bound(ALL(v),(x))-(v).begin())
#define UB(v,x) int(upper_bound(ALL(v),(x))-(v).begin())

using ll=long long int;
using ull=unsigned long long;
const int inf = 0x3fffffff;
const ll INF = 0x1fffffffffffffff;

template<typename T>inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template<typename T>inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<typename T,typename U>T ceil(T x,U y){assert(y!=0); if(y<0)x=-x,y=-y; return (x>0?(x+y-1)/y:x/y);}
template<typename T,typename U>T floor(T x,U y){assert(y!=0); if(y<0)x=-x,y=-y; return (x>0?x/y:(x-y+1)/y);}
template<typename T>int popcnt(T x){return __builtin_popcountll(x);}
template<typename T>int topbit(T x){return (x==0?-1:63-__builtin_clzll(x));}
template<typename T>int lowbit(T x){return (x==0?-1:__builtin_ctzll(x));}
#line 2 "library/Utility/fastio.hpp"
#include <unistd.h>

class FastIO{
    static constexpr int L=1<<16;
    char rdbuf[L];
    int rdLeft=0,rdRight=0;
    inline void reload(){
        int len=rdRight-rdLeft;
        memmove(rdbuf,rdbuf+rdLeft,len);
        rdLeft=0,rdRight=len;
        rdRight+=fread(rdbuf+len,1,L-len,stdin);
    }
    inline bool skip(){
        for(;;){
            while(rdLeft!=rdRight and rdbuf[rdLeft]<=' ')rdLeft++;
            if(rdLeft==rdRight){
                reload();
                if(rdLeft==rdRight)return false;
            }
            else break;
        }
        return true;
    }
    template<typename T,enable_if_t<is_integral<T>::value,int> =0>inline bool _read(T& x){
        if(!skip())return false;
        if(rdLeft+20>=rdRight)reload();
        bool neg=false;
        if(rdbuf[rdLeft]=='-'){
            neg=true;
            rdLeft++;
        }
        x=0;
        while(rdbuf[rdLeft]>='0' and rdLeft<rdRight){
            x=x*10+(neg?-(rdbuf[rdLeft++]^48):(rdbuf[rdLeft++]^48));
        }
        return true;
    }
    inline bool _read(__int128_t& x){
        if(!skip())return false;
        if(rdLeft+40>=rdRight)reload();
        bool neg=false;
        if(rdbuf[rdLeft]=='-'){
            neg=true;
            rdLeft++;
        }
        x=0;
        while(rdbuf[rdLeft]>='0' and rdLeft<rdRight){
            x=x*10+(neg?-(rdbuf[rdLeft++]^48):(rdbuf[rdLeft++]^48));
        }
        return true;
    }
    inline bool _read(__uint128_t& x){
        if(!skip())return false;
        if(rdLeft+40>=rdRight)reload();
        x=0;
        while(rdbuf[rdLeft]>='0' and rdLeft<rdRight){
            x=x*10+(rdbuf[rdLeft++]^48);
        }
        return true;
    }
    template<typename T,enable_if_t<is_floating_point<T>::value,int> =0>inline bool _read(T& x){
        if(!skip())return false;
        if(rdLeft+20>=rdRight)reload();
        bool neg=false;
        if(rdbuf[rdLeft]=='-'){
            neg=true;
            rdLeft++;
        }
        x=0;
        while(rdbuf[rdLeft]>='0' and rdbuf[rdLeft]<='9' and rdLeft<rdRight){
            x=x*10+(rdbuf[rdLeft++]^48);
        }
        if(rdbuf[rdLeft]!='.')return true;
        rdLeft++;
        T base=.1;
        while(rdbuf[rdLeft]>='0' and rdbuf[rdLeft]<='9' and rdLeft<rdRight){
            x+=base*(rdbuf[rdLeft++]^48);
            base*=.1;
        }
        if(neg)x=-x;
        return true;
    }
    inline bool _read(char& x){
        if(!skip())return false;
        if(rdLeft+1>=rdRight)reload();
        x=rdbuf[rdLeft++];
        return true;
    }
    inline bool _read(string& x){
        if(!skip())return false;
        for(;;){
            int pos=rdLeft;
            while(pos<rdRight and rdbuf[pos]>' ')pos++;
            x.append(rdbuf+rdLeft,pos-rdLeft);
            if(rdLeft==pos)break;
            rdLeft=pos;
            if(rdLeft==rdRight)reload();
            else break;
        }
        return true;
    }
    template<typename T>inline bool _read(vector<T>& v){
        for(auto& x:v){
            if(!_read(x))return false;
        }
        return true;
    }

    char wtbuf[L],tmp[50];
    int wtRight=0;
    inline void flush(){
        fwrite(wtbuf,1,wtRight,stdout);
        wtRight=0;
    }
    inline void _write(const char& x){
        if(wtRight>L-32)flush();
        wtbuf[wtRight++]=x;
    }
    inline void _write(const string& x){
        for(auto& c:x)_write(c);
    }
    template<typename T,enable_if_t<is_integral<T>::value,int> =0>inline void _write(T x){
        if(wtRight>L-32)flush();
        if(x==0){
            _write('0');
            return;
        }
        else if(x<0){
            _write('-');
            if (__builtin_expect(x == std::numeric_limits<T>::min(), 0)) {
                switch (sizeof(x)) {
                case 2: _write("32768"); return;
                case 4: _write("2147483648"); return;
                case 8: _write("9223372036854775808"); return;
                }
            }
            x=-x;
        }
        int pos=0;
        while(x!=0){
            tmp[pos++]=char((x%10)|48);
            x/=10;
        }
        rep(i,0,pos)wtbuf[wtRight+i]=tmp[pos-1-i];
        wtRight+=pos;
    }
    inline void _write(__int128_t x){
        if(wtRight>L-40)flush();
        if(x==0){
            _write('0');
            return;
        }
        else if(x<0){
            _write('-');
            x=-x;
        }
        int pos=0;
        while(x!=0){
            tmp[pos++]=char((x%10)|48);
            x/=10;
        }
        rep(i,0,pos)wtbuf[wtRight+i]=tmp[pos-1-i];
        wtRight+=pos;
    }
    inline void _write(__uint128_t x){
        if(wtRight>L-40)flush();
        if(x==0){
            _write('0');
            return;
        }
        int pos=0;
        while(x!=0){
            tmp[pos++]=char((x%10)|48);
            x/=10;
        }
        rep(i,0,pos)wtbuf[wtRight+i]=tmp[pos-1-i];
        wtRight+=pos;
    }
    template<typename T>inline void _write(const vector<T>& v){
        rep(i,0,v.size()){
            if(i)_write(' ');
            _write(v[i]);
        }
    }
public:
    FastIO(){}
    ~FastIO(){flush();}
    inline void read(){}
    template <typename Head, typename... Tail>inline void read(Head& head,Tail&... tail){
        assert(_read(head));
        read(tail...); 
    }
    template<bool ln=true,bool space=false>inline void write(){if(ln)_write('\n');}
    template <bool ln=true,bool space=false,typename Head, typename... Tail>inline void write(const Head& head,const Tail&... tail){
        if(space)_write(' ');
        _write(head);
        write<ln,true>(tail...); 
    }
};

/**
 * @brief Fast IO
 */
#line 3 "sol.cpp"

#line 2 "library/Math/modint.hpp"

template<int mod=1000000007>struct fp {
    int v;
    static constexpr int get_mod(){return mod;}
    int inv() const{
        int tmp,a=v,b=mod,x=1,y=0;
        while(b)tmp=a/b,a-=tmp*b,swap(a,b),x-=tmp*y,swap(x,y);
        if(x<0){x+=mod;} return x;
    }
    fp(ll x=0){init(x%mod+mod);}
    fp& init(ll x){v=(x<mod?x:x-mod); return *this;}
    fp operator-()const{return fp()-*this;}
    fp pow(ll t){assert(t>=0); fp res=1,b=*this; while(t){if(t&1)res*=b;b*=b;t>>=1;} return res;}
    fp& operator+=(const fp& x){return init(v+x.v);}
    fp& operator-=(const fp& x){return init(v+mod-x.v);}
    fp& operator*=(const fp& x){v=ll(v)*x.v%mod; return *this;}
    fp& operator/=(const fp& x){v=ll(v)*x.inv()%mod; return *this;}
    fp operator+(const fp& x)const{return fp(*this)+=x;}
    fp operator-(const fp& x)const{return fp(*this)-=x;}
    fp operator*(const fp& x)const{return fp(*this)*=x;}
    fp operator/(const fp& x)const{return fp(*this)/=x;}
    bool operator==(const fp& x)const{return v==x.v;}
    bool operator!=(const fp& x)const{return v!=x.v;}
    friend istream& operator>>(istream& is,fp& x){return is>>x.v;}
    friend ostream& operator<<(ostream& os,const fp& x){return os<<x.v;}
};

template<typename T>T Inv(ll n){
    static const int md=T::get_mod();
    static vector<T> buf({0,1});
    assert(n>0);
    n%=md;
    while(SZ(buf)<=n){
        int k=SZ(buf),q=(md+k-1)/k;
        buf.push_back(buf[k*q-md]*q);
    }
    return buf[n];
}

template<typename T>T Fact(ll n,bool inv=0){
    static const int md=T::get_mod();
    static vector<T> buf({1,1}),ibuf({1,1});
    assert(n>=0 and n<md);
    while(SZ(buf)<=n){
        buf.push_back(buf.back()*SZ(buf));
        ibuf.push_back(ibuf.back()*Inv<T>(SZ(ibuf)));
    }
    return inv?ibuf[n]:buf[n];
}

template<typename T>T nPr(int n,int r,bool inv=0){if(n<0||n<r||r<0)return 0; return Fact<T>(n,inv)*Fact<T>(n-r,inv^1);}
template<typename T>T nCr(int n,int r,bool inv=0){if(n<0||n<r||r<0)return 0; return Fact<T>(n,inv)*Fact<T>(r,inv^1)*Fact<T>(n-r,inv^1);}
template<typename T>T nHr(int n,int r,bool inv=0){return nCr<T>(n+r-1,r,inv);}

/**
 * @brief Modint
 */
#line 5 "sol.cpp"
using Fp=fp<998244353>;

FastIO io;
int main(){
    int n;
    io.read(n);
    vector id(n,vector<int>());
    rep(_,0,n){
        int x;
        io.read(x);
        id[_].resize(x);
        io.read(id[_]);
        for(auto& y:id[_])y--;
    }
    vector<int> es(n-1);
    rep(v,0,n)for(auto& i:id[v])es[i]^=v;
    using P=pair<int,int>;
    vector g(n,vector<P>());
    rep(v,0,n){
        g[v].push_back({-1,-1});
        for(auto& i:id[v])g[v].push_back({i,es[i]^v});
    }

    vector<Fp> pre(n-1);
    auto dfs1=[&](auto& dfs1,int v,int p,int cur)->void{
        int m=SZ(g[v]);
        int sta=-1;
        rep(i,0,g[v].size())if(g[v][i].first==cur)sta=i;
        assert(sta!=-1);
        Fp base=1;
        rep(i,1,m){
            base*=v+1;
            auto [id,to]=g[v][(sta+i)%m];
            if(cur!=-1)if(id==-1)pre[cur]+=base;
            if(id==-1 or to==p)continue;
            dfs1(dfs1,to,v,id);
            if(cur!=-1)pre[cur]+=base*pre[id];
        }
    };
    dfs1(dfs1,0,-1,-1);

    vector<Fp> ret(n);
    auto dfs2=[&](auto& dfs2,int v,int p,int cur,Fp rem)->void{
        int m=SZ(g[v]);
        const Fp invv=Fp(v+1).inv();
        Fp sum=0,base=1;
        rep(i,1,m){
            base*=v+1;
            auto [id,to]=g[v][i];
            if(id==cur)sum+=base*rem;
            else sum+=base*pre[id];
        }
        ret[v]=sum;

        Fp add=v+1,ref=1;
        for(int i=m-1;i;i--){
            ref*=v+1;
            auto [id,to]=g[v][i];
            if(id==cur)sum-=rem*base;
            else sum-=pre[id]*base;
            base*=invv;

            if(to!=p and to!=-1){
                Fp nxt=sum*ref+add;
                dfs2(dfs2,to,v,id,nxt);
            }
            if(id==cur)add+=rem;
            else add+=pre[id];
            add*=v+1;
        }
    };
    dfs2(dfs2,0,-1,-1,1);

    rep(i,0,n)io.write(ret[i].v);
    return 0;
}

yukicoder

結果

テストケース

ソースコード