题目链接:BZOJ4016
题解:先跑一个最短路图,然后按照结点编号从小到大dfs一遍,dfs树即为题目所要求。然后就是点分治的经典做法,路径分为经过根节点的和不经过根节点的,不经过根节点的路径一定属于其某个子树中,分治来做。
code(有参考hzwer大神):
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<vector>
#include<queue>
#define inf 2000000000
#define pir pair<int,int>
using namespace std;
int ans1,ans2,n,m,K,tot=0,rt,sum;
int dis[30005],head[30005],head2[30005],mx[30005],siz[30005],deep[30005],q[30005],fa[30005];
bool vis[30005]; int f[30005][2],g[30005][2];
priority_queue<pir,vector<pir>,greater<pir> > hp;
struct edge{
int to,ne,val;
}ep[120005],e[60005];
vector<pir> to[30005];
void insert(int x,int y,int val)
{
e[++tot].to=y; e[tot].val=val; e[tot].ne=head[x]; head[x]=tot;
e[++tot].to=x; e[tot].val=val; e[tot].ne=head[y]; head[y]=tot;
}
void insert2(int x,int y,int val)
{
ep[++tot].to=y; ep[tot].val=val; ep[tot].ne=head2[x]; head2[x]=tot;
}
void dj()
{
for (int i=1;i<=n;i++) dis[i]=inf;
dis[1]=1;
hp.push(make_pair(0,1));
while (!hp.empty())
{
int now=hp.top().second; hp.pop();
if (vis[now]) continue;
vis[now]=1;
for (int i=head2[now];i;i=ep[i].ne)
{
int v=ep[i].to;
if (dis[v]>dis[now]+ep[i].val)
{
dis[v]=dis[now]+ep[i].val;
hp.push(make_pair(dis[v],v));
}
}
}
}
void dfs(int now) //最短路图上的dfs树
{
vis[now]=1;
for (int i=head2[now];i;i=ep[i].ne)
{
int v=ep[i].to;
if (!vis[v]&&dis[now]+ep[i].val==dis[v])
{
insert(now,v,ep[i].val);
dfs(v);
}
}
}
void getroot(int now)
{
siz[now]=1,mx[now]=0;
for (int i=head[now];i;i=e[i].ne)
{
int v=e[i].to;
if (!vis[v]&&v!=fa[now])
{
fa[v]=now;
getroot(v);
mx[now]=max(mx[now],siz[v]);
siz[now]+=siz[v];
}
}
mx[now]=max(mx[now],sum-mx[now]);
if (mx[now]<mx[rt]) rt=now;
}
void solve(int x,int S)
{
vis[x]=1; f[0][1]=1;
for (int i=head[x];i;i=e[i].ne)
{
int v=e[i].to;
if (!vis[v])
{
int h=0,w=1;
q[0]=v;
deep[v]=1; fa[v]=x;
dis[v]=e[i].val;
while (h!=w)
{
int now=q[h];h++;
int k=deep[now];
if (k>K) break;
if (dis[now]>g[k][0])
g[k][0]=dis[now],g[k][1]=0;
if (dis[now]==g[k][0]) g[k][1]++;
for (int j=head[now];j;j=e[j].ne)
{
int vv=e[j].to;
if (!vis[vv]&&vv!=fa[now])
{
fa[vv]=now;
deep[vv]=deep[now]+1;
dis[vv]=dis[now]+e[j].val;
q[w++]=vv;
}
}
}
for (int j=1;j<=K;j++)
{
if (g[j][0]+f[K-j][0]>ans1)
ans1=g[j][0]+f[K-j][0],ans2=0;
if (g[j][0]+f[K-j][0]==ans1)
ans2+=g[j][1]*f[K-j][1];
}
for (int j=1;j<=K;j++)
{
if (g[j][0]>f[j][0]) f[j][0]=g[j][0],f[j][1]=0;
if (g[j][0]==f[j][0]) f[j][1]+=g[j][1];
g[j][0]=g[j][1]=0;
}
}
}
for (int j=0;j<=K;j++) f[j][0]=f[j][1]=0;
for (int i=head[x];i;i=e[i].ne)
{
int v=e[i].to;
if (!vis[v])
{
sum=siz[v];
if (siz[v]>siz[x]) siz[v]=S-siz[v];
rt=0;
if (sum>=K) getroot(v);
solve(rt,siz[v]);
}
}
}
int main()
{
scanf("%d%d%d",&n,&m,&K); K--;
for (int i=1;i<=m;i++)
{
int x,y,val;
scanf("%d%d%d",&x,&y,&val);
to[x].push_back(make_pair(y,val));
to[y].push_back(make_pair(x,val));
}
for (int i=1;i<=n;i++)
{
sort(to[i].begin(),to[i].end());
for (int t=to[i].size()-1;t>=0;t--)
insert2(i,to[i][t].first,to[i][t].second);
}
dj();
tot=0; memset(vis,0,sizeof(vis));
dfs(1);
memset(vis,0,sizeof(vis));
rt=0,mx[0]=inf;sum=n;
getroot(1); solve(rt,sum);
printf("%d %d",ans1,ans2);
return 0;
}