oj.uz

Submission #892314

# Submission time Handle Problem Language Result Execution time Memory
892314 2023-12-25T07:21:42 Z vjudge1 Sprinkler (JOI22_sprinkler) C++17
3 / 100
 13 ms 6524 KB 
#include <bits/stdc++.h>
#define int long long
#define all(x) x.begin(),x.end()
#define ff first
#define ss second
#define pb push_back
using namespace std;
const int N=1e5+5;
vector <int> g[N];
int h[N];
signed main(){
    int n,l;
    cin>>n>>l;
    for(int i=0;i<n-1;i++){
        int u,v;
        cin>>u>>v;
        g[u].pb(v);
        g[v].pb(u);
    }
    for(int i=1;i<=n;i++){
        cin>>h[i];
    }
    int q;
    cin>>q;
    if(n<=1000 && q<=1000){
        while(q--){
            int type,x,d,w;
            cin>>type;
            if(type==1){
                cin>>x>>d>>w;
                queue <int> q;
                vector <int> dis(n+1,-1);
                q.push(x);
                dis[x]=0;
                while(!q.empty()){
                    int v=q.front();
                    q.pop();
                    for(auto to : g[v]){
                        if(dis[to]==-1){
                            dis[to]=dis[v]+1;
                            q.push(to);
                        }
                    }
                }
                for(int i=1;i<=n;i++){
                    if(dis[i]<=d){
                        h[i]=(h[i]*w)%l;
                    }
                }
            }
            else{
                cin>>x;
                cout<<h[x]<<"\n";
            }
        }
     return 0;
    }
    while(q--){
        int type,x,d,w;
        cin>>type;
        if(type==1){
            cin>>x>>d>>w;
            h[x]*=w;h[x]%=l;
            if(d==1){
                for(auto to : g[x]){
                    h[to]*=w;h[to]%=l;
                }
            }
           
        }
        else{
            cin>>x;
            cout<<h[x]<<"\n";
        }
    }
    
    
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3164 KB Output is correct
2 Correct 1 ms 3164 KB Output is correct
3 Correct 1 ms 3164 KB Output is correct
4 Correct 9 ms 3420 KB Output is correct
5 Correct 10 ms 3420 KB Output is correct
6 Correct 13 ms 3420 KB Output is correct
7 Correct 11 ms 3416 KB Output is correct
8 Correct 9 ms 3420 KB Output is correct
9 Correct 2 ms 3248 KB Output is correct
10 Correct 2 ms 3164 KB Output is correct
11 Correct 2 ms 3164 KB Output is correct
12 Correct 2 ms 3164 KB Output is correct
13 Correct 2 ms 3164 KB Output is correct
14 Correct 2 ms 3164 KB Output is correct
15 Correct 2 ms 3164 KB Output is correct
16 Correct 2 ms 3164 KB Output is correct
17 Correct 2 ms 3164 KB Output is correct
18 Correct 3 ms 3164 KB Output is correct
19 Correct 2 ms 3164 KB Output is correct
20 Correct 2 ms 3164 KB Output is correct
21 Correct 2 ms 3164 KB Output is correct
22 Correct 2 ms 3164 KB Output is correct
23 Correct 3 ms 3412 KB Output is correct
24 Correct 2 ms 3164 KB Output is correct
25 Correct 2 ms 3164 KB Output is correct
26 Correct 2 ms 3164 KB Output is correct
27 Correct 2 ms 3164 KB Output is correct
28 Correct 2 ms 3164 KB Output is correct

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3160 KB Output is correct
2 Runtime error 3 ms 6492 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3160 KB Output is correct
2 Runtime error 3 ms 6492 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3164 KB Output is correct
2 Runtime error 3 ms 6492 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3164 KB Output is correct
2 Runtime error 3 ms 6524 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3164 KB Output is correct
2 Correct 1 ms 3164 KB Output is correct
3 Correct 1 ms 3164 KB Output is correct
4 Correct 9 ms 3420 KB Output is correct
5 Correct 10 ms 3420 KB Output is correct
6 Correct 13 ms 3420 KB Output is correct
7 Correct 11 ms 3416 KB Output is correct
8 Correct 9 ms 3420 KB Output is correct
9 Correct 2 ms 3248 KB Output is correct
10 Correct 2 ms 3164 KB Output is correct
11 Correct 2 ms 3164 KB Output is correct
12 Correct 2 ms 3164 KB Output is correct
13 Correct 2 ms 3164 KB Output is correct
14 Correct 2 ms 3164 KB Output is correct
15 Correct 2 ms 3164 KB Output is correct
16 Correct 2 ms 3164 KB Output is correct
17 Correct 2 ms 3164 KB Output is correct
18 Correct 3 ms 3164 KB Output is correct
19 Correct 2 ms 3164 KB Output is correct
20 Correct 2 ms 3164 KB Output is correct
21 Correct 2 ms 3164 KB Output is correct
22 Correct 2 ms 3164 KB Output is correct
23 Correct 3 ms 3412 KB Output is correct
24 Correct 2 ms 3164 KB Output is correct
25 Correct 2 ms 3164 KB Output is correct
26 Correct 2 ms 3164 KB Output is correct
27 Correct 2 ms 3164 KB Output is correct
28 Correct 2 ms 3164 KB Output is correct
29 Correct 1 ms 3160 KB Output is correct
30 Runtime error 3 ms 6492 KB Execution killed with signal 11
31 Halted 0 ms 0 KB -