1180: [CROATIAN2009]OTOCI
Time Limit: 50 Sec Memory Limit: 162 MB[ Submit][ Status][ Discuss]
Description
给出n个结点以及每个点初始时对应的权值wi。起始时点与点之间没有连边。有3类操作: 1、bridge A B:询问结点A与结点B是否连通。如果是则输出“no”。否则输出“yes”,并且在结点A和结点B之间连一条无向边。 2、penguins A X:将结点A对应的权值wA修改为X。 3、excursion A B:如果结点A和结点B不连通,则输出“impossible”。否则输出结点A到结点B的路径上的点对应的权值的和。给出q个操作,要求在线处理所有操作。数据范围:1<=n<=30000, 1<=q<=300000, 0<=wi<=1000。
Input
第一行包含一个整数n(1<=n<=30000),表示节点的数目。第二行包含n个整数,第i个整数表示第i个节点初始时对应的权值。第三行包含一个整数q(1<=n<=300000),表示操作的数目。以下q行,每行包含一个操作,操作的类别见题目描述。任意时刻每个节点对应的权值都是1到1000的整数。
Output
输出所有bridge操作和excursion操作对应的输出,每个一行。
Sample Input
5
4 2 4 5 6
10
excursion 1 1
excursion 1 2
bridge 1 2
excursion 1 2
bridge 3 4
bridge 3 5
excursion 4 5
bridge 1 3
excursion 2 4
excursion 2 5
4 2 4 5 6
10
excursion 1 1
excursion 1 2
bridge 1 2
excursion 1 2
bridge 3 4
bridge 3 5
excursion 4 5
bridge 1 3
excursion 2 4
excursion 2 5
Sample Output
4
impossible
yes
6
yes
yes
15
yes
15
16
impossible
yes
6
yes
yes
15
yes
15
16
HINT
Source
随便写一下就过了,我怎么LCT全A 的裸题啊
#include<iostream>
#include<cstdio>
using namespace std;
const int N = 300000 + 5;
int mx[N],v[N],sum[N],fa[N],c[N][2],sta[N],top,n,q;
bool rev[N]; char ch[15];
bool isroot( int x ){ return c[fa[x]][1]!=x&&c[fa[x]][0]!=x; }
void update( int x ){
sum[x] = sum[c[x][0]] + sum[c[x][1]] + v[x];
}
void pushdown( int x ){
if( rev[x] ){
swap(c[x][0],c[x][1]);
rev[c[x][0]] ^= 1; rev[c[x][1]] ^= 1; rev[x] = 0;
}
}
void rotate( int x ){
int y = fa[x], z = fa[y], l, r;
l = (c[y][1]==x); r = l^1;
if( !isroot(y) ) c[z][y==c[z][1]] = x;
fa[x] = z; fa[y] = x; fa[c[x][r]] = y;
c[y][l] = c[x][r]; c[x][r] = y;
update(y); update(x);
}
void splay( int x ){
sta[++top] = x;
for( int i = x; !isroot(i); i = fa[i] ) sta[++top] = fa[i];
while( top ) pushdown(sta[top--]);
while( !isroot(x) ){
int y = fa[x], z = fa[y];
if( !isroot(y) ){
if( (c[y][0]==x)^(c[z][0]==y) ) rotate(x);
else rotate(y);
}
rotate(x);
}
}
void access( int x ){
for( int t = 0; x; t = x, x = fa[x] ){
splay(x); c[x][1] = t; update(x);
}
}
void move_to_root( int x ){
access(x); splay(x); rev[x] ^= 1;
}
void link( int x, int y ){
move_to_root(x); fa[x] = y;
}
void cut( int x, int y ){
move_to_root(x); access(y); splay(y); fa[x] = c[y][0] = 0;
}
int find( int x ){
access(x); splay(x);
while( c[x][0] ) x = c[x][0];
return x;
}
int main(){
scanf("%d", &n);
for( int i = 1; i <= n; i++ ) scanf("%d",&v[i]), sum[i] = v[i];
scanf("%d", &q);
while( q-- ){
int x,y;
scanf("%s", ch); scanf("%d%d", &x, &y);
if( ch[0] == 'b' ){
if( find(x) == find(y) ) puts("no");
else puts("yes"),link(x,y);
} if( ch[0] == 'p' ){
move_to_root(x); v[x] = y; update(x);
} if(ch[0]=='e'){
if( find(x) != find(y) ) puts("impossible");
else {
move_to_root(x);access(y);splay(y);
printf("%d\n",sum[y]);
}
}
}
return 0;
}