# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
672264 | Dan4Life | Fireworks (APIO16_fireworks) | C++17 | 22 ms | 1620 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
using ll = long long;
#define fi first
#define se second
#define pb push_back
#define all(a) a.begin(),a.end()
#define sz(a) (int)a.size()
const int maxn = 5e3+10;
const int LINF = (int)1e18;
int p[maxn], c[maxn];
int n, m, ans;
vector<pair<int,int>> adj[maxn];
int dp[maxn][310];
bool ok[maxn][310];
void dfs(int s, int p){
if(s>n){ dp[s][0]=0;ok[s][0]=1; return; }
for(auto cur : adj[s]){
int u = cur.fi, c = cur.se;
if(u==p) continue; dfs(u,s);
for(int i = 0; i <= 300; i++){
int price = LINF;
for(int j = 0; j <= i; j++)
if(ok[u][j]) price = min(price, abs(c-(i-j))+dp[u][j]);
if(price==LINF) ok[s][i]=false;
else dp[s][i]+=price;
}
}
}
int32_t main() {
cin >> n >> m; ans=LINF;
for(int i = 2; i <= n+m; i++){
cin >> p[i] >> c[i];
adj[i].pb({p[i],c[i]});
adj[p[i]].pb({i,c[i]});
}
if(n==1){ ans=0; vector<int> v;
for(int i = n+1; i <= n+m; i++) v.pb(c[i]);
sort(all(v)); int ans = 0;
for(auto u : v) ans+=abs(u-v[sz(v)/2]);
cout << ans; return 0;
}
for(int i = 1; i <= n; i++)
for(int j = 0; j <= 300; j++)
ok[i][j]=1;
dfs(1,1);
for(int i = 0; i <= 300; i++) if(ok[1][i]) ans=min(ans, dp[1][i]); cout << ans;
}
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... |