Submission #1069696

#	Time	Username	Problem	Language	Result	Execution time	Memory
1069696		vjudge1	Petrol stations (CEOI24_stations)	C++17	18 / 100	3558 ms	11608 KiB

Main

#include <bits/stdc++.h>
#define int long long

using namespace std;

const int MAX_N = 70000;

int ans[MAX_N];
vector<vector<pair<int,int>>>adjL(MAX_N);
int k, n;
vector<bool>visited;

int dfs(int pos, int fuel) {
    visited[pos] = 1;
    int tmp = 1;
    for(pair<int,int>p: adjL[pos]) {
        if(visited[p.first]) continue;
        if(fuel < p.second) {
            int X = dfs(p.first, k - p.second);
            ans[pos] += X;
            tmp += X;
        } else tmp += dfs(p.first, fuel - p.second);
    }
    return tmp;
}

void solve() {
    cin >> n >> k;
    for(int i=0; i<n-1; ++i) {
        int u, v, w;
        cin >> u >> v >> w;
        adjL[u].push_back({v, w});
        adjL[v].push_back({u, w});
    }
    for(int i=0; i<n; ++i) {
        visited.assign(n, 0);
        dfs(i, k);
    }
    for(int i=0; i<n; ++i) cout << ans[i] << endl;
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);

    int t = 1;
    while(t--) solve();
}

• 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