Submission #1170822

#	Time	Username	Problem	Language	Result	Execution time	Memory
1170822		blackscreen1	Petrol stations (CEOI24_stations)	C++20	18 / 100	3594 ms	12296 KiB

Main

#include <bits//stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<long long, null_type, less<long long>, rb_tree_tag,
             tree_order_statistics_node_update>
    ordered_set;
typedef tree<long long, null_type, less_equal<long long>, rb_tree_tag,
             tree_order_statistics_node_update>
    ordered_multiset;
#define ll long long
#define ld long double
#define iloop(m, h) for (ll i = m; i != h; i += (m < h ? 1 : -1))
#define jloop(m, h) for (auto j = m; j != h; j += (m < h ? 1 : -1))
#define kloop(m, h) for (auto k = m; k != h; k += (m < h ? 1 : -1))
#define lloop(m, h) for (auto l = m; l != h; l += (m < h ? 1 : -1))
#define iloop_(m, h, g) for (auto i = m; i < h; i += g)
#define jloop_(m, h, g) for (auto j = m; j < h; j += g)
#define kloop_(m, h, g) for (auto k = m; k < h; k += g)
#define lloop_(m, h, g) for (auto l = m; l < h; l += g)
#define getchar_unlocked _getchar_nolock // comment before submission
#define pll pair<ll, ll>
#define plll pair<ll, pll>
#define pllll pair<pll, pll>
#define vll vector<ll>
#define qll queue<ll>
#define dll deque<ll>
#define pqll priority_queue<ll>
#define gll greater<ll>
#define INF 100000000000000
#define MOD1 1000000007
#define MOD2 998244353
#define MOD3 1000000009
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
ll n, m, cans[70005], sts[70005];
vector<pll> adj[70005];
void dfs(ll nd, ll pr, ll cap) {
	sts[nd] = 1;
	for (auto it : adj[nd]) if (it.second != pr) {
		if (it.first > cap) {
			dfs(it.second, nd, m - it.first);
			cans[nd] += sts[it.second];
		}
		else dfs(it.second, nd, cap - it.first);
		sts[nd] += sts[it.second];
	}
}
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin >> n >> m;
	ll t1, t2, t3;
	iloop(1, n) {
		cin >> t1 >> t2 >> t3;
		adj[t1].push_back({t3, t2});
		adj[t2].push_back({t3, t1});
	}
	iloop(0, n) dfs(i, -1, m);
	iloop(0, n) cout << cans[i] << "\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