This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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;
template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)
template<typename T>
void amin(T &a, T b) {
a = min(a,b);
}
template<typename T>
void amax(T &a, T b) {
a = max(a,b);
}
#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif
/*
*/
const int MOD = 1e9 + 7;
const int N = 1e3 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
vector<pll> adj[N];
ll dp[N][N];
vector<ll> ances;
vector<ll> depth(N);
void dfs1(ll u, ll p){
vector<ll> children;
ances.pb(u);
for(auto [v,w] : adj[u]){
if(w or v == p) conts;
depth[v] = depth[u]+1;
dfs1(v,u);
children.pb(v);
}
trav(anc,ances){
ll sum = 0;
ll mx = 0;
trav(v,children){
ll val1 = max(dp[v][v],dp[v][u]);
ll val2 = dp[v][anc];
sum += val1;
amax(mx,val2-val1);
}
dp[u][anc] = sum+mx;
}
for(auto [v,w] : adj[u]){
if(!w) conts;
if(depth[v] > depth[u]) conts;
amax(dp[u][v],dp[u][u]+w);
}
ances.pop_back();
}
void solve(int test_case)
{
ll n,m; cin >> n >> m;
ll sum = 0;
rep1(i,m){
ll u,v,w; cin >> u >> v >> w;
adj[u].pb({v,w}), adj[v].pb({u,w});
sum += w;
}
ll root = -1;
rep1(u,n){
ll deg = 0;
for(auto [v,w] : adj[u]){
if(!w) deg++;
}
if(deg == 1){
root = u;
}
}
memset(dp,-0x3f,sizeof dp);
dfs1(root,-1);
ll ans = sum-dp[root][root];
cout << ans << endl;
}
int main()
{
fastio;
int t = 1;
// cin >> t;
rep1(i, t) {
solve(i);
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |