結果

問題 No.1507 Road Blocked
ユーザー eQeeQe
提出日時 2024-12-17 15:19:34
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 109 ms / 2,000 ms
コード長 5,871 bytes
コンパイル時間 5,770 ms
コンパイル使用メモリ 331,300 KB
実行使用メモリ 27,588 KB
最終ジャッジ日時 2024-12-17 15:19:45
合計ジャッジ時間 10,226 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 2 ms
6,816 KB
testcase_02 AC 2 ms
6,820 KB
testcase_03 AC 54 ms
26,996 KB
testcase_04 AC 105 ms
27,580 KB
testcase_05 AC 104 ms
27,576 KB
testcase_06 AC 105 ms
27,576 KB
testcase_07 AC 97 ms
27,576 KB
testcase_08 AC 99 ms
27,580 KB
testcase_09 AC 100 ms
27,452 KB
testcase_10 AC 107 ms
27,452 KB
testcase_11 AC 104 ms
27,448 KB
testcase_12 AC 106 ms
27,576 KB
testcase_13 AC 108 ms
27,452 KB
testcase_14 AC 109 ms
27,580 KB
testcase_15 AC 102 ms
27,456 KB
testcase_16 AC 95 ms
27,572 KB
testcase_17 AC 92 ms
27,584 KB
testcase_18 AC 101 ms
27,580 KB
testcase_19 AC 94 ms
27,456 KB
testcase_20 AC 97 ms
27,572 KB
testcase_21 AC 91 ms
27,584 KB
testcase_22 AC 98 ms
27,452 KB
testcase_23 AC 107 ms
27,588 KB
testcase_24 AC 98 ms
27,576 KB
testcase_25 AC 98 ms
27,580 KB
testcase_26 AC 104 ms
27,588 KB
testcase_27 AC 101 ms
27,448 KB
testcase_28 AC 106 ms
27,456 KB
testcase_29 AC 106 ms
27,576 KB
testcase_30 AC 105 ms
27,452 KB
testcase_31 AC 106 ms
27,580 KB
testcase_32 AC 105 ms
27,460 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
namespace my{
using ml=atcoder::modint998244353;
auto&operator>>(istream&i,ml&x){int t;i>>t;x=t;return i;}
auto&operator<<(ostream&o,const ml&x){return o<<(int)x.val();}
#define eb emplace_back
#define LL(...) ll __VA_ARGS__;lin(__VA_ARGS__)
#define VV(n,...) vec<ll>__VA_ARGS__;setsize({n},__VA_ARGS__);vin(__VA_ARGS__)
#define FO(n) for(ll ij=n;ij-->0;)
#define FOR(i,...) for(auto[i,i##stop,i##step]=range(0,__VA_ARGS__);i<i##stop;i+=i##step)
#define fo(i,...) FO##__VA_OPT__(R)(i __VA_OPT__(,__VA_ARGS__))
#define fe(a,i,...) for(auto&&__VA_OPT__([)i __VA_OPT__(,__VA_ARGS__]):a)
#define single_testcase void solve();}int main(){my::io();my::solve();}namespace my{
void io(){cin.tie(nullptr)->sync_with_stdio(0);cout<<fixed<<setprecision(15);}
using ll=long long;
constexpr auto range(bool s,auto...a){array<ll,3>r{0,0,1};ll I=0;((r[I++]=a),...);if(!s&&I==1)swap(r[0],r[1]);r[0]-=s;return r;}
constexpr char newline=10;
constexpr char space=32;

auto&rev(auto&a){ranges::reverse(a);return a;}
auto pop_front(auto&a){assert(a.size());auto r=*a.begin();a.pop_front();return r;}

template<class T>struct deque:std::deque<T>{
  deque(const initializer_list<T>&a={}){fe(a,e)this->eb(e);}
  deque(const vector<T>&a){fe(a,e)this->eb(e);}
  friend ostream&operator<<(ostream&o,const deque&q){fe(q,e)o<<e<<string(&e!=&q.back(),space);return o;}
};

template<class V>concept vectorial=is_base_of_v<vector<typename V::value_type>,V>;
template<class T>struct vec_attr{using core_type=T;static constexpr int d=0;};
template<vectorial V>struct vec_attr<V>{using core_type=typename vec_attr<typename V::value_type>::core_type;static constexpr int d=vec_attr<typename V::value_type>::d+1;};
template<class T>using core_t=vec_attr<T>::core_type;
template<class V>istream&operator>>(istream&i,vector<V>&v){fe(v,e)i>>e;return i;}
template<class V>ostream&operator<<(ostream&o,const vector<V>&v){fe(v,e)o<<e<<string(&e!=&v.back(),vectorial<V>?newline:space);return o;}

template<class V>struct vec:vector<V>{
  using vector<V>::vector;
  vec(const vector<V>&v){vector<V>::operator=(v);}

  vec&operator^=(const vec&u){this->insert(this->end(),u.begin(),u.end());return*this;}
  vec operator^(const vec&u)const{return vec{*this}^=u;}
  vec&operator+=(const vec&u){vec&v=*this;fo(i,v.size())v[i]+=u[i];return v;}
  vec&operator-=(const vec&u){vec&v=*this;fo(i,v.size())v[i]-=u[i];return v;}
  vec operator+(const vec&u)const{return vec{*this}+=u;}
  vec operator-(const vec&u)const{return vec{*this}-=u;}
  vec&operator++(){fe(*this,e)++e;return*this;}
  vec&operator--(){fe(*this,e)--e;return*this;}
  vec operator-()const{vec v=*this;fe(v,e)e=-e;return v;}

  void pop_front(){this->erase(this->begin());}
};
template<class T=ll,size_t n,size_t i=0>auto make_vec(const ll(&s)[n],T x={}){if constexpr(n==i+1)return vec<T>(s[i],x);else{auto X=make_vec<T,n,i+1>(s,x);return vec<decltype(X)>(s[i],X);}}
template<ll n,class...A>void setsize(const ll(&l)[n],A&...a){((a=make_vec(l,core_t<A>())),...);}

void lin(auto&...a){(cin>>...>>a);}
void vin(auto&...a){fo(i,(a.size()&...))(cin>>...>>a[i]);}
template<char c=space>void pp(const auto&...a){ll n=sizeof...(a);((cout<<a<<string(--n>0,c)),...);cout<<newline;}

void dec(auto&...a){((--a),...);}

template<class WT>struct edge{
  ll from,to;
  WT wt;
  ll id;
  edge()=default;
  edge(ll from,ll to,WT wt=1,ll id=-1):from(from),to(to),wt(wt),id(id){}
  auto operator<=>(const edge&e)const{return wt<=>e.wt;}
  friend ostream&operator<<(ostream&o,const edge&e){return o<<"(to "<<e.to<<", wt "<<e.wt<<")";}
};

template<class WT>struct graph{
  vec<vec<edge<WT>>>edges;

  graph()=default;
  graph(ll n):edges(n){}

  decltype(auto)operator[](ll i){return edges[i];}
  decltype(auto)operator[](ll i)const{return edges[i];}

  ll size()const{return edges.size();}

  friend ostream&operator<<(ostream&o,const graph&g){
    fo(u,g.size()){
      o<<"from "<<u<<": ";
      fo(j,g[u].size())o<<g[u][j]<<string(j!=g[u].size()-1,space);
      o<<newline;
    }
    return o;
  }

  template<class...A>void add_edge(ll a,A&&...b){edges[a].eb(a,std::forward<A>(b)...);}
  void add_edge(const edge<WT>&e){edges[e.from].eb(e);}
  void add_edges(const vec<ll>&a,const vec<ll>&b){fo(i,a.size())edges[a[i]].eb(a[i],b[i],1,i);}
  void add_edges(const vec<ll>&a,const vec<ll>&b,const vec<WT>&w){fo(i,a.size())edges[a[i]].eb(a[i],b[i],w[i],i);}
  void add_edges(const vec<edge<WT>>&es){fe(es,e)edges[e.from].eb(e);}
};

template<class WT>struct rooted_tree:graph<WT>{
  vec<edge<WT>>rev_edge;
  ll r;
  rooted_tree(ll n,ll r):graph<WT>(n),rev_edge(n,{-1,-1,WT(),-1}),r(r){}

  ll par(ll u)const{return rev_edge[u].from;}
  ll root()const{return r;}

  auto bfs_order()const{
    vec<ll>ord;
    deque<ll>q{r};
    while(q.size()){
      ll u=q.front();
      q.pop_front();
      ord.eb(u);
      fe(this->edges[u],e)q.eb(e.to);
    }
    return ord;
  }

  auto subtree_size_enumerate()const{
    vec<WT>res(this->size(),1);
    auto ord=bfs_order();
    rev(ord);
    fe(ord,u)if(ll p=par(u);p!=-1)res[p]+=res[u];
    return res;
  }
};

template<class WT>auto bfs_tree(const graph<WT>&g,ll s){
  rooted_tree<WT>tree(g.size(),s);

  vec<bool>used(g.size());
  deque<edge<WT>>q{{-1,s,WT(),-1}};
  while(q.size()){
    auto pu=q.front();q.pop_front();
    auto[p,u,w,_]=pu;
    if(used[u])continue;
    used[u]=1;

    if(p!=-1)tree.add_edge(pu);
    tree.rev_edge[u]=pu;

    fe(g[u],e)if(!used[e.to])q.eb(e);
  }
  return tree;
}
template<class WT>auto bfs_tree(const rooted_tree<WT>&g){return bfs_tree(g,g.root());}

single_testcase
void solve(){
  LL(N);
  VV(N-1,a,b);dec(a,b);
  graph<ll>g(N);
  g.add_edges(a,b);
  g.add_edges(b,a);

  auto tree=bfs_tree(g,0);
  auto d=tree.subtree_size_enumerate();

  ml ans=0;
  fo(u,N)ans+=d[u]*(N-d[u]);
  ml U=N*(N-1)/2*(N-1);
  pp(1-ans/U);
}}
0