Kruskal算法84pts求助

P3366 【模板】最小生成树

ans = 0 不一定说明不连通啊
by yqr123YQR @ 2023-08-15 20:39:03


应该直接循环统计最后剩下了几个连通块
by yqr123YQR @ 2023-08-15 20:39:58


```cpp int cnt=0; for(int i=1;i<=m;i++){ int x=getfa(edge[i].x),y=getfa(edge[i].y); if(x==y) continue; fa[x]=y; ans+=edge[i].z; cnt++; if(cnt==n-1)break; } if(cnt!=n-1) { printf("orz");return 0;} printf("%d",ans); ```
by 蒟蒻的我orz @ 2023-08-22 17:01:59


|