# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
69316 | FedericoS | Fireworks (APIO16_fireworks) | 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.
#pragma GCC optimize("Ofast")
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> pll;
ll x,y;
ll INF=1e18;
ll N,M,K=600;
ll DP[305][700];
vector<pll> grafo[305];
ll ans;
void DFS(ll k, ll p){
if(k>N){
for(int i=1;i<K;i++)
DP[k][i]=INF;
return;
}
for(pll f:grafo[k])
if(f.first!=p)
DFS(f.first,k);
for(int i=0;i<K;i++)
for(pll f:grafo[k])
if(f.first!=p){
ll res=INF;
for(int j=0;j<=i;j++)
res=min(res,DP[f.first][j]+abs(f.second-(i-j)));
DP[k][i]+=res;
}
}
int main(){
cin>>N>>M;
if(N==1){
for(int i=0;i<N;i++)
cin>>V[i]>>V[i];
sort(V,V+N);
for(int i=0;i<N;i++)
ans+=abs(V[i]-V[N/2]);
}
else{
for(int i=2;i<=N+M;i++){
cin>>x>>y;
grafo[i].push_back({x,y});
grafo[x].push_back({i,y});
}
DFS(1,0);
ans=INF;
for(int i=0;i<K;i++)
ans=min(ans,DP[1][i]);
}
cout<<ans;
}