题意应该蛮简单的:修改边权,每次修改后询问MST边权和。
思路:cdq分治+Kruskal
每次将(l,r)修改的边权改为inf,删去没有在MST中的边。
改为-inf,将在MST中且边权不为-inf的边连接的点缩点。(并查集)
l==r做kruskal。
这样做可以使边数,点数降到o(r-l+1)级别。
时间复杂度o(nlogn^2)
#include <bits/stdc++.h>
#define gc getchar()
#define mid (l+r>>1)
#define ll long long
#define N 50009
#define inf 0x3f3f3f3f
using namespace std;
int n,m,Q,anc[N],fa[N],e_number[20],a[N],size[N],p[N];
struct edge
{
int from,to,val,pos;
void add(int x,int y,int z,int i)
{
from=x,to=y,val=z,pos=i;
}
bool operator <(const edge &rhs) const
{
return val<rhs.val;
}
}e[20][N<<1],now[N],Now[N];
struct Qry
{
int id,val,t;
ll ans;
}q[N];
int read()
{
int x=1;
char ch;
while (ch=gc,ch<'0'||ch>'9') if (ch=='-') x=-1;
int s=ch-'0';
while (ch=gc,ch<='9'&&ch>='0') s=s*10+ch-'0';
return s*x;
}
void init(int tot)
{
for (int i=1;i<=tot;i++)
{
fa[now[i].from]=now[i].from,fa[now[i].to]=now[i].to;
size[now[i].from]=size[now[i].to]=1;
}
}
int getfather(int x)
{
return fa[x]==x?x:fa[x]=getfather(fa[x]);
}
void merge(int x,int y)
{
if (size[x]<=size[y]) fa[x]=y,size[y]+=size[x];
else fa[y]=x,size[x]+=size[y];
}
void contration(int &tot,ll &now_ans)
{
int ret=0;
init(tot);
sort(now+1,now+tot+1);
for (int i=1;i<=tot;i++)
if (getfather(now[i].from)!=getfather(now[i].to))
merge(fa[now[i].from],fa[now[i].to]),Now[++ret]=now[i];
for (int i=1;i<=ret;i++)
{
fa[Now[i].from]=Now[i].from,fa[Now[i].to]=Now[i].to;
size[Now[i].from]=size[Now[i].to]=1;
}
for (int i=1;i<=ret;i++)
if (Now[i].val!=-inf&&getfather(Now[i].to)!=getfather(Now[i].from))
merge(fa[Now[i].from],fa[Now[i].to]),now_ans+=Now[i].val;
ret=0;
for (int i=1;i<=tot;i++)
if (getfather(now[i].from)!=getfather(now[i].to))
{
Now[++ret]=now[i];
p[now[i].pos]=ret;
Now[ret].from=fa[Now[ret].from];
Now[ret].to=fa[Now[ret].to];
}
for (int i=1;i<=ret;i++) now[i]=Now[i];
tot=ret;
}
void reduction(int &tot)
{
int ret=0;
init(tot);
sort(now+1,now+tot+1);
for (int i=1;i<=tot;i++)
if (getfather(now[i].from)!=getfather(now[i].to))
{
merge(fa[now[i].from],fa[now[i].to]);
Now[++ret]=now[i],p[now[i].pos]=ret;
}
else
if (now[i].val==inf) Now[++ret]=now[i],p[now[i].pos]=ret;
for (int i=1;i<=ret;i++) now[i]=Now[i];
tot=ret;
}
void solve(int l,int r,int depth,ll now_ans)
{
int tot=e_number[depth];
if (l==r) a[q[l].id]=q[l].val;
for (int i=1;i<=tot;i++) e[depth][i].val=a[e[depth][i].pos];
for (int i=1;i<=tot;i++) now[i]=e[depth][i],p[now[i].pos]=i;
if (l==r)
{
q[l].ans=now_ans;
init(tot);
sort(now+1,now+tot+1);
for (int i=1;i<=tot;i++)
if (getfather(now[i].from)!=getfather(now[i].to))
q[l].ans+=now[i].val,merge(fa[now[i].from],fa[now[i].to]);
return;
}
for (int i=l;i<=r;i++) now[p[q[i].id]].val=-inf;
contration(tot,now_ans);
for (int i=l;i<=r;i++) now[p[q[i].id]].val=inf;
reduction(tot);
for (int i=1;i<=tot;i++) e[depth+1][i]=now[i];
e_number[depth+1]=tot;
solve(l,mid,depth+1,now_ans);
solve(mid+1,r,depth+1,now_ans);
}
int main()
{
n=read(),m=read(),Q=read();
for (int i=1;i<=m;i++)
{
int x=read(),y=read();
a[i]=read();
e[0][i].add(x,y,a[i],i);
}
for (int i=1;i<=Q;i++)
q[i].id=read(),q[i].val=read(),q[i].t=i;
e_number[0]=m;
solve(1,Q,0,0ll);
for (int i=1;i<=Q;i++)
printf("%lld\n",q[i].ans);
return 0;
}
Kruskal