Submission #1346519

#TimeUsernameProblemLanguageResultExecution timeMemory
1346519MrAndriaPetrol stations (CEOI24_stations)C++20
0 / 100
3592 ms12252 KiB
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define int long long
int n,k,a[1000005],sz[1000005];
vector <pair <int,int> > adj[1000005];

void dfs(int x,int p,int curr){
    sz[x]=1;
    
    for(auto u:adj[x]){
        if(u.ff!=p){
        
            if(curr<u.ss){
                
                dfs(u.ff,x,k-u.ss);
            }else{
                dfs(u.ff,x,curr-u.ss);
            }
            sz[x]+=sz[u.ff];
        }
    }
    for(auto u:adj[x]){
        if(u.ff!=p){
            
            if(curr<u.ss){
                
                a[x]+=sz[x]-1;
            }
        }
    }
}
signed main(){
    cin>>n>>k;
    for(int i=1;i<=n-1;i++){
        int u,v,c;
        cin>>u>>v>>c;
        adj[u].pb(make_pair(v,c));
        adj[v].pb(make_pair(u,c));
        
    }
    for(int i=0;i<=n-1;i++){
        dfs(i,i,k);
    }
    for(int i=0;i<=n-1;i++){
        cout<<a[i]<<"\n";
    }
}
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...