# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1015300 | vjudge1 | Fireworks (APIO16_fireworks) | C++17 | 4 ms | 7260 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 int long long
int const N=3e5+5;
int const mod=1e9+7;
vector<int> child[N];
pair<int,int> val[N];
int par[N],len[N];
int cost=0;
void dfs(int node){
vector<int> v;
for(int i:child[node]){
dfs(i);
v.push_back(val[i].first+len[i]);
v.push_back(val[i].second+len[i]);
}
if(v.size()==0)
return;
// cout<<"Node := "<<node<<endl;
int opt=1e15;
vector<int> a;
for(int i=0;i<v.size();i++){
// cout<<v[i]<<' ';
int t=0;
for(int c:child[node])
t+=min(abs((val[c].first+len[c])-v[i]),abs((val[c].second+len[c])-v[i]));
if(t>opt)
continue;
else if(t<opt){
opt=t;
val[node].first=v[i];
val[node].second=v[i];
}
else
val[node].second=v[i];
}
// cout<<endl;
cost+=opt;
// cout<<opt<<endl;
}
signed main(){
int n,m;
cin>>n>>m;
for (int i = 2; i <=n+m; ++i)
{
cin>>par[i]>>len[i];
child[par[i]].push_back(i);
}
dfs(1);
cout<<cost<<endl;
return 0;
}
Compilation message (stderr)
# | 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... |