# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
200779 | BThero | Fireworks (APIO16_fireworks) | C++17 | 40 ms | 760 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.
// Why am I so dumb? :c
// chrono::system_clock::now().time_since_epoch().count()
#include<bits/stdc++.h>
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
using namespace std;
//using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int, int> pii;
//template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int MAXN = (int)3e2 + 5;
const int INF = (int)1e6;
int par[MAXN], arr[MAXN];
int dp[MAXN][MAXN];
vector<int> adj[MAXN];
int sum[MAXN];
int n, m;
void pdfs(int v, int pr = -1) {
for (int to : adj[v]) {
if (to != pr) {
sum[to] = sum[v] + arr[to];
pdfs(to, v);
}
}
}
void dfs(int v, int pr = -1) {
if (v > n) {
fill(dp[v], dp[v] + MAXN, INF);
dp[v][sum[v]] = 0;
return;
}
for (int to : adj[v]) {
if (to == pr) {
continue;
}
dfs(to, v);
for (int i = 0; i <= 300; ++i) {
int best = INF;
for (int j = 0; j <= 300; ++j) {
int x = i - j;
if (arr[to] + x >= 0) {
best = min(best, dp[to][j] + abs(x));
}
}
dp[v][i] += best;
}
}
}
void solve() {
scanf("%d %d", &n, &m);
for (int i = 2; i <= n + m; ++i) {
scanf("%d %d", &par[i], &arr[i]);
adj[par[i]].pb(i);
}
pdfs(1);
dfs(1);
int ans = INF;
for (int i = 0; i <= 300; ++i) {
ans = min(ans, dp[1][i]);
}
printf("%d\n", ans);
}
int main() {
int tt = 1;
while (tt--) {
solve();
}
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... |