#2235 Maintain
SOL
这道题要求动态维护MST
由于数据很小,可以每次跑Kruskal
然而sort会超时
直接插入排序即可
代码:
#include<bits/stdc++.h>
using namespace std;
#define re register
inline int rd(){
int re data=0;static char ch=0;ch=getchar();
while(!isdigit(ch))ch=getchar();
while(isdigit(ch))data=(data<<1)+(data<<3)+(ch^48),ch=getchar();
return data;
}
const int N=205,M=10005;
struct edge{int u,v,w;}e[M],tmp;
int fa[N],n,m;
inline int find(int x){return fa[x]==x?x:fa[x]=find(fa[x]);}
inline int kruskal(int now,int cnt=0,int sum=0,bool add=0){
for(int re i=1;i<=n;++i)fa[i]=i;
if(now>1){for(int re i=1;i^now;++i)if(e[i].w>tmp.w){for(int re j=now;j>i;--j)e[j]=e[j-1];e[i]=tmp,add=1;break;}if(!add)e[now]=tmp;}
else e[now]=tmp;
for(int re fu,fv,u,v,w,i=1;i<=now;++i){
u=e[i].u,v=e[i].v,w=e[i].w,fu=find(u),fv=find(v);
if(fu==fv)continue;
fa[fu]=fv,sum+=w,++cnt;
if(cnt==n-1)break;
}if(cnt!=n-1)return -1;
else return sum;
}
signed main(){
n=rd(),m=rd();
for(int re i=1;i<=m;++i)tmp.u=rd(),tmp.v=rd(),tmp.w=rd(),printf("%d\n",kruskal(i));
exit(0);
}