| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1346520 | MrAndria | Petrol stations (CEOI24_stations) | C++20 | 3592 ms | 12252 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);
a[x]+=sz[u.ff];
}else{
dfs(u.ff,x,curr-u.ss);
}
sz[x]+=sz[u.ff];
}
}
}
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 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... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
