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
| #include<cstdio> #include<iostream> #include<vector> #include<cstdlib> #include<map> #include<queue> #include<algorithm> #include<cmath> #include<cstring> #include<string> #include<set> #define lson l,mid,i<<1 #define rson mid+1,r,i<<1|1 using namespace std; typedef long long ll; const int maxn = 200005; const int INF = 2e9; struct node { int s, e, next; }edge[maxn * 2]; int n, m; int son[maxn], top[maxn], tid[maxn], fat[maxn], siz[maxn], dep[maxn], rak[maxn]; int head[maxn], len, dfx;
dep保存i节点的深度(根为1),,tid保存i节点dfs后的新编号,rak保存新编号i对应的节点(rak[i]=j,tid[j]=i)。 void init() { memset(head, -1, sizeof(head)); len = 0, dfx = 0; } void add(int s, int e) { edge[len].s = s; edge[len].e = e; edge[len].next = head[s]; head[s] = len++; }
void dfs1(int x, int fa, int d) { siz[x] = 1, son[x] = -1, fat[x] = fa, dep[x] = d; for (int i = head[x]; i != -1; i = edge[i].next) { int y = edge[i].e; if (y == fa) continue; dfs1(y, x, d + 1); siz[x] += siz[y]; if (son[x] == -1 || siz[y] > siz[son[x]]) son[x] = y; } }
void dfs2(int x, int c) { top[x] = c; tid[x] = ++dfx; rak[dfx] = x; if (son[x] == -1) return; dfs2(son[x], c); for (int i = head[x]; i != -1; i = edge[i].next) { int y = edge[i].e; if (y == fat[x] || y == son[x]) continue; dfs2(y, y); } } int a[maxn]; int cr[maxn * 2]; int rt[maxn * 2]; int lt[maxn * 2]; int lazy[maxn * 2]; void up(int i) { lt[i] = lt[i << 1], rt[i] = rt[i << 1 | 1]; cr[i] = cr[i << 1] + cr[i << 1 | 1]; if (lt[i << 1 | 1] == rt[i << 1]) cr[i]--; } void down(int i) { if (lazy[i] != -1) { lt[i << 1] = lt[i << 1 | 1] = rt[i << 1] = rt[i << 1 | 1] = lazy[i]; cr[i << 1] = cr[i << 1 | 1] = cr[i]; lazy[i << 1] = lazy[i << 1 | 1] = lazy[i]; lazy[i] = -1; } } void build(int l, int r, int i) { lazy[i] = -1; if (l == r) { cr[i] = 1; rt[i] = a[rak[l]]; lt[i] = a[rak[l]]; return; } int mid = (l + r) >> 1; build(lson); build(rson); up(i); } void update(int L, int R, int k, int l, int r, int i) { if (L <= l && r <= R) { cr[i] = 1; lazy[i] = k; lt[i] = rt[i] = k; return; } down(i); int mid = (l + r) >> 1; if (L <= mid) update(L, R, k, lson); if (R > mid) update(L, R, k, rson); up(i); } int qquery(int L, int R, int l, int r, int i) { if (L <= l && r <= R) return cr[i]; down(i); int mid = (l + r) >> 1; if (R <= mid) return qquery(L, R, lson); if (L > mid) return qquery(L, R, rson); int ans1 = qquery(L, R, lson); int ans2 = qquery(L, R, rson); int ans = ans1 + ans2; if (rt[i << 1] == lt[i << 1 | 1]) ans--; return ans; }
int dquery(int k, int l, int r, int i) { if (l == r) { return lt[i]; } int mid = (l + r) / 2; down(i); if (k <= mid) return dquery(k, lson); else return dquery(k, rson); } int solve(int x, int y, int w, int flg) { int ans = 0; while (top[x] != top[y]) { if (dep[top[x]] < dep[top[y]]) swap(x, y); if (!flg) update(tid[top[x]], tid[x], w, 1, n, 1); else { ans += qquery(tid[top[x]], tid[x], 1, n, 1); if (dquery(tid[top[x]], 1, n, 1) == dquery(tid[fat[top[x]]], 1, n, 1)) ans--; } x = fat[top[x]]; } if (dep[x] < dep[y]) swap(x, y); if (!flg) update(tid[y], tid[x], w, 1, n, 1); else { ans += qquery(tid[y], tid[x], 1, n, 1); return ans; } } int main() { while (scanf("%d%d", &n, &m) != EOF) { for (int i = 1; i <= n; i++) scanf("%d", &a[i]); init(); int x, y, z; for (int i = 0; i < n - 1; i++) { scanf("%d%d", &x, &y); add(x, y); add(y, x); } dfs1(1, 0, 1); dfs2(1, 1); build(1, n, 1); while (m--) { char s[10]; scanf("%s", s); if (s[0] == 'C') { scanf("%d%d%d", &x, &y, &z); solve(x, y, z, 0); } else { scanf("%d%d", &x, &y); printf("%d\n", solve(x, y, 0, 1)); } } } }
|