#884446 (C++23) No.2360 Path to Integer

提出ソース

結果

問題	No.2360 Path to Integer
ユーザー	eQe
提出日時	2023-06-24 03:01:57
言語	C++23 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	163 ms / 2,500 ms
コード長	10,791 bytes
コンパイル時間	7,331 ms
コンパイル使用メモリ	335,268 KB
実行使用メモリ	49,536 KB
最終ジャッジ日時	2024-07-01 06:32:47
合計ジャッジ時間	9,302 ms
ジャッジサーバーID （参考情報）	judge5 / judge2

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,812 KB
testcase_01	AC	2 ms 6,940 KB
testcase_02	AC	2 ms 6,944 KB
testcase_03	AC	2 ms 6,944 KB
testcase_04	AC	2 ms 6,944 KB
testcase_05	AC	2 ms 6,944 KB
testcase_06	AC	2 ms 6,940 KB
testcase_07	AC	3 ms 6,940 KB
testcase_08	AC	12 ms 6,940 KB
testcase_09	AC	149 ms 20,864 KB
testcase_10	AC	111 ms 23,544 KB
testcase_11	AC	108 ms 23,536 KB
testcase_12	AC	78 ms 21,376 KB
testcase_13	AC	151 ms 20,864 KB
testcase_14	AC	163 ms 44,160 KB
testcase_15	AC	143 ms 20,856 KB
testcase_16	AC	159 ms 49,536 KB

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

ソースコード

raw source code

