1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
| #include<stdio.h>
#include<string.h>
#include<algorithm>
#define N 50005
using namespace std;
struct node
{
int u,v,next;
} edge[N<<2];
int pre[N],cnt;
int son[N],dep[N],siz[N];
int tid[N],id,top[N],fa[N];
int n,m,p;
int num[N],add[N<<2];
int scan()
{
int res = 0, ch, flag = 0;
if((ch = getchar()) == '-')
flag = 1;
else if(ch >= '0' && ch <= '9')
res = ch - '0';
while((ch = getchar()) >= '0' && ch <= '9' )
res = res * 10 + ch - '0';
return flag ? -res : res;
}
void init()
{
cnt = id = 0;
memset(pre, -1, sizeof(pre));
memset(siz, 0, sizeof(siz));
memset(add, 0, sizeof(add));
memset(son, 0, sizeof(son));
}
void addEdge(int u, int v)
{
edge[cnt].u = u;
edge[cnt].v = v;
edge[cnt].next = pre[u];
pre[u] = cnt++;
}
void dfs1(int u, int f, int dp)
{
dep[u] = dp;
fa[u] = f;
son[u] = 0;
siz[u] = 1;
for(int i = pre[u]; ~i; i=edge[i].next)
{
int v = edge[i].v;
if(v != f)
{
dfs1(v, u, dp+1);
siz[u] += siz[v];
if(siz[v] > siz[son[u]])
son[u] = v;
}
}
}
void dfs2(int u, int tp)
{
tid[u] = ++id;
top[u] = tp;
if(son[u])
dfs2(son[u], tp);
for(int i = pre[u]; ~i; i=edge[i].next)
{
int v = edge[i].v;
if(v != fa[u] && v != son[u])
dfs2(v, v);
}
}
void update(int rt, int l, int r, int ql, int qr, int v)
{
if(ql <= l && r <= qr)
{
add[rt] += v;
return ;
}
int mid = (l + r) >> 1;
if(add[rt])
{
add[rt<<1] += add[rt];
add[rt<<1|1] += add[rt];
add[rt] = 0;
}
if(ql <= mid)
update(rt<<1, l, mid, ql, qr, v);
if(qr > mid)
update(rt<<1|1, mid+1, r, ql, qr, v);
}
int query(int rt, int l, int r, int pos)
{
if(l == r && l == pos)
return add[rt];
int mid = (l + r) >> 1;
if(add[rt])
{
add[rt<<1] += add[rt];
add[rt<<1|1] += add[rt];
add[rt] = 0;
}
if(pos <= mid)
return query(rt<<1, l, mid, pos);
return query(rt<<1|1, mid+1, r, pos);
}
void LCA(int u, int v, int k)
{
while(top[u] != top[v])
{
if(dep[top[u]] < dep[top[v]])
swap(u, v);
update(1, 1, n, tid[top[u]], tid[u], k);
u = fa[top[u]];
}
if(dep[u] > dep[v])
swap(u, v);
update(1, 1, n, tid[u], tid[v], k);
}
int main()
{
while(~scanf("%d%d%d", &n,&m,&p))
{
for(int i = 1; i <= n; ++i)
num[i] = scan();
init();
while(m--)
{
int u = scan();
int v = scan();
addEdge(u, v);
addEdge(v, u);
}
dfs1(1, 1, 1);
dfs2(1, 1);
while(p--)
{
char op[10];
int c1,c2,k;
scanf("%s", op);
if(op[0] == 'I')
{
scanf("%d%d%d", &c1,&c2,&k);
LCA(c1, c2, k);
}
else if(op[0] == 'D')
{
scanf("%d%d%d", &c1,&c2,&k);
LCA(c1, c2, -k);
}
else
{
scanf("%d", &c1);
printf("%d\n", num[c1] + query(1, 1, n, tid[c1]));
}
}
}
return 0;
}
|
