#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<cstdlib>
#include<string>
#include<queue>
#include<map>
#include<stack>
#include<list>
#include<set>
#include<deque>
#include<vector>
#include<ctime>
#define ll long long
#define inf 0x7fffffff
#define N 208
#define IL inline
#define M 1008611
#define D double
#define ull unsigned long long
#define R register
using namespace std;
template<typename T>IL void read(T &_)
{
T __=0,___=1;char ____=getchar();
while(!isdigit(____)) {if(____=='-') ___=0;____=getchar();}
while(isdigit(____)) {__=(__<<1)+(__<<3)+____-'0';____=getchar();}
_=___ ? __:-__;
}
/*-------------OI使我快乐-------------*/
int n,m,k,tot=1,S,T,have;ll ans;
int dis[N][N];
int to[M],nex[M],head[N<<1],w[M],cost[M];
int dep[N<<1],flow[N<<1],pre[N<<1],las[N<<1];
bool vis[N<<1];queue<int> Q;
IL void add(int x,int y,int z,int f)
{to[++tot]=y;nex[tot]=head[x];head[x]=tot;w[tot]=z;cost[tot]=f;
swap(x,y);to[++tot]=y;nex[tot]=head[x];head[x]=tot;w[tot]=0;cost[tot]=-f;}
IL bool spfa()
{
memset(dep,0x3f,sizeof dep);
memset(flow,0x3f,sizeof flow);
memset(vis,0,sizeof vis);
dep[S]=0;vis[S]=1;Q.push(S);pre[T]=-1;
while(!Q.empty())
{
int u=Q.front();Q.pop();vis[u]=0;
for(R int i=head[u];i;i=nex[i])
{
int v=to[i];
if(w[i]>0&&dep[v]>dep[u]+cost[i])
{
dep[v]=dep[u]+cost[i];
flow[v]=min(flow[u],w[i]);
pre[v]=u;las[v]=i;
if(!vis[v]) {vis[v]=1;Q.push(v);}
}
}
}
return pre[T]!=-1;
}
IL void EK()
{
while(spfa())
{
have+=flow[T];
ans+=1ll*flow[T]*dep[T];
for(R int now=T;now!=S;now=pre[now])
{
w[las[now]]-=flow[T];w[las[now]^1]+=flow[T];
}
}
}
int main()
{
// freopen(".in","r",stdin);
// freopen(".out","w",stdout);
read(n);read(m);read(k);++n;S=(n<<1)+1;T=(n<<1)+2;
for(R int i=1;i<=n;++i) dis[i][i]=0;
memset(dis,0x3f,sizeof dis);
for(R int i=1,x,y,z;i<=m;++i)
{
read(x);read(y);read(z);++x;++y;
dis[x][y]=dis[y][x]=min(dis[x][y],z);
}
for(R int p=1;p<=n;++p)
for(R int i=1;i<=n;++i)
for(R int j=1;j<=n;++j)
if(p<=max(i,j))
dis[i][j]=min(dis[i][j],dis[i][p]+dis[p][j]);
// for(R int i=1;i<=n;++i)
// for(R int j=1;j<=n;++j)
// printf("%d%c",dis[i][j],(j==n ? '\n':' '));
for(R int i=1;i<=n;++i)
for(R int j=i+1;j<=n;++j)
add(i,j+n,1,dis[i][j]);
add(S,1,k,0);for(R int i=2;i<=n;++i) add(S,i,1,0);
for(R int i=1;i<=n;++i) add(i+n,T,1,0);
EK();
printf("%lld\n",ans);
// fclose(stdin);
// fclose(stdout);
return 0;
}
[ZJOI2011]营救皮卡丘
最新推荐文章于 2023-08-13 20:05:19 发布