# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
785595 | andecaandeci | Sprinkler (JOI22_sprinkler) | C++17 | 791 ms | 17304 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>
#define sherina ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define pb push_back
#define int long long
#define INF 1e18
#define endl '\n'
using namespace std;
int n , l , a , b , h[200005] , q , t , x , d , w, dist[20005];
vector < int > adj[200005];
bool vis[200005];
vector <int > v;
void bfs(int s){
vis[s] = true;
queue < int > q;
q.push(s);
while(!q.empty()){
int u = q.front(); q.pop();
v.pb(u);
for(int j = 0 ; j < adj[u].size() ; j++){
int i = adj[u][j];
if(vis[i]) continue;
if(dist[u] == d) continue;
dist[i] = dist[u] + 1;
vis[i] = true;
q.push(i);
}
}
}
signed main(){
cin >> n >> l;
for(int i = 1 ; i < n ; i++){
cin >> a >> b;
adj[a].pb(b);
adj[b].pb(a);
}
for(int i = 1 ; i <= n ; i++) cin >> h[i];
cin >> q;
while(q--){
cin >> t;
if(t == 1){
cin >> x >> d >> w;
h[x] = (h[x] * w) % l;
for(int i : adj[x]){
h[i] = (h[i] * w) % l;
}
}
else{
cin >> x;
cout << h[x] << endl;
}
}
}
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... |