/* xzppp */
#include <iostream>
#include <vector>
#include <cstdio>
#include <string.h>
#include <algorithm>
#include <queue>
#include <map>
#include <string>
#include <cmath>
#include <bitset>
#include <iomanip>
using namespace std;
#define FFF freopen("in.txt","r",stdin);freopen("out.txt","w",stdout);
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define MP make_pair
#define PB push_back
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int,int > pii;
typedef pair<LL,LL> pll;
typedef pair<double,double > pdd;
typedef pair<double,int > pdi;
const int MAXM = 2e3+17;
const int MAXV = 2*1e3+17;
const int BIT = 15+3;
const int INF = 0x7fffffff;
const LL INFF = 0x3f3f3f3f3f3f3f3f;
const int MOD = 1e9+7;
const int MAXN = 1e6+17;
int dp[MAXN][10+3][3];
int temp[10+3][3],tms[MAXN];
int n,m,k,x;
vector<int > G[MAXN];
void dfs(int pre,int now)
{
if(G[now].size()==1&&pre!=now)
{
dp[now][0][0] = k-1;
dp[now][1][1] = 1;
dp[now][0][2] = m-k;
tms[now] = 1;
}
for (int i = 0; i < G[now].size(); ++i)
{
int to = G[now][i];
if(to!=pre)
{
dfs(now,to);
for (int i = 0; i <= x; ++i)
{
for (int j = 0; j <= tms[now]; ++j)
{
dp[now][][]
}
}
}
}
}
int main()
{
#ifdef GoodbyeMonkeyKing
FFF
#endif
cin>>n>>m;
for (int i = 0; i < n-1; ++i)
{
int u,v;
cin>>u>>v;
u--;v--;
G[u].push_back(v);
G[v].push_back(u);
}
cin>>k>>x;
dfs(0,0);
LL ans = 0;
for (int i = 0; i <= x; ++i)
{
ans += (dp[0][i][0] + dp[0][i][1] + dp[0][i][2]);
}
cout<<ans<<endl;
return 0;
}
1 1
3 3
1 3 * 1 3
3 1
1 2 1
2 1 1
2 1 3
1 1 2
3 1 2
记一下这个题,不会做... CF855C
最新推荐文章于 2022-04-25 12:01:40 发布