Submission #135195

#TimeUsernameProblemLanguageResultExecution timeMemory
135195fredbrBeads and wires (APIO14_beads)C++17
0 / 100
2 ms632 KiB
#include <bits/stdc++.h> #pragma GCC optimize("O3") #pragma GCC target("arch=haswell") using namespace std; int const maxn = 10001; struct Edge { int u, w; }; vector<Edge> v[maxn]; int n; int dp[2][maxn]; inline int invalid(int x) { return v[x].size() == 1; } char vis[maxn]; int res[maxn]; void bfs_order(int ini) { vis[ini] = 1; res[0] = ini; int at = 0, fim = 1; while (at < n) { int x = res[at++]; for (Edge const& e : v[x]) { if (vis[e.u]) continue; vis[e.u] = 1; res[fim++] = e.u; } } } inline int test(int ini) { memset(vis, 0, sizeof(vis)); bfs_order(ini); memset(vis, 0, sizeof(vis)); for (int i = n-1; i >= 0; i--) { int x = res[i]; vis[x] = 1; int d = 0; for (Edge const& e : v[x]) { if (!vis[e.u]) continue; if (!invalid(e.u)) { d += max(dp[1][e.u] + e.w, dp[0][e.u]); } } dp[0][x] = d; d = 0; int sum = dp[0][x]; for (Edge const& e : v[x]) { if (!vis[e.u]) continue; if (!invalid(e.u)) d = max(d, - max(dp[1][e.u] + e.w, dp[0][e.u]) + e.w + dp[0][e.u]); else d = max(d, e.w); } dp[1][x] = sum + d; } return dp[0][ini]; } int main() { ios::sync_with_stdio(false), cin.tie(nullptr); cin >> n; for (int i = 0; i < n-1; i++) { int a, b, w; cin >> a >> b >> w; v[a].push_back({b, w}); v[b].push_back({a, w}); } int ans = 0; for (int i = 1; i <= n; i++) if (v[i].size() == 1) ans = max(ans, test(i)); cout << ans << "\n"; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...