Submission #385050

#	Time	Username	Problem	Language	Result	Execution time	Memory
385050		Return_0	Beads and wires (APIO14_beads)	C++17	0 / 100	4 ms	5100 KiB

beads

#pragma GCC optimize("Ofast,unroll-loops")
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma,tune=native")

#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 long long ll;
typedef long double ld;
typedef pair <ll, ll> pll;

#ifdef SINA
#define dbg(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cout << name << " : " << arg1 << std::endl; }
template <typename Arg1, typename... Args> void __f (const char* names, Arg1&& arg1, Args&&... args) {
	const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...); }
#define dbg2(x, j, n) cout<< #x << " : "; output((j), (n), x, 1); cout.flush();
#else
#define dbg(...) 0
#define dbg2(x, j, n) 0
#endif
#define SZ(x) ((ll)((x).size()))
#define File(s, t) freopen(s ".txt", "r", stdin); freopen(t ".txt", "w", stdout);
#define input(j, n, a) for (int _i = (j); _i < (n)+(j); _i++) cin>> a[_i];
#define output(j, n, a, t) for (int _i = (j); _i < (n)+(j); _i++) cout<< a[_i] << (((t) && _i != (n)+(j)-1)? ' ' : '\n');
#define kill(x) return cout<< (x) << endl, 0
#define cl const ll
#define fr first
#define sc second
#define lc (v << 1)
#define rc (lc | 1)
#define mid ((l + r) >> 1)
#define All(x) (x).begin(), (x).end()

cl inf = sizeof(ll) == 4 ? (1e9 + 10) : (3e18), mod = 1e9 + 7, MOD = 998244353;

template <class A,class B> ostream& operator << (ostream& out,const pair<A,B>&a){return out<<'('<<a.first<<", "<<a.second<<')';}
template <class A> ostream& operator << (ostream& out, const vector<A> &a) {
	out<< '['; for (int i = -1; ++i < int(a.size());) out<< a[i] << (i + 1 < int(a.size()) ? ", " : ""); return out<<']'; }
template <class T, typename _t = less <T> > using Tree = tree <T, null_type, _t, rb_tree_tag, tree_order_statistics_node_update>;

cl N = 2e5 + 7;

ll dp [N][3], n, p;
vector <pll> adj [N];

ll eval (pll &x) {
	return (x.fr == p ? inf : max({dp[x.fr][0], dp[x.fr][1] + x.sc, dp[x.fr][2]}) - (max(dp[x.fr][0], dp[x.fr][2]) + x.sc));
}

void dfs (ll v = 1, ll par = 0) {
	dp[v][0] = 0; dp[v][1] = dp[v][2] = -inf;
	for (auto [u, w] : adj[v]) if (u != par) dfs(u, v), dp[v][0] += max({dp[u][0], dp[u][1] + w, dp[u][2]});
	p = par; sort(All(adj[v]), [&](pll x, pll y) { return eval(x) < eval(y); });
	if ((SZ(adj[v]) - (par > 0)) >= 1) {
		dp[v][1] = dp[v][0] - max({dp[adj[v][0].fr][0], dp[adj[v][0].fr][1] + adj[v][0].sc, dp[adj[v][0].fr][2]});
		dp[v][1] += max(dp[adj[v][0].fr][0], dp[adj[v][0].fr][2]) + adj[v][0].sc;
	}
	if ((SZ(adj[v]) - (par > 0)) >= 2) {
		dp[v][2] = dp[v][1];
		dp[v][2] -= max({dp[adj[v][1].fr][0], dp[adj[v][1].fr][1] + adj[v][1].sc, dp[adj[v][1].fr][2]});
		dp[v][2] += max(dp[adj[v][1].fr][0], dp[adj[v][1].fr][2]) + adj[v][1].sc;
	}
}

int main ()
{
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);

	cin>> n;
	for (ll i = 1, v, u, w; i < n; i++) {
		cin>> v >> u >> w;
		adj[v].push_back({u, w});
		adj[u].push_back({v, w});
	}

	dfs();

	cout<< max(dp[1][0], dp[1][2]) << endl;

	cerr<< "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";

	return 0;
}
/*
5
1 2 10
1 3 40
1 4 15
1 5 20

10
4 10 2
1 2 21
1 3 13
6 7 1
7 9 5
2 4 3
2 5 8
1 6 55
6 8 34

*/

• Subtask 1: 0 / 13
• Subtask 2: 0 / 15
• Subtask 3: 0 / 29
• Subtask 4: 0 / 43