Submission #1140757

#	Time	Username	Problem	Language	Result	Execution time	Memory
1140757		Faisal_Saqib	Petrol stations (CEOI24_stations)	C++20	18 / 100	36 ms	840 KiB

Main

#warning Check FastIO
#ifdef ONLINE_JUDGE
    #pragma GCC optimize("Ofast")
    #pragma GCC target("avx,avx2,fma")
#endif
#include <iostream>
#include <algorithm>
#include <climits>
#include <queue>
#include <cmath>
#include <map>
#include <set>
#include <random>
#include <chrono>
#include <iomanip>
#include <vector>
#include <fstream>
using namespace std;
#define vll vector<ll>
#define sll set<ll>
#define vstr vector<string>
#define ll long long
#define ld long double
#define supra main
#define pb push_back
#define add insert
#define rall(x) rbegin(x),rend(x)
#define all(x) (x).begin(),(x).end()
#define I ios_base::sync_with_stdio(false);
#define Hear cin.tie(NULL);
#define Shots cout.tie(NULL);
#define Ratatatata
#define bits_on(a) (__builtin_popcountll(a))
#define mx_pw2(a) (__builtin_ctzll(a))
mt19937 RNG(chrono::steady_clock::now().time_since_epoch().count());  
#define SHUFFLE(v) shuffle(all(v), RNG); 
const ll inf=LLONG_MAX;
void input(vll& a)
{
    for(auto& i:a)
        cin>>i;
}
void pyn(bool a)
{
    cout<<(a?"YES":"NO")<<endl;
}
ll powmod(ll a,ll b,ll modulo)
{
  if(b==0){
    return 1;
  }
  ll temp=powmod(a,b/2,modulo);
  if(b%2==0){
    return (temp*temp)%modulo;
  }
  else{
    return (a*((temp*temp)%modulo))%modulo;
  }
}

bool Prime(ll n){
    for (ll i = 2; i*i <= n; i++)
        if (n % i == 0)
            return false;
    return (n>1);
}
const int N=1e4+10;
ll ans[N];
vector<pair<ll,ll>> ma[N];
ll sz[N];
void dfs_sz(int x,int p=-1)
{
	sz[x]=1;
	for(auto [y,l]:ma[x])
	{
		if(y==p)continue;
		dfs_sz(y,x);
		sz[x]+=sz[y];
	}
}
ll n,k;
void dfs(int x,int p=-1,int d=0)
{
	// cout<<"At "<<x<<' '<<d<<endl;
	for(auto [y,l]:ma[x])
	{
		if(y==p)continue;
		if(d<l)
		{
			// cout<<"Cant go "<<
			ans[x]+=sz[y];
			dfs(y,x,k-l);
		}
		else
		{
			dfs(y,x,d-l);
		}
	}
}
void solve()
{
	cin>>n>>k;
	for(int i=1;i<n;i++)
	{
		ll x,y,l;
		cin>>x>>y>>l;
		x++;
		y++;
		ma[x].pb({y,l});
		ma[y].pb({x,l});
	}
	for(int i=1;i<=n;i++)
	{
		// cout<<endl;
		// cout<<"Starting from "<<i<<endl;
		// cout<<endl;
		dfs_sz(i);
		dfs(i,-1,k);
	}
	for(int i=1;i<=n;i++)
	{
		cout<<ans[i]<<' ';
	}
	cout<<endl;
}
int supra(){
    I Hear Shots Ratatatata
    ll tqwertyuiop=1;
    // cin>>tqwertyuiop;
    for(int tp=1;tp<=tqwertyuiop;tp++)
    {
        // cout<<"Case #"<<tp<<": ";
        solve();
    }
    return 0;
}
/*
Bro use only in a emergency 
this is kind of hacking
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
*/

Compilation message (stderr)

Main.cpp:1:2: warning: #warning Check FastIO [-Wcpp]
    1 | #warning Check FastIO
      |  ^~~~~~~

• Subtask 0: 0 / 0
• Subtask 1: 18 / 18
• Subtask 2: 0 / 8
• Subtask 3: 0 / 10
• Subtask 4: 0 / 12
• Subtask 5: 0 / 17
• Subtask 6: 0 / 35