# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
878441 | borisAngelov | Sprinkler (JOI22_sprinkler) | C++17 | 4041 ms | 25248 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int maxn = 200005;
int n, q;
long long mod;
vector<int> g[maxn];
long long height[maxn];
void dfs(int node, int par, int dep, long long mult)
{
height[node] = (height[node] * mult) % mod;
for (int i = 0; i < g[node].size(); ++i)
{
if (g[node][i] != par && dep >= 1)
{
dfs(g[node][i], node, dep - 1, mult);
}
}
}
void fastIO()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
int main()
{
fastIO();
cin >> n >> mod;
for (int i = 1; i <= n - 1; ++i)
{
int x, y;
cin >> x >> y;
g[x].push_back(y);
g[y].push_back(x);
}
for (int i = 1; i <= n; ++i)
{
cin >> height[i];
}
cin >> q;
for (int i = 1; i <= q; ++i)
{
int type;
cin >> type;
if (type == 1)
{
int node, dist, mult;
cin >> node >> dist >> mult;
dfs(node, node, dist, mult);
}
else
{
int node;
cin >> node;
cout << height[node] << "\n";
}
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |