#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5 + 12, MOD = (int)1e9 + 7;
int n, m, a[N];
bool vis[N], timer;
vector<int> g[N], gt[N];
vector<vector<int>> dist;
bool zap;
int f(int d) {
vector<int> D(n + 1, 0);
timer = 1;
for(int i = 1; i <= n; i++) {
vis[i] = 0;
}
vis[d] = timer;
int lst = d;
queue<int> q;
q.push(d);
while(!q.empty()) {
int v = q.front();
lst = v;
q.pop();
for(int to : g[v]) {
if(vis[to] != timer) {
D[to] = D[v] + 1;
q.push(to);
vis[to] = timer;
}
}
}
dist.push_back(D);
return lst;
}
int dep[N], mxd[N], res[N], d, d1, o, cr;
void dfs(int v, int pr = -1) {
mxd[v] = dep[v];
for(int to:g[v]) if(to != pr) {
gt[v].push_back(to);
dep[to] = dep[v] + 1;
dfs(to, v);
mxd[v] = max(mxd[v], mxd[to]);
}
for(int i = 0; i < (int)g[v].size(); i++) {
if(g[v][i] == pr) {
swap(g[v][(int)g[v].size() - 1], g[v][i]);
break;
}
}
for(int i = 0; i < (int)g[v].size() - 1; i++) {
if(mxd[gt[v][i]] == mxd[v]) {
swap(gt[v][0], gt[v][i]);
}
}
// for(int i = 0; i < (int))
}
int b = 17, it = 0, cur = 0, ver[N];
int up[N][18];
struct node{
node *l = 0, *r = 0;
int sum = 0;
node(){};
node(int v) {
sum = v;
}
node (node *L, node *R) {
l = L;
r = R;
sum = l->sum + r->sum;
}
};
using pnode = node *;
pnode tr[N];
pnode build(int tl = 1, int tr = m) {
if(tl == tr) {
return new node();
}
int tm = (tl + tr) >> 1;
return new node(build(tl, tm), build(tm + 1, tr));
}
pnode upd(int pos, pnode v, int tl = 1, int tr = m) {
if(tl == tr) {
return new node(1);
}
int tm = (tl + tr) >> 1;
if(pos <= tm)
return new node(upd(pos, v->l, tl, tm), v->r);
return new node(v->l, upd(pos, v->r, tm + 1, tr));
}
int rt;
void go(int v) {
if(dist[cr][v] > dist[o][v] || (dist[cr][v] == dist[o][v] && zap)) {
int f = cur, val = -mxd[v] + dep[v] * 2;
set<int> r;
if(dep[ver[f]] >= val) {
for(int i = b - 1; i >= 0; i--) {
int nv = ver[up[f][i]];
if(dep[nv] >= val) {
f = up[f][i];
}
}
f = up[f][0];
}
res[v] += tr[f]->sum;
}
int sz = (int)g[v].size() - (rt != v), mx1 = dep[v];
if(!sz) return;
for(int i = 1; i < sz; i++) {
mx1 = max(mx1, mxd[g[v][i]]);
}
int bf = cur;
for(int i = 0; i < sz; i++) {
int to = g[v][i];
int mx = dep[v];
if(i) mx = mxd[gt[v][0]];
if(i < sz - 1) mx = max(mx, mx1);
mx -= dep[v];
if(i == 1) {
cur = up[cur][0];
}
if(i <= 1 && dep[v] - dep[ver[cur]] <= mx) {
for(int i = b - 1; i >= 0; i--) {
int nv = up[cur][i];
if(dep[v] - dep[ver[nv]] <= mx) {
cur = nv;
}
}
cur = up[cur][0];
}
if(i <= 1) {
it++;
ver[it] = v;
up[it][0] = cur;
tr[it] = upd(a[v], tr[cur]);
for(int i = 1; i < b; i++) {
up[it][i] = up[up[it][i - 1]][i - 1];
}
cur = it;
}
go(to);
}
cur = bf;
}
void solve(int root) {
it = cur = 0;
for(int i = 1; i <= n; i++) {
gt[i].clear();
}
ver[0] = 0;
dep[0] = -(int)1e9;
tr[0] = build();
rt = root;
dep[root] = 1;
dfs(root);
go(root);
}
void test() {
cin >> n >> m;
for(int i = 1; i <= n - 1; i++) {
int a, b;
cin >> a >> b;
g[a].push_back(b);
g[b].push_back(a);
}
for(int i = 1; i <= n; i++) {
cin >> a[i];
}
d = f(1), d1 = f(d);
f(d1);
o = 2;cr = 1;
solve(d);
zap = 1;
o = 1;cr = 2;
solve(d1);
for(int i = 1; i <= n; i++) {
cout << res[i] << '\n';
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int t = 1;
// cin >> t;
while(t--)
test();
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
3 ms |
16720 KB |
Output is correct |
| 2 |
Incorrect |
6 ms |
18008 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
118 ms |
38772 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
484 ms |
213724 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
3 ms |
16720 KB |
Output is correct |
| 2 |
Incorrect |
6 ms |
18008 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
