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
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
| #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 50009;
class SegmentTree
{
#define lc rt << 1
#define rc rt << 1 | 1
#define mid ((l + r) >> 1)
public:
void build(int l, int r, int rt)
{
t[rt].val = t[rt].lzy = 0;
if(l >= r)
return;
build(l, mid, lc);
build(mid + 1, r, rc);
}
void push_down(int rt, int l, int r)
{
t[lc].lzy += t[rt].lzy;
t[rc].lzy += t[rt].lzy;
t[lc].val += (mid - l + 1) * t[rt].lzy;
t[rc].val += (r - mid) * t[rt].lzy;
t[rt].lzy = 0;
}
void push_up(int rt)
{
t[rt].val = t[lc].val + t[rc].val;
}
void update(int l, int r, int rt, int L, int R, int v)
{
if(r < L || l > R || l > r || L > R)
return;
if(L <= l && r <= R)
{
t[rt].lzy += v;
t[rt].val += v * (r - l + 1);
return;
}
push_down(rt, l, r);
update(l, mid, lc, L, R, v);
update(mid + 1, r, rc, L, R, v);
push_up(rt);
}
int query(int l, int r, int rt, int L, int R)
{
if(r < L || l > R || l > r || L > R)
return 0;
if(L <= l && r <= R)
return t[rt].val;
push_down(rt, l, r);
int lval = query(l, mid, lc, L, R);
int rval = query(mid + 1, r, rc, L, R);
push_up(rt);
return lval + rval;
}
private:
struct Node
{
Node() {}
Node(int val, int lzy) : val(val), lzy(lzy) {}
int val, lzy;
};
Node t[4 * N];
} t;
int T, n, m, k, a[N];
vector<int> g[N];
int deep[N], son[N], size[N], fa[N];
int top[N], id[N], cnt, sub_t[N];
void init()
{
cnt = 0;
for (int i = 1; i <= n; i++)
g[i].clear(), fa[i] = 0, top[i] = 0, id[i] = 0, sub_t[i] = 0;
}
void dfs1(int x, int dep)
{
deep[x] = dep;
size[x] = 1;
son[x] = 0;
for (auto i : g[x])
{
if(i == fa[x])
continue;
fa[i] = x;
dfs1(i, dep + 1);
size[x] += size[i];
if(size[i] > size[son[x]])
son[x] = i;
}
sub_t[x] = cnt;
return;
}
void dfs2(int x, int tp)
{
id[x] = ++cnt;
top[x] = tp;
if(son[x])
dfs2(son[x], tp);
for (auto i : g[x])
{
if(i == fa[x] || i == son[x])
continue;
dfs2(i, i);
}
}
void update(int x, int y, int z)
{
while (top[x] != top[y])
{
if(deep[top[x]] > deep[top[y]])
swap(x, y);
t.update(1, cnt, 1, id[top[y]], id[y], z);
y = fa[top[y]];
}
if(deep[x] > deep[y])
swap(x, y);
t.update(1, cnt, 1, id[x], id[y], z);
return;
}
int query(int x, int y)
{
int ans = 0;
while (top[x] != top[y])
{
if(deep[top[x]] > deep[top[y]])
swap(x, y);
ans += t.query(1, cnt, 1, id[top[y]], id[y]);
y = fa[top[y]];
}
if(deep[x] > deep[y])
swap(x, y);
ans += t.query(1, cnt, 1, id[x], id[y]);
return ans;
}
int main(int argc, char const *argv[])
{
#ifndef ONLINE_JUDGE
freopen("input.in", "r", stdin);
freopen("output.out", "w", stdout);
#endif
while ((scanf("%d%d%d", &n, &m, &k)) != EOF)
{
init();
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (int i = 1; i <= m; i++)
{
int u, v, w;
scanf("%d%d", &u, &v);
g[u].push_back(v);
g[v].push_back(u);
}
dfs1(1, 1);
dfs2(1, 1);
t.build(1, cnt, 1);
for (int i = 1; i <= n; i++)
t.update(1, cnt, 1, id[i], id[i], a[i]);
for (int i = 1; i <= k; i++)
{
char op[10];
scanf("%s", op);
if(op[0] == 'I')
{
int x, y, z;
scanf("%d%d%d", &x, &y, &z);
update(x, y, z);
}
else if(op[0] == 'D')
{
int x, y, z;
scanf("%d%d%d", &x, &y, &z);
update(x, y, -z);
}
else
{
int x;
scanf("%d", &x);
printf("%d\n", query(x, x));
}
}
}
return 0;
}
|
