結果
問題 | No.2115 Making Forest Easy |
ユーザー | 👑 PCTprobability |
提出日時 | 2022-10-28 23:13:18 |
言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 656 ms / 2,000 ms |
コード長 | 7,424 bytes |
コンパイル時間 | 6,131 ms |
コンパイル使用メモリ | 278,364 KB |
実行使用メモリ | 358,944 KB |
最終ジャッジ日時 | 2023-09-20 06:28:22 |
合計ジャッジ時間 | 29,953 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,380 KB |
testcase_01 | AC | 2 ms
4,376 KB |
testcase_02 | AC | 651 ms
358,112 KB |
testcase_03 | AC | 589 ms
278,044 KB |
testcase_04 | AC | 647 ms
333,540 KB |
testcase_05 | AC | 531 ms
249,748 KB |
testcase_06 | AC | 656 ms
358,264 KB |
testcase_07 | AC | 558 ms
242,044 KB |
testcase_08 | AC | 656 ms
358,240 KB |
testcase_09 | AC | 546 ms
238,976 KB |
testcase_10 | AC | 654 ms
358,944 KB |
testcase_11 | AC | 619 ms
277,228 KB |
testcase_12 | AC | 545 ms
239,080 KB |
testcase_13 | AC | 487 ms
229,924 KB |
testcase_14 | AC | 544 ms
238,356 KB |
testcase_15 | AC | 559 ms
241,552 KB |
testcase_16 | AC | 623 ms
277,924 KB |
testcase_17 | AC | 41 ms
12,632 KB |
testcase_18 | AC | 89 ms
35,816 KB |
testcase_19 | AC | 311 ms
143,968 KB |
testcase_20 | AC | 439 ms
171,320 KB |
testcase_21 | AC | 37 ms
14,412 KB |
testcase_22 | AC | 98 ms
28,136 KB |
testcase_23 | AC | 457 ms
224,984 KB |
testcase_24 | AC | 619 ms
277,608 KB |
testcase_25 | AC | 230 ms
88,336 KB |
testcase_26 | AC | 545 ms
238,208 KB |
testcase_27 | AC | 279 ms
100,280 KB |
testcase_28 | AC | 560 ms
241,808 KB |
testcase_29 | AC | 58 ms
23,312 KB |
testcase_30 | AC | 560 ms
241,164 KB |
testcase_31 | AC | 651 ms
332,512 KB |
testcase_32 | AC | 650 ms
358,848 KB |
testcase_33 | AC | 654 ms
357,884 KB |
testcase_34 | AC | 56 ms
15,204 KB |
testcase_35 | AC | 123 ms
49,300 KB |
testcase_36 | AC | 651 ms
358,040 KB |
testcase_37 | AC | 265 ms
91,296 KB |
testcase_38 | AC | 137 ms
39,008 KB |
testcase_39 | AC | 227 ms
100,456 KB |
testcase_40 | AC | 556 ms
240,900 KB |
testcase_41 | AC | 547 ms
238,424 KB |
testcase_42 | AC | 553 ms
277,688 KB |
testcase_43 | AC | 214 ms
63,796 KB |
testcase_44 | AC | 137 ms
38,432 KB |
testcase_45 | AC | 387 ms
145,600 KB |
testcase_46 | AC | 635 ms
276,784 KB |
testcase_47 | AC | 189 ms
53,224 KB |
testcase_48 | AC | 647 ms
330,024 KB |
testcase_49 | AC | 644 ms
336,848 KB |
testcase_50 | AC | 302 ms
127,180 KB |
testcase_51 | AC | 204 ms
65,680 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; #if __has_include(<atcoder/all>) #include <atcoder/all> using namespace atcoder; #endif using ll = long long; using ld = long double; using ull = unsigned long long; #define endl "\n" typedef pair<int, int> Pii; #define REP(i, n) for (int i = 0; i < (n); ++i) #define REP3(i, m, n) for (int i = (m); (i) < int(n); ++ (i)) #define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++) #define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++) #define ALL(x) begin(x), end(x) #define rrep(i,a,b) for(int i=a;i>=b;i--) #define fore(i,a) for(auto &i:a) #define all(s) (s).begin(),(s).end() #define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i) #define drep(i, n) drep2(i, n, 0) #define rever(vec) reverse(vec.begin(), vec.end()) #define sor(vec) sort(vec.begin(), vec.end()) #define fi first #define se second #define pb push_back #define P pair<ll,ll> #define PQminll priority_queue<ll, vector<ll>, greater<ll>> #define PQmaxll priority_queue<ll,vector<ll>,less<ll>> #define PQminP priority_queue<P, vector<P>, greater<P>> #define PQmaxP priority_queue<P,vector<P>,less<P>> #define NP next_permutation //const ll mod = 1000000009; const ll mod = 998244353; //const ll mod = 1000000007; const ll inf = 4100000000000000000ll; const ld eps = ld(0.00000000001); static const long double pi = 3.141592653589793; template<class T>void vcin(vector<T> &n){for(int i=0;i<int(n.size());i++) cin>>n[i];} template<class T,class K>void vcin(vector<T> &n,vector<K> &m){for(int i=0;i<int(n.size());i++) cin>>n[i]>>m[i];} template<class T>void vcout(vector<T> &n){for(int i=0;i<int(n.size());i++){cout<<n[i]<<" ";}cout<<endl;} template<class T>void vcin(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cin>>n[i][j];}}} template<class T>void vcout(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cout<<n[i][j]<<" ";}cout<<endl;}cout<<endl;} void yes(bool a){cout<<(a?"yes":"no")<<endl;} void YES(bool a){cout<<(a?"YES":"NO")<<endl;} void Yes(bool a){cout<<(a?"Yes":"No")<<endl;} void possible(bool a){ cout<<(a?"possible":"impossible")<<endl; } void Possible(bool a){ cout<<(a?"Possible":"Impossible")<<endl; } void POSSIBLE(bool a){ cout<<(a?"POSSIBLE":"IMPOSSIBLE")<<endl; } template<class T>auto min(const T& a){ return *min_element(all(a)); } template<class T>auto max(const T& a){ return *max_element(all(a)); } template<class T,class F>void print(pair<T,F> a){cout<<a.fi<<" "<<a.se<<endl;} template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0;} template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0;} template<class T> void ifmin(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}} template<class T> void ifmax(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}} ll fastgcd(ll u,ll v){ll shl=0;while(u&&v&&u!=v){bool eu=!(u&1);bool ev=!(v&1);if(eu&&ev){++shl;u>>=1;v>>=1;}else if(eu&&!ev){u>>=1;}else if(!eu&&ev){v>>=1;}else if(u>=v){u=(u-v)>>1;}else{ll tmp=u;u=(v-u)>>1;v=tmp;}}return !u?v<<shl:u<<shl;} ll modPow(ll a, ll n, ll mod) { if(mod==1) return 0;ll ret = 1; ll p = a % mod; while (n) { if (n & 1) ret = ret * p % mod; p = p * p % mod; n >>= 1; } return ret; } vector<ll> divisor(ll x){ vector<ll> ans; for(ll i = 1; i * i <= x; i++){ if(x % i == 0) {ans.push_back(i); if(i*i!=x){ ans.push_back(x / ans[i]);}}}sor(ans); return ans; } ll pop(ll x){return __builtin_popcountll(x);} ll poplong(ll x){ll y=-1;while(x){x/=2;y++;}return y;} P hyou(P a){ll x=fastgcd(abs(a.fi),abs(a.se));a.fi/=x;a.se/=x;if(a.se<0){a.fi*=-1;a.se*=-1;}return a;} P Pplus(P a,P b){ return hyou({a.fi*b.se+b.fi*a.se,a.se*b.se});} P Ptimes(P a,ll b){ return hyou({a.fi*b,a.se});} P Ptimes(P a,P b){ return hyou({a.fi*b.fi,a.se*b.se});} P Pminus(P a,P b){ return hyou({a.fi*b.se-b.fi*a.se,a.se*b.se});} P Pgyaku(P a){ return hyou({a.se,a.fi});} template<class T> struct Sum{ vector<T> data; Sum(const vector<T>& v):data(v.size()+1){ for(ll i=0;i<v.size();i++) data[i+1]=data[i]+v[i]; } T get(ll l,ll r) const { return data[r]-data[l]; } }; template<class T> struct Sum2{ vector<vector<T>> data; Sum2(const vector<vector<T>> &v):data(v.size()+1,vector<T>(v[0].size()+1)){ for(int i=0;i<v.size();i++) for(int j=0;j<v[i].size();j++) data[i+1][j+1]=data[i][j+1]+v[i][j]; for(int i=0;i<v.size();i++) for(int j=0;j<v[i].size();j++) data[i+1][j+1]+=data[i+1][j]; } T get(ll x1,ll y1,ll x2,ll y2) const { return data[x2][y2]+data[x1][y1]-data[x1][y2]-data[x2][y1]; } }; void cincout(){ ios::sync_with_stdio(false); std::cin.tie(nullptr); cout<< fixed << setprecision(15); } using mint = modint998244353; vector<ll> g[5000]; vector<vector<mint>> dp[5000]; vector<ll> ind[5000]; ll D[5000]; ll a[5000]; vector<mint> conv(vector<mint> a,vector<mint> b){ for(int i=1;i<=1000;i++){ a[i]+=a[i-1]; b[i]+=b[i-1]; } for(int i=0;i<=1000;i++) a[i]*=b[i]; for(int i=1000;i>=1;i--) a[i]-=a[i-1]; return a; } void dfs(ll u,ll v){ bool f=false; for(int i=0;i<g[u].size();i++){ if(g[u][i]==v) continue; if(D[g[u][i]]==1){ dp[u][i][a[g[u][i]]]=1; } else{ dfs(g[u][i],u); vector<vector<mint>> c; int e=g[u][i]; for(int j=0;j<g[e].size();j++){ if(g[e][j]==u) continue; c.pb(dp[e][j]); } int x=a[e]; for(auto &f:c){ mint sum=0; for(int j=1000;j>=0;j--) sum+=f[j]; f[x]+=sum; for(int j=0;j<x;j++){ f[x]+=f[j]; f[j]=0; } } vector<mint> q=c[0]; for(int j=1;j<c.size();j++) q=conv(q,c[j]); dp[u][i]=q; } } } void bfs(ll u,ll v){ ll x=D[u]; vector<vector<mint>> l(x+1),r(x+1); l[0].resize(1001); r[0].resize(1001); l[0][0]=r[0][0]=1; for(int i=0;i<x;i++){ l[i+1]=dp[u][i]; r[x-i]=dp[u][i]; } for(int i=1;i<=x;i++){ mint sum=0; for(auto e:l[i]) sum+=e; l[i][a[u]]+=sum; for(int j=0;j<a[u];j++){ l[i][a[u]]+=l[i][j]; l[i][j]=0; } } for(int i=1;i<=x;i++){ mint sum=0; for(auto e:r[i]) sum+=e; r[i][a[u]]+=sum; for(int j=0;j<a[u];j++){ r[i][a[u]]+=r[i][j]; r[i][j]=0; } } for(int i=1;i<=x;i++) l[i]=conv(l[i],l[i-1]); for(int i=1;i<=x;i++) r[i]=conv(r[i],r[i-1]); for(int i=0;i<x;i++){ ll e=g[u][i]; if(e==v) continue; if(i==0&&x-i-1==0){ dp[e][ind[e][u]][a[u]]=1; } else{ dp[e][ind[e][u]]=conv(l[i],r[x-i-1]); } } for(int i=0;i<x;i++){ if(g[u][i]!=v) bfs(g[u][i],u); } } int main() { cincout(); ll n; cin>>n; for(int i=0;i<n;i++) cin>>a[i]; for(int i=0;i<n-1;i++){ ll u,v; cin>>u>>v; g[u-1].pb(v-1); D[u-1]++; D[v-1]++; g[v-1].pb(u-1); } for(int i=0;i<n;i++){ int x=g[i].size(); dp[i].resize(x); for(int j=0;j<x;j++){ dp[i][j].resize(1001); } } for(int i=0;i<n;i++){ ind[i].resize(n); for(int j=0;j<g[i].size();j++) ind[i][g[i][j]]=j; } dfs(0,-1); bfs(0,-1); mint ans=0; for(int i=0;i<n;i++){ vector<mint> c(1001); c[0]=1; for(int j=0;j<D[i];j++){ vector<mint> c2=dp[i][j]; mint sum=0; for(auto e:c2) sum+=e; c2[a[i]]+=sum; for(int j=0;j<a[i];j++){ c2[a[i]]+=c2[j]; c2[j]=0; } c=conv(c,c2); } for(int j=0;j<=1000;j++) ans+=c[j]*j; } cout<<ans.val()<<endl; }