一.题目链接:
Cupcake Bonuses
二.题目大意:
初始有一个员工,有四种操作:
1 i:给第 i 员工一个员工.
2 i m:把第 i 号员工的工资系数置为 m.
3 i b:给第 i 号员工及其所有下属基金为 b 的工资,每个人的实际所获工资等于 基金b * 这个人的工资系数.
4 i:查询第 i 号员工当前已获得的实际工资.
三.分析:
这题直接暴力即可.(比赛时看到第一反应是dfs序上线段树,给队友演了俩小时假题,最后还没A...
暴力做法就不写了,把线段树做法放在下面.
比赛时间接性失智,理了好久才理清.
四.代码实现:
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int M = (int)1e5;
const int inf = 0x3f3f3f3f;
const ll mod = (ll)1e9 + 7;
int n, S;
struct qnode
{
int a, b, c;
}query[M + 5];
int num, cnt;
vector <int> son[M + 5];
int st[M + 5], en[M + 5];
struct tnode
{
int l, r; ll lzb;
}tree[M * 4 + 5];
ll m[M + 5], s[M + 5];
void dfs(int u)
{
++cnt;
st[u] = cnt;
for(auto x: son[u]) dfs(x);
en[u] = cnt;
}
inline int lc(int k) {return k<<1;}
inline int rc(int k) {return k<<1|1;}
void push_down(int k)
{
if(!tree[k].lzb) return;
if(tree[lc(k)].l == tree[lc(k)].r) s[tree[lc(k)].l] += tree[k].lzb * m[tree[lc(k)].l];
else tree[lc(k)].lzb += tree[k].lzb;
if(tree[rc(k)].l == tree[rc(k)].r) s[tree[rc(k)].l] += tree[k].lzb * m[tree[rc(k)].l];
else tree[rc(k)].lzb += tree[k].lzb;
tree[k].lzb = 0;
}
void Build(int k, int l, int r)
{
tree[k].l = l, tree[k].r = r;
if(l == r) return;
int mid = (l + r) >> 1;
Build(lc(k), l, mid);
Build(rc(k), mid + 1, r);
}
void Update1(int k, int a, int b)
{
if(tree[k].l == tree[k].r) {m[tree[k].l] = b; return;}
push_down(k);
int mid = (tree[k].l + tree[k].r) >> 1;
if(a <= mid) Update1(lc(k), a, b);
else Update1(rc(k), a, b);
}
void Update2(int k, int a, int b, int c)
{
if(tree[k].l >= a && tree[k].r <= b)
{
if(tree[k].l == tree[k].r) s[tree[k].l] += m[tree[k].l] * c;
else tree[k].lzb += c;
return;
}
push_down(k);
int mid = (tree[k].l + tree[k].r) >> 1;
if(a <= mid) Update2(lc(k), a, b, c);
if(mid < b) Update2(rc(k), a, b, c);
}
ll Query(int k, int a)
{
if(tree[k].l == tree[k].r) return s[tree[k].l];
push_down(k);
int mid = (tree[k].l + tree[k].r) >> 1;
if(a <= mid) Query(lc(k), a);
else Query(rc(k), a);
}
int main()
{
scanf("%d %d", &n, &S);
num = 1;
for(int i = 1; i <= n; ++i)
{
scanf("%d %d", &query[i].a, &query[i].b);
if(query[i].a == 2 ||query[i].a == 3) scanf("%d", &query[i].c);
if(query[i].a == 1) son[query[i].b].push_back(++num), query[i].b = num;
}
dfs(1); Build(1, 1, cnt);
Update1(1, st[1], S);
for(int i = 1; i <= n; ++i)
{
if(query[i].a == 1) Update1(1, st[query[i].b], S);
else if(query[i].a == 2) Update1(1, st[query[i].b], query[i].c);
else if(query[i].a == 3) Update2(1, st[query[i].b], en[query[i].b], query[i].c);
else if(query[i].a == 4) printf("%lld\n", Query(1, st[query[i].b]));
}
return 0;
}