2016年四川省赛H题 Around the World(BEST定理||树形dp)

$给你一棵树，然后每条边其实有2c_i条边组成，问你从1出发回到1，走过所有边的欧拉回路个数$
$欧拉回路个数，BEST定理$
$考虑对于每对2c_i条边来说，肯定c_i条是入边，c_i条是出边$
$然后点有10W个，不能用矩阵求基尔霍夫矩阵的行列式$
$但是这题已经是一棵树了，1为根的外向树的个数，就是所有c_i的乘积$
$然后因为2c_i条边里选c_i条作为入边，还要组合数$
$剩下的计算一下入度，乘一下阶乘即可$

---

代码：

#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cmath>
#include <string>
#include <vector>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <sstream>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#pragma comment(linker,"/STACK:102400000,102400000")

using namespace std;
#define   MAX           2000010
#define   MAXN          1000005
#define   maxnode       5
#define   sigma_size    30
#define   lson          l,m,rt<<1
#define   rson          m+1,r,rt<<1|1
#define   lrt           rt<<1
#define   rrt           rt<<1|1
#define   middle        int m=(r+l)>>1
#define   LL            long long
#define   ull           unsigned long long
#define   mem(x,v)      memset(x,v,sizeof(x))
#define   lowbit(x)     (x&-x)
#define   pii           pair<int,int>
#define   bits(a)       __builtin_popcount(a)
#define   mk            make_pair
#define   limit         10000

//const int    prime = 999983;
const int    INF   = 0x3f3f3f3f;
const LL     INFF  = 0x3f3f;
const double pi    = acos(-1.0);
const double inf   = 1e18;
const double eps   = 1e-6;
const LL     mod   = 1e9+7;
const ull    mx    = 133333331;

/*****************************************************/
inline void RI(int &x) {
      char c;
      while((c=getchar())<'0' || c>'9');
      x=c-'0';
      while((c=getchar())>='0' && c<='9') x=(x<<3)+(x<<1)+c-'0';
 }
/*****************************************************/

int deg[100005];
LL fact[MAX];

void init(){
    fact[0]=1;
    for(int i=1;i<=2000000;i++) fact[i]=fact[i-1]*i%mod;
}

LL qpow(LL a,LL n){
    LL ans=1;
    while(n){
        if(n&1) ans=ans*a%mod;
        a=a*a%mod;
        n>>=1;
    }
    return ans;
}
LL C(int n,int m){
    return (fact[n]*qpow(fact[m],mod-2)%mod)*qpow(fact[n-m],mod-2)%mod;
}

int main(){
    //freopen("in.txt","r",stdin);
    init();
    int n;
    cin>>n;
    LL ans=1;
    mem(deg,0);
    for(int i=1;i<n;i++){
        int a,b,c;
        scanf("%d%d%d",&a,&b,&c);
        ans=(ans*C(2*c,c)%mod)*c%mod;
        deg[a]+=c;
        deg[b]+=c;
    }
    for(int i=1;i<=n;i++) ans=ans*fact[deg[i]-1]%mod;
    ans=ans*deg[1]%mod;
    cout<<ans<<endl;
    return 0;
}

---

$还有树形dp的做法，totoday大佬教我的$
$其实就是组合计数$
$dp[i]是走完i子树里所有的边的方案数$
$val[i]是i子树里有多少对边，就是一上一下，看作一对$
$然后对于u->v，c_i对边，v有val[v]对边，然后这c_i对可以分割val[v]对$
$就是组合数，然后还有2c_i条中选c_i条，然后配对$
$最后还要给val[u]对边一起做个全排列$
$这题组合数学的东西有点抽象$

---

代码：

#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cmath>
#include <string>
#include <vector>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <sstream>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#pragma comment(linker,"/STACK:102400000,102400000")

using namespace std;
#define   MAX           100010
#define   MAXN          1000005
#define   maxnode       5
#define   sigma_size    30
#define   lson          l,m,rt<<1
#define   rson          m+1,r,rt<<1|1
#define   lrt           rt<<1
#define   rrt           rt<<1|1
#define   middle        int m=(r+l)>>1
#define   LL            long long
#define   ull           unsigned long long
#define   mem(x,v)      memset(x,v,sizeof(x))
#define   lowbit(x)     (x&-x)
#define   pii           pair<int,int>
#define   bits(a)       __builtin_popcount(a)
#define   mk            make_pair
#define   limit         10000

//const int    prime = 999983;
const int    INF   = 0x3f3f3f3f;
const LL     INFF  = 0x3f3f;
const double pi    = acos(-1.0);
const double inf   = 1e18;
const double eps   = 1e-6;
const LL     mod   = 1e9+7;
const ull    mx    = 133333331;

/*****************************************************/
inline void RI(int &x) {
      char c;
      while((c=getchar())<'0' || c>'9');
      x=c-'0';
      while((c=getchar())>='0' && c<='9') x=(x<<3)+(x<<1)+c-'0';
 }
/*****************************************************/

struct Edge{
    int v,next,c;
}edge[MAX*2];
int head[MAX];
int val[MAX];
LL dp[MAX];
int tot;
LL fact[2000005];

void init(){
    fact[0]=1;
    for(int i=1;i<=2000000;i++) fact[i]=fact[i-1]*i%mod;
    mem(head,-1);
    tot=0;
}

void add_edge(int a,int b,int c){
    edge[tot]=(Edge){b,head[a],c};
    head[a]=tot++;
}

LL qpow(LL a,LL n){
    LL ans=1;
    while(n){
        if(n&1) ans=ans*a%mod;
        a=a*a%mod;
        n>>=1;
    }
    return ans;
}
LL C(int n,int m){
    return fact[n]*qpow(fact[m],mod-2)%mod*qpow(fact[n-m],mod-2)%mod;
}
void dfs(int u,int fa){
    val[u]=0;dp[u]=1;
    for(int i=head[u];i!=-1;i=edge[i].next){
        int v=edge[i].v;
        int x=edge[i].c;
        if(v==fa) continue;
        dfs(v,u);
        val[u]+=x;
        dp[u]=dp[u]*fact[2*x]%mod*qpow(fact[x],mod-2)%mod*dp[v]%mod*C(val[v]+x-1,x-1)%mod;
    }   
    dp[u]=dp[u]*fact[val[u]]%mod;
}
int main(){
    //freopen("in.txt","r",stdin);
    int n;
    cin>>n;
    init();
    for(int i=1;i<n;i++){
        int a,b,c;
        scanf("%d%d%d",&a,&b,&c);
        add_edge(a,b,c);
        add_edge(b,a,c);
    }
    dfs(1,-1);
    cout<<dp[1]<<endl;
    return 0;
}