#include<bits/stdc++.h>
#include<atcoder/all>
#define all(a) begin(a),end(a)
#define eb emplace_back
#define ep emplace
#define ef(...) else if(__VA_ARGS__)
#define wh(...) while(__VA_ARGS__)
#define fin(...) rr pp(__VA_ARGS__)
#define RD(T,...) T __VA_ARGS__;li(__VA_ARGS__)
#define LL(...) RD(ll,__VA_ARGS__)
#define ST(...) RD(str,__VA_ARGS__)
#define UL(n,...) u1 __VA_ARGS__;resize({n},__VA_ARGS__);li(__VA_ARGS__)
#define UV(n,...) u1 __VA_ARGS__;resize({n},__VA_ARGS__);vi(__VA_ARGS__)
#define SS(n,...) strs __VA_ARGS__;resize({n},__VA_ARGS__);li(__VA_ARGS__)
#define U2(n,m,...) u2 __VA_ARGS__;resize({n,m},__VA_ARGS__);li(__VA_ARGS__)
#define fe(v,e,...) for(auto&&__VA_OPT__([)e __VA_OPT__(,__VA_ARGS__)__VA_OPT__(]):v)
#define fo(i,...) for(ll i=rng_fo(__VA_ARGS__)[0],i##stop=rng_fo(__VA_ARGS__)[1],i##step=rng_fo(__VA_ARGS__)[2];i<i##stop;i+=i##step)
#define of(i,...) for(ll i=rng_of(__VA_ARGS__)[0],i##stop=rng_of(__VA_ARGS__)[1],i##step=rng_of(__VA_ARGS__)[2];i>=i##stop;i-=i##step)
#define debug(...) pp(#__VA_ARGS__,__VA_ARGS__)
#define I(...) template<__VA_ARGS__>
#define J typename
#define O operator
#define ce constexpr
#define cs const
#define rr return
#define uu using
uu vo=void;vo solve();uu std::cin;uu std::cout;uu std::swap;uu std::lower_bound;uu std::upper_bound;uu std::vector;uu std::multiset;
uu std::deque;uu std::tuple;uu std::array;uu std::begin;uu std::end;uu is=std::istream;uu os=std::ostream;
uu bo=bool;uu dd=long double;uu ll=long long;uu i64=ll;uu i128=__int128_t;uu ul=unsigned long long;uu u64=ul;uu u128=__uint128_t;
I(J T)uu v1=vector<T>;I(J T)uu v2=v1<v1<T>>;uu u1=v1<ll>;uu u2=v2<ll>;uu str=std::string;uu strs=v1<str>;str sp=" ",nc="",nl="\n";
uu ml=atcoder::modint998244353;is&O>>(is&i,ml&x){ll t;i>>t;x=t;rr i;}os&O<<(os&o,cs ml&x){rr o<<x.val();}uu m1=v1<ml>;uu m2=v2<ml>;
I(J A,J B=A)struct cp{A a;B b;cp():a(),b(){}cp(A a,B b):a(a),b(b){}cp(std::pair<A,B>p):a(p.first),b(p.second){}
  cp&O+=(cs cp&c){a+=c.a,b+=c.b;rr*this;}cp O+(cs cp&c)cs{rr cp{*this}+=c;}bo O==(cs cp&c)cs{rr a==c.a&&b==c.b;}
  cp&O-=(cs cp&c){a-=c.a,b-=c.b;rr*this;}cp O-(cs cp&c)cs{rr cp{*this}-=c;}bo O!=(cs cp&c)cs{rr a!=c.a||b!=c.b;}cp O-()cs{rr cp(-a,-b);}
  bo O<(cs cp&c)cs{rr a!=c.a?a<c.a:b<c.b;}friend is&O>>(is&i,cp&c){rr i>>c.a>>c.b;}
  bo O>(cs cp&c)cs{rr a!=c.a?a>c.a:b>c.b;}friend os&O<<(os&o,cs cp&c){rr o<<c.a<<sp<<c.b;}
};uu cl=cp<ll>;uu cls=v1<cl>;I(J T)uu qmax=std::priority_queue<T>;I(J T)uu qmin=std::priority_queue<T,v1<T>,std::greater<T>>;
I(J T)struct mset:multiset<T>{uu multiset<T>::multiset;vo erase(cs T&x){if(auto p=this->find(x);p!=this->end())multiset<T>::erase(p);}};
I(J T)uu set=std::set<T>;I(J T)uu uset=std::unordered_set<T>;I(J T,J U=T)uu map=std::map<T,U>;I(J T,J U=T)uu umap=std::unordered_map<T,U>;
ce ll oo=3e18;dd ee=1e-12,pi=acosl(-1);str Yes(bo y=1){rr y?"Yes":"No";}str No(){rr"No";}ll ppc(ll x){rr __builtin_popcountll(x);}
ll rnd(ll l,ll r=oo){static ul x=76,y=53,z=20,w=41;ul t=x^(x<<11);x=y,y=z,z=w,w=(w^(w>>19))^(t^(t>>8));if(r==oo)r=l,l=0;rr w%(r-l)+l;}
ll l2(u128 x){x|=1;ll r=0;wh(x)x>>=1,++r;rr r;}bo odd(ll x){rr x&1;}bo eve(ll x){rr~x&1;}ll pm1(ll x){rr 1-2*(x&1);}ll pw2(ll n){rr 1LL<<n;}
I(J T)bo at(T x,ll i){rr x>>i&1;}I(J T,J U,J V)bo in(T l,U m,V r){rr l<=m&&m<r;}I(J T)T sq(cs T&a){rr a*a;}I(J T)T cb(cs T&a){rr a*a*a;}
I(J T)T flo(T x,T y){rr y<0?x=-x,y=-y:x>=0?x/y:(x+1)/y-1;}array<ll,3>rng_fo(ll a,ll b=oo,ll c=0){if(b==oo)b=a,a=0;if(!c)c=1;rr{a,b,c};}
I(J T)T cei(T x,T y){rr y<0?x=-x,y=-y:x<=0?x/y:(x-1)/y+1;}array<ll,3>rng_of(ll a,ll b=0,ll c=0){if(!c)c=1;rr{a-1,b,c};}

