Submission #1159620

#	Time	Username	Problem	Language	Result	Execution time	Memory
1159620		pan	Parkovi (COCI22_parkovi)	C++20	110 / 110	399 ms	32156 KiB

Main

#include <bits/stdc++.h>
//#include "includeall.h"
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define endl '\n'
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define input(x) scanf("%lld", &x);
#define input2(x, y) scanf("%lld%lld", &x, &y);
#define input3(x, y, z) scanf("%lld%lld%lld", &x, &y, &z);
#define input4(x, y, z, a) scanf("%lld%lld%lld%lld", &x, &y, &z, &a);
#define print(x, y) printf("%lld%c", x, y);
#define show(x) cerr << #x << " is " << x << endl;
#define show2(x,y) cerr << #x << " is " << x << " " << #y << " is " << y << endl;
#define show3(x,y,z) cerr << #x << " is " << x << " " << #y << " is " << y << " " << #z << " is " << z << endl;
#define all(x) x.begin(), x.end()
#define discretize(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
#define FOR(i, x, n) for (ll i =x; i<=n; ++i) 
#define RFOR(i, x, n) for (ll i =x; i>=n; --i) 
#pragma GCC optimize("O3","unroll-loops", "unroll-loops,no-stack-protector")
//#pragma GCC target("popcnt")
using namespace std;
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());
//using namespace __gnu_pbds;
//#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
//#define ordered_multiset tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update>
typedef long long ll;
typedef long double ld;
typedef pair<ld, ll> pd;
typedef pair<string, ll> psl;
typedef pair<ll, ll> pi;
typedef pair<ll, pi> pii;
typedef pair<pi, pi> piii;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

ll const INF = 1e18;
ll n, k, maxd;
vector<pi> adj[200005];
ll mark[200005];
ll siz;

pi dfs(ll x = 1, ll p = -1, ll d = INF)
{
	ll dead = 0, have = -INF;
	for (pi u: adj[x]) if (p!=u.f)
	{
		pi ret = dfs(u.f, x, u.s);
		if (ret.f) have = max(have, ret.s);
		else dead = max(dead, ret.s);
	}
	pi res;
	if (have >= dead) res = mp(1, have - d); // have excess
	else if (dead + d > maxd) // must buy
	{
		siz++;
		mark[x] = 1;
		res = mp(1, maxd - d);
	}
	else {res = mp(0, dead + d);} // can defer buying
	if (res.f && res.s < 0) res = mp(0, 0);
	return res;
}

void reset()
{
	siz = 0;
	fill(mark, mark + n + 1, 0);
}

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	cin >> n >> k;
	ll lo =0, hi = 0;
	for (ll i=0; i<n-1; ++i)
	{
		ll a, b, w;
		cin >> a >> b >> w;
		adj[a].pb(mp(b,w));
		adj[b].pb(mp(a,w));
		hi += w;
	}
	while (lo!=hi)
	{
		ll mid = (lo + hi) >> 1;
		maxd = mid;
		reset();
		dfs();
		if (siz > k) lo = mid + 1;
		else hi = mid;
	}
	reset();
	maxd = lo;
	dfs();
	cout << lo << endl;
	ll cnt = 0;
	for (ll i=1; i<=n; ++i) if (mark[i]) {cout << i << ' '; cnt++;}
	for (ll i=1; i<=n && cnt < k; ++i) if(mark[i]==0) {cout << i << ' '; cnt++;}
	return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 30 / 30
• Subtask 4: 60 / 60