Submission #1170833

#	Time	Username	Problem	Language	Result	Execution time	Memory
1170833		PlayVoltz	Petrol stations (CEOI24_stations)	C++20	18 / 100	3593 ms	12288 KiB

Main

#include <cstdio>
#include <stdio.h>
#include <stdbool.h>
#include <iostream>
#include <map>
#include <vector>
#include <climits>
#include <stack>
#include <string>
#include <queue>
#include <algorithm>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <cmath>
#include <cctype>
#include <bitset>
#include <iomanip>
#include <cstring>
#include <numeric>
#include <cassert>
using namespace std;

#define int long long
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second

int kk;
vector<int> ans, sz;
vector<vector<pii> > graph;

void dfs(int node, int par, int k){
	for (auto num:graph[node])if (num.fi!=par){
		if (k<num.se)ans[node]+=sz[num.fi], dfs(num.fi, node, kk-num.se);
		else dfs(num.fi, node, k-num.se);
	}
}

void dfs1(int node, int par){
	sz[node]=1;
	for (auto num:graph[node])if (num.fi!=par)dfs1(num.fi, node), sz[node]+=sz[num.fi];
}

int32_t main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n, a, b, c;
	cin>>n>>kk;
	graph.resize(n);
	ans.resize(n, 0);
	for (int i=1; i<n; ++i){
		cin>>a>>b>>c;
		graph[a].pb(mp(b, c));
		graph[b].pb(mp(a, c));
	}
	for (int i=0; i<n; ++i)sz.assign(n, 0), dfs1(i, -1), dfs(i, -1, kk);
	for (auto a:ans)cout<<a<<"\n";
}

• 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