# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
45145 | erdemkiraz | Fireworks (APIO16_fireworks) | C++14 | 2061 ms | 1784 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;
typedef long long ll;
typedef pair < int, int > ii;
const int N = 600 + 5;
int n, m;
vector < ii > v[N];
int dp[N][N];
int f(int x, int k) {
if(k < 0)
return 1e9;
if(x > n) {
return k ? 1e9 : 0;
}
int &r = dp[x][k];
if(r != -1) return r;
r = 0;
for(auto u : v[x]) {
int res = 1e9;
for(int i = -u.second; i <= 600 - (k - u.second); i++) {
res = min(res, f(u.first, k + i - u.second) + abs(i));
}
r = min((int)1e9, r + res);
}
return r;
}
int main() {
scanf("%d %d", &n, &m);
for(int i = 2; i <= n + m; i++) {
int x, c;
scanf("%d %d", &x, &c);
v[x].push_back({i, c});
}
memset(dp, -1, sizeof(dp));
int res = 1e9;
for(int i = 0; i <= 600; i++) {
res = min(res, f(1, i));
}
printf("%d\n", res);
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... |