Codeforces Round 336 (Div. 1)
D
Power Tree
Codeforces
2600
原题
← CE →
翻译中…

Genos and Saitama went shopping for Christmas trees. However, a different type of tree caught their attention, the exalted Power Tree.

翻译中…

A Power Tree starts out as a single root vertex indexed $1$. A Power Tree grows through a magical phenomenon known as an update. In an update, a single vertex is added to the tree as a child of some other vertex.

翻译中…

Every vertex in the tree (the root and all the added vertices) has some value $*v*_{*i*}$ associated with it. The power of a vertex is defined as the strength of the multiset composed of the value associated with this vertex ($*v*_{*i*}$) and the powers of its direct children. The strength of a multiset is defined as the sum of all elements in the multiset multiplied by the number of elements in it. Or in other words for some multiset $*S*$:

翻译中…

image

翻译中…

Saitama knows the updates that will be performed on the tree, so he decided to test Genos by asking him queries about the tree during its growth cycle.

翻译中…

An update is of the form $1 *p* *v*$, and adds a new vertex with value $*v*$ as a child of vertex $*p*$.

翻译中…

A query is of the form $2 *u*$, and asks for the power of vertex $*u*$.

翻译中…

Please help Genos respond to these queries modulo $10^{9} + 7$.

翻译中…

Input

翻译中…

The first line of the input contains two space separated integers $*v*_{1}$ and $*q*$ ($1 ≤ *v*_{1} < 10^{9}$, $1 ≤ *q* ≤ 200 000$) — the value of vertex $1$ and the total number of updates and queries respectively.

翻译中…

The next $*q*$ lines contain the updates and queries. Each of them has one of the following forms:

翻译中…
  • $1 *p*_{*i*} *v*_{*i*}$, if these line describes an update. The index of the added vertex is equal to the smallest positive integer not yet used as an index in the tree. It is guaranteed that $*p*_{*i*}$ is some already existing vertex and $1 ≤ *v*_{*i*} < 10^{9}$.
  • $2 *u*_{*i*}$, if these line describes a query. It is guaranteed $*u*_{*i*}$ will exist in the tree.
翻译中…

It is guaranteed that the input will contain at least one query.

翻译中…

Output

翻译中…

For each query, print out the power of the given vertex modulo $10^{9} + 7$.

翻译中…

Note

翻译中…

For the first sample case, after all the updates the graph will have vertices labelled in the following manner: 1 — 2 — 3 — 4 — 5

翻译中…

These vertices will have corresponding values: 2 — 3 — 5 — 7 — 11

翻译中…

And corresponding powers: 344 — 170 — 82 — 36 — 11

翻译中…

样例

Input #1
2 5
1 1 3
1 2 5
1 3 7
1 4 11
2 1
Output #1
344
InputCopy OutputCopy
Input #2
5 5
1 1 4
1 2 3
2 2
1 2 7
2 1
Output #2
14
94
InputCopy OutputCopy
题目信息
题号
607D
时间限制
3.5 s
内存限制
256 MB
标签
数据结构
树

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。