晚上睡不着,国庆节似乎跟我想象中的不太一样
起来写两道题吧
希望以后,生活可以善待我吧
传送门
题意
分析
思路比较简单,求每一个节点到根节点的路径上,小于
x
x
x的前缀和最大值
因为权值全部大于0,所以该路径上的前缀和满足单调递增的性质,很显然,我们可以用二分来处理这个问题
那树上怎么办呢?做一下树上倍增就可以啦,每次找到不满足条件的节点就往上跳
代码
#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 2e5 + 10,M =N * 2;
const ll mod = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
int h[N],e[M],ne[M],vla[M],vlb[M],idx;
int f[N][21],d[N];
ll suma[N],sumb[N];
int ans[N];
int n;
void add(int x,int y,ll va,ll vb) {
ne[idx] = h[x],e[idx] = y,vla[idx] =va,vlb[idx] = vb,h[x] = idx++;
}
void check(int u) {
int x = u;
if (sumb[u] <= suma[u]) {
ans[u] = u;
return;
}
for (int i = 20;~i;i--) {
if (sumb[f[u][i]] > suma[x]) u = f[u][i];
}
ans[x] = f[u][0];
}
void dfs(int u) {
for (int i = h[u];~i;i = ne[i]) {
int j = e[i];
d[j] = d[u] + 1;
suma[j] = suma[u] + vla[i];
sumb[j] = sumb[u] + vlb[i];
f[j][0] = u;
for(int k = 1;k <= 20;k++)
f[j][k] = f[f[j][k - 1]][k - 1];
check(j);
dfs(j);
}
}
int main() {
int T;
read(T);
while(T--) {
read(n);
int x,y;
ll va,vb;
memset(h,-1,sizeof h);
idx = 0;
for (int i = 2;i <= n;i++) {
read(y),read(va),read(vb);
add(y,i,va,vb);
}
dfs(1);
for (int i = 2;i <= n;i++) printf("%d ",d[ans[i]]);
puts("");
}
return 0;
}