题目链接:点击这里
题目大意:
有一张
n
n
n 个点,
m
m
m 条边的图,每条边连接点
u
i
,
v
i
u_i,v_i
ui,vi ,边权为
w
i
w_i
wi ,现要进行
q
q
q 次如下两种操作种的一种:
- 修改第 x x x 条边为连接点 y , z y,z y,z ,边权为 t t t;
- 查询只用 [ l , r ] [l,r] [l,r] 范围内的边,得到的最小生成树的权值为多少,如果无解输出 I m p o s s i b i l e Impossibile Impossibile ,有解输出最小生成树权值和
题目分析:
观察此题的数据范围
n
≤
200
,
m
≤
30000
,
q
≤
30000
n\le 200,m\le30000,q\le30000
n≤200,m≤30000,q≤30000 ,发现这张图的点数很小,可以从此处入手
因为是带修的区间查询问题,所以容易想到可以用线段树来维护信息
我们开一颗线段树,每个节点维护当前节点覆盖的区间范围内的最小生成树由哪些边构成,将这些边的编号存下来,因为
n
≤
200
n\le200
n≤200 所以每个节点开一个小数组存编号即可
接下来便考虑如何维护线段树的区间合并:
当我们要合并两个区间时,可以使用类似于归并排序合并区间的方法,用两个指针扫左右儿子维护的那些边,每次从左右区间选一个小的边加进来,进而保证了当前节点加边是按照边权递增的单调性加边,合并的时间复杂度为
O
(
n
)
O(n)
O(n)
总时间复杂度为
O
(
q
n
l
o
g
m
)
O(qnlogm)
O(qnlogm)
具体细节见代码:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#include<set>
#include<map>
#define ll long long
#define inf 0x3f3f3f3f
#define Inf 0x3f3f3f3f3f3f3f3f
//#define int ll
using namespace std;
int read()
{
int res = 0,flag = 1;
char ch = getchar();
while(ch<'0' || ch>'9')
{
if(ch == '-') flag = -1;
ch = getchar();
}
while(ch>='0' && ch<='9')
{
res = (res<<3)+(res<<1)+(ch^48);//res*10+ch-'0';
ch = getchar();
}
return res*flag;
}
const int maxn = 205;
const int maxm = 3e4+5;
const int mod = 3;
const double pi = acos(-1);
const double eps = 1e-8;
int n,m,q,fa[maxn],tmp[maxn],ans[maxn];
int find(int u)
{
return fa[u]==u ? u : fa[u] = find(fa[u]);
}
struct Edge{
int from,to,val;
}edge[maxm];
struct Sgt{
int id[maxn];
}a[maxm<<2];
void pushup(int root)
{
int l = root<<1,r = root<<1|1;
for(int i = 1;i <= n;i++) fa[i] = i;
for(int i = 1;i <= n;i++) a[root].id[i] = 0;
int p = 1,q = 1;
for(int i = 1;i < n;)
{
int pos1 = a[l].id[p],pos2 = a[r].id[q];
if(!pos1 && !pos2) break;
if(!pos1 || (pos2 && edge[pos1].val >= edge[pos2].val))
{
int fax = find(edge[pos2].from),fay = find(edge[pos2].to);
if(fax != fay)
{
a[root].id[i] = pos2;
fa[fax] = fay;
i++;
}
q++;
}
else {
int fax = find(edge[pos1].from),fay = find(edge[pos1].to);
if(fax != fay)
{
a[root].id[i] = pos1;
fa[fax] = fay;
i++;
}
p++;
}
}
}
void solve(int root)
{
for(int i = 1;i <= n;i++) fa[i] = i;
for(int i = 1;i <= n;i++) tmp[i] = 0;
int p = 1,q = 1;
for(int i = 1;i < n;)
{
int pos1 = a[root].id[p],pos2 = ans[q];
if(!pos1 && !pos2) break;
if(!pos1 || (pos2 && edge[pos1].val >= edge[pos2].val))
{
int fax = find(edge[pos2].from),fay = find(edge[pos2].to);
if(fax != fay)
{
tmp[i] = pos2;
fa[fax] = fay;
i++;
}
q++;
}
else {
int fax = find(edge[pos1].from),fay = find(edge[pos1].to);
if(fax != fay)
{
tmp[i] = pos1;
fa[fax] = fay;
i++;
}
p++;
}
}
for(int i = 1;i <= n;i++) ans[i] = tmp[i];
}
void build(int root,int l,int r)
{
if(l == r)
{
a[root].id[1] = l;
return ;
}
int mid = l+r>>1;
build(root<<1,l,mid);
build(root<<1|1,mid+1,r);
pushup(root);
}
void updat(int root,int l,int r,int pos)
{
if(l == r) return ;
int mid = l+r>>1;
if(pos <= mid) updat(root<<1,l,mid,pos);
else updat(root<<1|1,mid+1,r,pos);
pushup(root);
}
void query(int root,int l,int r,int ql,int qr)
{
if(l>=ql && r<=qr)
{
solve(root);
return ;
}
int mid = l+r>>1;
if(ql <= mid) query(root<<1,l,mid,ql,qr);
if(qr > mid) query(root<<1|1,mid+1,r,ql,qr);
}
signed main()
{
n = read(),m = read(),q = read();
for(int i = 1;i <= m;i++) edge[i].from = read(),edge[i].to = read(),edge[i].val = read();
build(1,1,m);
// for(int i = 1;i <= 10;i++) printf("%d : %d\n",i,a[i].id[1]);
while(q--)
{
int opt = read();
if(opt == 1)
{
int pos = read();
edge[pos].from = read(),edge[pos].to = read(),edge[pos].val = read();
updat(1,1,m,pos);
}
else {
int l = read(),r = read();
for(int i = 1;i <= n;i++) ans[i] = 0;
query(1,1,m,l,r);
if(!ans[n-1]) puts("Impossible");
else {
ll sum = 0;
for(int i = 1;i < n;i++) sum += edge[ans[i]].val;
printf("%lld\n",sum);
}
}
}
return 0;
}