oj.uz

답안 #792129

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
792129 2023-07-24T15:40:37 Z winter0101 Sprinkler (JOI22_sprinkler) C++14
0 / 100
 1 ms 596 KB 
#include<bits/stdc++.h>
using namespace std;
#define all(fl) fl.begin(),fl.end()
#define pb push_back
#define fi first
#define se second
#define for1(i,j,k) for(int i=j;i<=k;i++)
#define for2(i,j,k) for(int i=j;i>=k;i--)
#define for3(i,j,k,l) for(int i=j;i<=k;i+=l)
#define lb lower_bound
#define ub upper_bound
#define sz(a) (int)a.size()
#define pii pair<int,int>
#define pli pair<long long,int>
#define gcd __gcd
#define lcm(x,y) x*y/__gcd(x,y)
#define pil pair<int,long long>
#define pll pair<long long,long long>
long long h[101];
int d[101][101];
signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    //freopen("temp.INP","r",stdin);
    //freopen("temp.ANS","w",stdout);
    int n,l;
    cin>>n>>l;
    for1(i,1,n){
    for1(j,1,n){
    d[i][j]=n+1;
    }
    d[i][i]=0;
    }
    for1(i,2,n){
    int u,v;
    cin>>u>>v;
    d[u][v]=1;
    d[v][u]=1;
    }
    for1(k,1,n){
    for1(i,1,n){
    for1(j,1,n){
    d[i][j]=min(d[i][j],d[i][k]+d[k][j]);
    }
    }
    }
    for1(i,1,n)cin>>h[i];
    int q;
    cin>>q;
    for1(i,1,q){
    int t;
    cin>>t;
    if (t==2){
        int x;
        cin>>x;
        cout<<h[x]<<'\n';
    }
    else {
        int x,dis;
        long long w;
        cin>>x>>dis>>w;
        for1(i,1,n){
        if (d[x][i]<=dis){
            h[i]=(h[i]*w)%l;
        }
        }
    }
    }
}

Subtask #1
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Runtime error 1 ms 468 KB Execution killed with signal 11
5 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Runtime error 1 ms 468 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #3
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Runtime error 1 ms 468 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Runtime error 1 ms 588 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Runtime error 1 ms 596 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Runtime error 1 ms 468 KB Execution killed with signal 11
5 Halted 0 ms 0 KB -