| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 40535 | mohammad_kilani | Beads and wires (APIO14_beads) | C++14 | 0 ms | 0 KiB |
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>
using namespace std;
#define mod 1000000007
#define oo 1000000000
const double PI = acos(-1);
const int N = 100010;
int n , dp[N][2];
vector < pair<int,int> > g[N];
int main(){
scanf("%d",&n);
for(int i=0;i<n-1;i++){
int u , v;
scanf("%d%d",&u,&v);
g[u].push_back(v);
g[v].push_back(u);
}
int ans = 0 , st = 0 , en = 0 , curnode , w , sum = 0 , mx = 0 , i = 0 , cnt = 0;
for(int node=1;node<=n && cnt < 100;node++){
if(g[node].size() == 1){
cnt++;
st = 0 , en = 0 ,sum = 0;
for(i=1;i<=n;i++){
in[i] = g[i].size() - (i != node);
if(in[i] == 0)
q[en++] = i;
}
while(st < en){
curnode = q[st++];
dp[curnode][1] = dp[curnode][0] = 0;
sum = 0 , mx = -oo;
for(i=0;i<g[curnode].size();i++){
if(in[g[curnode][i].first] != 0){
w = g[curnode][i].second;
in[g[curnode][i].first]--;
if(in[g[curnode][i].first] == 0){
q[en++] = g[curnode][i].first;
}
}
else{
sum += max(dp[g[curnode][i].first][0],dp[g[curnode][i].first][1]);
mx = max(mx,dp[g[curnode][i].first][1] + g[curnode][i].second - max(dp[g[curnode][i].first][0],dp[g[curnode][i].first][1]));
}
}
dp[curnode][1] = sum;
dp[curnode][0] = sum + mx + w;
}
ans = max(ans,dp[node][1]);
}
}
printf("%d\n",ans);
return 0;
}