解题报告:
建立 k 个并查集维护它的最小生成树
将边权从大到小排序再依次枚举每一条边,那如何快速判断它属于哪一并查集呢??你会发现答案就有单调性
#include<bits/stdc++.h>
#define LL long long
#define pii pair<LL,int>
#define all(x) x.begin(),x.end()
#define wp(x) write(x),putchar('\n')
#define wpl(x) write(x),putchar(' ')
#define mem(a,b) memset(a,b,sizeof(a))
using namespace std;
const int maxn = 1e4 + 5;
const int MOD = 998244353;
inline int read() {
int s = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {if (ch == '-') f = -1; ch = getchar();}
while (ch >= '0' && ch <= '9') {s = (s << 1) + (s << 3) + ch - '0'; ch = getchar();}
return s * f;
}
inline void write(LL x) {
if (x < 0) putchar('-'), x = -x;
if (x > 9) write(x / 10);
putchar(x % 10 + '0');
}
int n,m,k,ant[maxn*30];
struct node{
int x,y,w,id;
}p[maxn*30];
struct DSU{
int f[maxn];
void init(){for(int i=1;i<=n;i++) f[i]=i;}
void merge(int x,int y){f[getfind(x)]=getfind(y);}
int getfind(int x){return x==f[x]?x:f[x]=getfind(f[x]);}
bool check(int x,int y){return getfind(x)==getfind(y);}
}d[maxn];
int main() {
n=read(),m=read(),k=read();
for(int i=1;i<=m;i++){
p[i]={read(),read(),read(),i};
}
sort(p+1,p+m+1,[](node A,node B){return A.w>B.w;});
for(int i=1;i<=k;i++) d[i].init();
for(int i=1;i<=m;i++){
int l=1,r=k,ans=-1;
while(l<=r){
int mid=(l+r)>>1;
if(d[mid].check(p[i].x,p[i].y)) l=mid+1;
else ans=mid,r=mid-1;
}
if(ans==-1) continue;
ant[p[i].id]=ans;
d[ans].merge(p[i].x,p[i].y);
}
for(int i=1;i<=m;i++) wp(ant[i]);
return 0;
}