I(J T)auto&O++(v1<T>&v,int){fe(v,e)++e;rr v;}I(J T)auto&O^=(v1<T>&v,cs v1<T>&u){copy(all(u),back_inserter(v));rr v;}
I(J T)auto&O--(v1<T>&v,int){fe(v,e)--e;rr v;}I(J T)auto O^(v1<T>v,cs v1<T>&u){rr v^=u;}
I(J T)T&srt(T&a){sort(all(a));rr a;}I(J T)T&rv(T&a){reverse(all(a));rr a;}I(J T)T slice(cs T&a,ll l,ll r){rr T(begin(a)+l,begin(a)+r);}
I(J T)T&rsr(T&a){srt(a),rv(a);rr a;}I(J T)T&uq(T&a){srt(a),a.erase(unique(all(a)),end(a));rr a;}I(J T)uu ilis=std::initializer_list<T>;
I(J T)decltype(auto)bg(T&a){rr*begin(a);}I(J T)T pof(deque<T>&q){T r=bg(q);q.pop_front();rr r;}I(J T)ce bo is_vec=0;
I(J T)decltype(auto)rb(T&a){rr*rbegin(a);}I(J T)T pob(deque<T>&q){T r=rb(q);q.pop_back();rr r;}I(J T)ce bo is_vec<v1<T>> =1;
I(J T)auto pop(T&a){if ce(is_vec<T>||std::is_same_v<T,str>){auto r=rb(a);a.pop_back();rr r;}else{auto r=a.top();a.pop();rr r;}}
I(J...A)auto max(cs A&...a){rr std::max(ilis<std::common_type_t<A...>>{a...});}I(J T,J U=T)vo af(v1<T>&a,U e={}){a.ep(begin(a),e);}
I(J...A)auto min(cs A&...a){rr std::min(ilis<std::common_type_t<A...>>{a...});}I(J T)vo df(T&a){a.erase(begin(a));}
I(J T,J U)bo amax(T&a,cs U&b){rr a<b?a=b,1:0;}I(J T,J U)ll arglb(cs v1<T>&a,cs U&b){rr lower_bound(all(a),b)-begin(a);}
I(J T,J U)bo amin(T&a,cs U&b){rr a>b?a=b,1:0;}I(J T,J U)ll argub(cs v1<T>&a,cs U&b){rr upper_bound(all(a),b)-begin(a);}
I(J V)auto vec_defval(cs v1<V>&){if ce(is_vec<V>)rr vec_defval(V());else rr V();}I(J T)bo add(T&a,cs T&b){rr a+=b,1;}
I(J S,bo f(S&,cs S&),J V)cp<S,bo>scan(cs v1<V>&v){//semigroup
  S r{};bo b=0;if ce(std::is_same_v<V,S>)fe(v,x)b?f(r,x):(r=x,b=1);else fe(v,x)if(auto[y,c]=scan<S,f>(x);c)b?f(r,y):(r=y,b=1);rr{r,b};}
I(J V,J T=decltype(vec_defval(V())))T max(cs V&v){rr scan<T,amax<T>>(v).a;}I(J T)ll len(cs T&a){rr a.size();}
I(J V,J T=decltype(vec_defval(V())))T min(cs V&v){rr scan<T,amin<T>>(v).a;}u1 io(ll n,ll x=0){u1 a(n);iota(all(a),x);rr a;}
I(J V,J T=decltype(vec_defval(V())))T sum(cs V&v){rr scan<T,add<T>>(v).a;}I(J F,J...A)vo swl(cs F&f,A&...a){(vo)ilis<ll>{(vo(f(a)),0)...};}
I(J T=ll,ll k=0,ll n)auto vec(cs ll(&s)[n],cs T&x={}){if ce(k==n-1)rr vector(s[k],x);else rr vector(s[k],vec<T,k+1,n>(s,x));}
I(ll n,J...A)vo resize(cs ll(&s)[n],A&...a){swl([&](auto&u){u=vec(s,vec_defval(u));},a...);}
I(J V,J T=decltype(vec_defval(V())))vo fill(v1<V>&v,T x={}){if ce(is_vec<V>)fe(v,e)fill(e,x);else fe(v,e)e=x;}

