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 "deliveries.h"
#include <bits/stdc++.h>
using namespace std;
const int N=100005;
long long tot=0,ans=0;
vector<int> sz(N),w;
vector<pair<int,int>> adj[N];
void dfs(int k,int pa,int t){
sz[k]=w[k];
for(auto [j,c]:adj[k]){
if(j==pa)continue;
dfs(j,k,c);
sz[k]+=sz[j];
}
long long y=min(1ll*sz[k],tot-sz[k]);
ans+=y*t*2;
}
void init(int N, vector<int> U, vector<int> V, vector<int> T, vector<int> W) {
w=W;
for(int i=0;i<N-1;i++){
adj[U[i]].push_back({V[i],T[i]});
adj[V[i]].push_back({U[i],T[i]});
}
for(int i=0;i<N;i++){
tot+=w[i];
}
w[0]++;
tot++;
return;
}
long long max_time(int S, int X) {
ans=0;
X+=(S==0);
tot-=w[S];
w[S]=X;
tot+=X;
dfs(1,1,0);
return ans;
}
# | 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... |