Submission #734680

#	Time	Username	Problem	Language	Result	Execution time	Memory
734680		Abrar_Al_Samit	Beads and wires (APIO14_beads)	C++17	28 / 100	1078 ms	6740 KiB

beads

#include<bits/stdc++.h>
using namespace std;


const int nax = 200005;

vector<pair<int,int>>g[nax];

int dp[nax][2], n;

int solve(int v, int topar, int p = -1) {
	int &ret = dp[v][(topar>0)];
	if(ret!=-1) return ret;

	ret = 0;
	int base = 0;
	for(auto [u, w] : g[v]) if(u!=p) {
		base += solve(u, w, v);
	}

	ret = base;

	if(topar) {
		for(auto [u, w] : g[v]) if(u!=p) {
			int cur = base - solve(u, w, v) + solve(u, 0, v) + topar + w;
			ret = max(ret, cur);
		}
	}
	return ret;
}
void PlayGround() {
	cin>>n;
	for(int i=1; i<n; ++i) {
		int u, v, w;
		cin>>u>>v>>w;
		g[u].emplace_back(v, w);
		g[v].emplace_back(u, w);
	}	

	int ans = 0;
	for(int i=1; i<=n; ++i) {
		memset(dp, -1, sizeof dp);
		ans = max(ans, solve(i, 0));
	}
	cout<<ans<<'\n';

	// cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
}
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	PlayGround();
	return 0;
}

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