Submission #876862

#TimeUsernameProblemLanguageResultExecution timeMemory
876862serkanrashidSprinkler (JOI22_sprinkler)C++14
3 / 100
4070 ms16504 KiB
#include <bits/stdc++.h>
#define endl "\n"

using namespace std;

const int maxn = 2*1e5+5;

long long n,l,q;
long long type,x,d,w;
long long h[maxn];
vector<int>g[maxn];

void dfs(int beg, int par, int rg)
{
    h[beg] = (h[beg]*w)%l;
    if(rg==d) return;
    for(int nb:g[beg])
    {
        if(nb!=par) dfs(nb,beg,rg+1);
    }
}

void read()
{
    cin >> n >> l;
    int a,b;
    for(int i=1;i<n;i++)
    {
        cin >> a >> b;
        g[a].push_back(b);
        g[b].push_back(a);
    }
    for(int i=1;i<=n;i++) cin >> h[i];
    cin >> q;
    for(int i=1;i<=q;i++)
    {
        cin >> type >> x;
        if(type==2) cout << h[x] << endl;
        else
        {
            cin >> d >> w;
            dfs(x,x,0);
        }
    }
}

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	read();
return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...