# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
45167 | erdemkiraz | Fireworks (APIO16_fireworks) | C++11 | 31 ms | 1020 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 = 300 + 5;
int n, m;
vector < ii > v[N];
int dp[N][N], dp2[N];
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});
}
for(int i = n + 1; i <= n + m; i++) {
for(int j = 1; j < N; j++)
dp[i][j] = 1e9;
}
for(int x = n; x >= 1; x--) {
for(auto u : v[x]) {
for(int i = 0; i < N; i++)
dp2[i] = 1e9;
for(int i = 0; i < N; i++)
for(int j = -u.second; i - j - u.second >= 0; j++)
dp2[i] = min(dp2[i], dp[u.first][i - j - u.second] + abs(j));
for(int i = 0; i < N; i++)
dp[x][i] += dp2[i];
}
}
int res = 1e9;
for(int i = 0; i < N; i++) {
res = min(res, dp[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... |