struct fio{fio(){cin.tie(0)->sync_with_stdio(0);cout<<std::fixed<<std::setprecision(12);}}fio;
os&O<<(os&o,cs u128&x){if(x<10)rr o<<char(x+'0');rr o<<x/10<<char(x%10+'0');}os&O<<(os&o,cs i128&x){if(x<0)o<<'-';rr o<<u128(x<0?-x:x);}
I(J V)os&O<<(os&o,cs v1<V>&v){str s=nl;if ce(is_vec<V>){if ce(is_vec<J V::value_type>)s+=nl;}else s=sp;fe(v,e)o<<e<<(&e==&rb(v)?nc:s);rr o;}
I(J T)os&O<<(os&o,cs set<T>&v){fe(v,e)o<<e<<sp;rr o;}I(J T,J U)os&O<<(os&o,cs map<T,U>&m){fe(m,e)o<<cp(e)<<nl;rr o;}
I(J T)os&O<<(os&o,cs mset<T>&v){fe(v,e)o<<e<<sp;rr o;}I(J T)is&O>>(is&i,v1<T>&v){fe(v,e)i>>e;rr i;}
I(J T)vo pp(cs T&a){cout<<a<<nl;}I(J...A)vo li(A&...a){(cin>>...>>a);}I(J...A)vo vi(ll i,A&...a){(cin>>...>>a[i]);}
I(J T,J...A)vo pp(cs T&a,cs A&...b){cout<<a;((cout<<sp<<b),...);pp(nc);}I(J T,J...A)vo vi(v1<T>&a,A&...b){fo(i,len(a))vi(i,a,b...);}

struct edg{ll t,w;edg(){}edg(ll t,ll w=1):t(t),w(w){}};uu graph=v2<edg>;
graph tog(cs u2&a){graph g;fe(a,e){g.eb();fe(e,v)rb(g).eb(v);}rr g;}u2 tou(cs graph&g){u2 a;fe(g,e){a.eb();fe(e,v,w)rb(a).eb(v);}rr a;}
cp<u1>ygi(u2&g,ll m,bo f=1){UV(m,a,b);if(f)a--,b--;fo(i,m)g[a[i]].eb(b[i]);rr{a,b};}
cp<u1>mgi(u2&g,ll m,bo f=1){auto[a,b]=ygi(g,m,f);fo(i,m)g[b[i]].eb(a[i]);rr{a,b};}auto ti(u2&g,bo f=1){rr mgi(g,len(g)-1,f);}
u1 en(cs str&s,cs str&b="a"){ll n=len(s);u1 r(n,-1);fo(i,n)if(len(b)==1)r[i]=s[i]-b[0];else fo(j,len(b))if(s[i]==b[j])r[i]=j;rr r;}
str de(cs u1&a,cs str&b="a"){ll n=len(a);str r(n,'|');fo(i,n)if(len(b)==1)r[i]=a[i]+b[0];else fo(j,len(b))if(a[i]==j)r[i]=b[j];rr r;}
u2 en(cs strs&s,cs str&b="a"){u2 r;fe(s,e)r.eb(en(e,b));rr r;}str ins(){str s;li(s);rr s;}strs inss(ll n){strs s(n);li(s);rr s;}
strs de(cs u2&a,cs str&b="a"){ll n=len(a);strs r(n);fo(i,n)r[i]=de(a[i],b);rr r;}u1 abc(){rr en(ins());}u2 abcs(ll n){rr en(inss(n));}

I(J...A)u1 zp(A&...a){u1 v;fe({a...},e)v^=e;uq(v);swl([&](u1&u){fe(u,e)e=arglb(v,e);},a...);rr v;}
I(J F,J...A)u1 vs(cs F&f,A&...a){ll n;fe({a...},e)n=len(e);u1 o=io(n);sort(all(o),f);swl([&](u1&u){u1 c=u;fo(i,n)u[i]=c[o[i]];},a...);rr o;}
I(J F)ll bsl(cs F&f,ll o,ll n){wh(abs(o-n)>1)(f((o+n)/2)?o:n)=(o+n)/2;rr o;}ll sqr(ll x){ll r=max(sqrtl(x)-1,dd());wh(r+1<=x/(r+1))++r;rr r;}
I(J F)dd bsd(cs F&f,dd o,dd n){fo(t,l2(abs(o-n)/ee)+1)(f((o+n)/2)?o:n)=(o+n)/2;rr o;}I(J T)auto zt(v1<T>a){fo(i,1,len(a))a[i]+=a[i-1];rr a;}
cls rle(cs u1&a){cls r;fe(a,e)len(r)&&e==rb(r).a?++rb(r).b:r.eb(e,1).b;rr r;}cls rce(u1 a){rr rle(srt(a));}
i128 po(i128 x,u128 n,u128 m=0){i128 r=1;wh(n){if(n&1)r*=x;x*=x;if(m)r%=m,x%=m;n>>=1;}rr r;}
u1 divs(ll n){u1 r;for(ll i=1;i*i<=n;i++)if(n%i==0)r.eb(i),r.eb(n/i);rr uq(r);}
cls fact(ll n){umap<ll>m;for(ll i=2;i*i<=n;i++)wh(n%i==0)++m[i],n/=i;if(n>1)++m[n];cls r;fe(m,e)r.eb(e);rr srt(r);}

