結果
問題 | No.2638 Initial fare |
ユーザー | Taiki0715 |
提出日時 | 2024-02-19 21:52:38 |
言語 | C++17(clang) (17.0.6 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 446 ms / 2,000 ms |
コード長 | 3,127 bytes |
コンパイル時間 | 5,120 ms |
コンパイル使用メモリ | 181,632 KB |
実行使用メモリ | 112,640 KB |
最終ジャッジ日時 | 2024-10-01 17:06:28 |
合計ジャッジ時間 | 13,376 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 25 |
ソースコード
#include <bits/stdc++.h>using namespace std;#if __has_include(<atcoder/all>)#include <atcoder/all>using namespace atcoder;template<int mod>istream &operator>>(istream &is,static_modint<mod> &a){long long b;is>>b;a=b;return is;}istream &operator>>(istream &is,modint &a){long long b;cin>>b;a=b;return is;}#endif#ifdef LOCAL#include "debug.h"#else#define debug(...) static_cast<void>(0)#define debugg(...) static_cast<void>(0)template<typename T1,typename T2>ostream &operator<<(ostream &os,const pair<T1,T2>&p){os<<p.first<<' '<<p.second;return os;}#endifusing ll=long long;using ull=unsigned long long;using P=pair<ll,ll>;template<typename T>using minque=priority_queue<T,vector<T>,greater<T>>;template<typename T>bool chmax(T &a,const T &b){return (a<b?(a=b,true):false);}template<typename T>bool chmin(T &a,const T &b){return (a>b?(a=b,true):false);}template<typename T1,typename T2>istream &operator>>(istream &is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}template<typename T>istream &operator>>(istream &is,vector<T> &a){for(auto &i:a)is>>i;return is;}template<typename T1,typename T2>void operator++(pair<T1,T2>&a,int n){a.first++,a.second++;}template<typename T1,typename T2>void operator--(pair<T1,T2>&a,int n){a.first--,a.second--;}template<typename T>void operator++(vector<T>&a,int n){for(auto &i:a)i++;}template<typename T>void operator--(vector<T>&a,int n){for(auto &i:a)i--;}#define reps(i,a,n) for(int i=(a);i<(n);i++)#define rep(i,n) reps(i,0,n)#define all(x) x.begin(),x.end()#define pcnt(x) __builtin_popcountll(x)ll myceil(ll a,ll b){return (a+b-1)/b;}template<typename T,size_t n,size_t id=0>auto vec(const int (&d)[n],const T &init=T()){if constexpr (id<n)return vector(d[id],vec<T,n,id+1>(d,init));else return init;}void SOLVE();int main(){ios::sync_with_stdio(false);cin.tie(nullptr);#ifdef LOCALclock_t start=clock();#endifint testcase=1;//cin>>testcase;for(int i=0;i<testcase;i++){SOLVE();}#ifdef LOCALcerr<<"time:";cerr<<(clock()-start)/1000;cerr<<"ms\n";#endif}void SOLVE(){int n;cin>>n;vector<vector<int>>to(n);rep(i,n-1){int u,v;cin>>u>>v;u--,v--;to[u].push_back(v);to[v].push_back(u);}ll ans=0;vector<vector<ll>>dp(n,vector<ll>(4,0));auto dfs=[&](auto self,int x,int p)->void {dp[x]={1,0,0,0};for(auto i:to[x])if(i!=p){self(self,i,x);rep(j,3)dp[x][j+1]+=dp[i][j];}};auto dfs2=[&](auto self,int x,int p)->void {for(auto i:to[x])ans+=reduce(dp[i].begin(),dp[i].end()-1);int s=to[x].size();vector<vector<ll>>left(s),right(s);rep(i,s)left[i]=right[i]=dp[to[x][i]];reps(i,1,s){rep(j,4)left[i][j]+=left[i-1][j];}for(int i=s-1;i>=1;i--){rep(j,4)right[i-1][j]+=right[i][j];}rep(i,s)if(to[x][i]!=p){dp[x]={1,0,0,0};if(i){rep(j,3)dp[x][j+1]+=left[i-1][j];}if(i!=s-1){rep(j,3)dp[x][j+1]+=right[i+1][j];}self(self,to[x][i],x);}};dfs(dfs,0,-1);debug('U');dfs2(dfs2,0,-1);cout<<ans/2<<endl;}