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
| #include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <vector>
#define ll long long
using namespace std;
const int N = 5e5 + 5;
int size[N], fa[N], deep[N], son[N];
int top[N], dfn[N], rdfn[N];
int cnt, a[N];
char ch[5];
int n, m, q;
vector <int> V[N];
void dfs1(int u, int pre){
son[u] = 0;
size[u] = 1;
fa[u] = pre;
deep[u] = deep[pre] + 1;
for(int i = 0; i < V[u].size(); i++){
int v = V[u][i];
if(v == pre) continue;
dfs1(v, u);
size[u] += size[v];
if(size[v] > size[son[u]]){
son[u] = v;
}
}
}
void dfs2(int u, int t){
top[u] = t;
dfn[u] = ++cnt;
rdfn[cnt] = u;
if(son[u]) dfs2(son[u], t);
for(int i = 0; i < V[u].size(); i++){
int v = V[u][i];
if(v != son[u] && v != fa[u]){
dfs2(v, v);
}
}
}
struct node{
int l, r;
ll sum, add;
}tree[N * 4];
void pushup(int x){
tree[x].sum = tree[x * 2].sum + tree[x * 2 + 1].sum ;
}
void pushdown(int x){
if(tree[x].add){
tree[x * 2].sum += tree[x].add * (tree[x * 2].r - tree[x * 2].l + 1);
tree[x * 2 + 1].sum += tree[x].add * (tree[x * 2 + 1].r - tree[x * 2 + 1].l + 1);
tree[x * 2].add += tree[x].add;
tree[x * 2 + 1].add += tree[x].add;
tree[x].add = 0;
}
}
void build(int x, int l, int r){
tree[x].l = l, tree[x].r = r, tree[x].add = 0;
if(l == r) {
tree[x].sum = a[rdfn[l]];
return;
}
int mid = (l + r) / 2;
build(x * 2, l, mid);
build(x * 2 + 1, mid + 1, r);
pushup(x);
}
void add(int x, int l, int r, int c){
if(l <= tree[x].l && r >= tree[x].r){
tree[x].sum += c * (tree[x].r - tree[x].l + 1);
tree[x].add += c;
return;
}
pushdown(x);
int mid = (tree[x].l + tree[x].r) / 2;
if(l <= mid) add(x * 2, l, r, c);
if(r > mid) add(x * 2 + 1, l, r, c);
pushup(x);
}
ll ask(int x, int l, int r){
if(l <= tree[x].l && r >= tree[x].r) return tree[x].sum;
pushdown(x);
int mid = (tree[x].l + tree[x].r) / 2;
ll v = 0;
if(l <= mid) v += ask(x * 2, l, r);
if(r > mid) v += ask(x * 2 + 1, l, r);
return v;
}
void change(int x, int y, int c){
while(top[x] != top[y]){
if(deep[top[x]] < deep[top[y]]){
swap(x, y);
}
add(1, dfn[top[x]], dfn[x], c);
x = fa[top[x]];
}
if(deep[x] > deep[y]) swap(x, y);
add(1, dfn[x], dfn[y], c);
}
ll queryAns(int x, int y){
ll ans = 0;
while(top[x] != top[y]){
if(deep[top[x]] < deep[top[y]]){
swap(x, y);
}
ans += ask(1, dfn[top[x]], dfn[x]);
x = fa[top[x]];
}
if(deep[x] > deep[y]) swap(x, y);
ans += ask(1, dfn[x], dfn[y]);
return ans;
}
int main(){
while(~scanf("%d%d%d", &n, &m, &q)){
cnt = 0;
for(int i = 1; i <= n; i++) scanf("%d", &a[i]);
for(int i = 0; i <= n; i++) V[i].clear();
while(m--){
int x, y;
scanf("%d%d", &x, &y);
V[x].push_back(y), V[y].push_back(x);
}
dfs1(1, 0); dfs2(1, 1);
build(1, 1, n);
while(q--){
scanf("%s", ch);
if(ch[0] == 'I') {
int l, r, c;
scanf("%d%d%d", &l, &r, &c);
change(l, r, c);
}
else if(ch[0] == 'D') {
int l, r, c;
scanf("%d%d%d", &l, &r, &c);
change(l, r, -c);
}
else{
int x;
scanf("%d", &x);
printf("%lld\n", queryAns(x, x));
}
}
}
return 0;
}
|