I(J node_t,J dp_t,J edge_t)struct rerooting_dp{
  struct EDGE{
    ll t;
    edge_t w;
    EDGE(){}
    EDGE(ll t,edge_t w={}):t(t),w(w){}
  };
  
  struct DP{
    dp_t val;
    ll size;
    DP(){}
    DP(dp_t val,ll size):val(val),size(size){}
  };
  cs DP id=DP(0,0);
  
  DP merge(DP x,DP su){
    rr{su.val+x.val,su.size+x.size};
  };
  DP merge_edge(DP x,EDGE e){
    rr x;
  };
  DP merge_root(DP x,ll u){
    rr{(x.val+1)*ml(10).pow(A[u]),x.size+1};
  };
  
  ll n;
  v2<EDGE>g;
  v1<node_t>A;
  v2<DP>dp;
  v1<DP>res;
  
  rerooting_dp(ll n,cs v1<node_t>&a={}):n(n),A(a){
    g.resize(n);
    if(!len(A))A.resize(n);
    dp.resize(n);
    res.resize(n);
  }
  
  vo build(){
    dfs(0); //0を根とする普通の木dp(全方位木dpにおける初期化)
    bfs(0,id);
  }
  
  DP dfs(ll u,ll p=-1){
    DP su=id;
    dp[u]=v1<DP>(len(g[u]),id);
    fo(i,len(g[u]))if(ll v=g[u][i].t;v!=p){
      dp[u][i]=dfs(v,u);//vを根とする部分木の結果
      dp[u][i]=merge_edge(dp[u][i],g[u][i]); //辺(u,v)を追加．
      su=merge(su,dp[u][i]);
    }
    rr merge_root(su,u);
  }
  
  vo bfs(ll u,cs DP&dpp,ll p=-1){
    ll deg=len(g[u]);
    fo(i,deg)if(g[u][i].t==p){
      dp[u][i]=dpp;
      dp[u][i]=merge_edge(dp[u][i],g[u][i]); //dfs(v,u)の下の行と同様．
    }
    
    v1<DP>dpl(deg+1,id),dpr(deg+1,id);
    fo(i,deg)dpl[i+1]=merge(dpl[i],dp[u][i]);
    of(i,deg)dpr[i]=merge(dpr[i+1],dp[u][i]);
    
    res[u]=dpl[deg];
    //res[u]=merge_root(dpl[deg],u);
    
    fo(i,deg){
      ll v=g[u][i].t;
      //merge_root(merge(dpl[i],dpr[i+1]),u):uを根とする木（ただしvの部分木を除く）に関する値．
      if(v!=p)bfs(v,merge_root(merge(dpl[i],dpr[i+1]),u),u);
    }
  }
};

ll l10(u128 x){x|=1;ll r=0;wh(x)x/=10,++r;rr r;}

int main(){ll T=1;fo(t,T)solve();}
vo solve(){
  LL(N);
  UL(N,a);
  
  rerooting_dp<ll,ml,bo>rt(N);
  fo(i,N-1){
    LL(u,v);u--,v--;
    rt.g[u].eb(v);
    rt.g[v].eb(u);
  }
  fo(i,N)rt.A[i]=l10(a[i]);
  
  rt.build();
  
  ml ans=0;
  fo(i,N){
    ml t=0;
    fo(j,len(rt.g[i])){
      t+=rt.dp[i][j].val*a[i]*(N-rt.dp[i][j].size);
    }
    ans+=t+a[i]*N;
  }
  pp(ans);
}

yukicoder

結果

テストケース

ソースコード