/*************************************
* author: marvinthang *
* created: 24.11.2023 10:53:02 *
*************************************/
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define left ___left
#define right ___right
#define TIME (1.0 * clock() / CLOCKS_PER_SEC)
#define MASK(i) (1LL << (i))
#define BIT(x, i) ((x) >> (i) & 1)
#define __builtin_popcount __builtin_popcountll
#define ALL(v) (v).begin(), (v).end()
#define REP(i, n) for (int i = 0, _n = (n); i < _n; ++i)
#define REPD(i, n) for (int i = (n); i-- > 0; )
#define FOR(i, a, b) for (int i = (a), _b = (b); i < _b; ++i)
#define FORD(i, b, a) for (int i = (b), _a = (a); --i >= _a; )
#define FORE(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i)
#define FORDE(i, b, a) for (int i = (b), _a = (a); i >= _a; --i)
#define scan_op(...) istream & operator >> (istream &in, __VA_ARGS__ &u)
#define print_op(...) ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
#include "debug.h"
#else
#define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
#define DB(...) 23
#define db(...) 23
#define debug(...) 23
#endif
template <class U, class V> scan_op(pair <U, V>) { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>) { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>) { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")"; else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }
template <class A, class B> bool minimize(A &a, B b) { if (a > b) { a = b; return true; } return false; }
template <class A, class B> bool maximize(A &a, B b) { if (a < b) { a = b; return true; } return false; }
// end of template
const long long INF = 1e18;
const int MAX_LENGTH = 301;
void process(void) {
int n, m; cin >> n >> m;
vector <int> par(n + m), lengths(n + m);
FOR(i, 1, n + m) {
cin >> par[i] >> lengths[i];
--par[i];
}
vector <vector <long long>> dp(n + m, vector<long long>(MAX_LENGTH));
FORD(i, n + m, 1) {
if (i >= n) fill(1 + ALL(dp[i]), INF);
REP(j, MAX_LENGTH) {
long long mi = INF;
REP(k, j + 1) minimize(mi, dp[i][k] + abs(j - k - lengths[i]));
dp[par[i]][j] += mi;
}
}
cout << *min_element(ALL(dp[0])) << '\n';
}
int main(void) {
ios_base::sync_with_stdio(false); cin.tie(nullptr); // cout.tie(nullptr);
file("fireworks");
// int t; cin >> t; while (t--)
process();
// cerr << "Time elapsed: " << TIME << " s.\n";
return (0^0);
}
Compilation message
fireworks.cpp: In function 'int main()':
fireworks.cpp:30:61: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
30 | #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
fireworks.cpp:71:2: note: in expansion of macro 'file'
71 | file("fireworks");
| ^~~~
fireworks.cpp:30:94: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
30 | #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
fireworks.cpp:71:2: note: in expansion of macro 'file'
71 | file("fireworks");
| ^~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
348 KB |
Output is correct |
| 2 |
Correct |
2 ms |
348 KB |
Output is correct |
| 3 |
Correct |
3 ms |
600 KB |
Output is correct |
| 4 |
Correct |
5 ms |
684 KB |
Output is correct |
| 5 |
Correct |
6 ms |
604 KB |
Output is correct |
| 6 |
Correct |
6 ms |
768 KB |
Output is correct |
| 7 |
Correct |
8 ms |
604 KB |
Output is correct |
| 8 |
Correct |
10 ms |
860 KB |
Output is correct |
| 9 |
Correct |
9 ms |
860 KB |
Output is correct |
| 10 |
Correct |
10 ms |
860 KB |
Output is correct |
| 11 |
Correct |
11 ms |
860 KB |
Output is correct |
| 12 |
Correct |
13 ms |
856 KB |
Output is correct |
| 13 |
Correct |
13 ms |
1108 KB |
Output is correct |
| 14 |
Correct |
14 ms |
1116 KB |
Output is correct |
| 15 |
Correct |
14 ms |
1116 KB |
Output is correct |
| 16 |
Correct |
14 ms |
1116 KB |
Output is correct |
| 17 |
Correct |
14 ms |
1116 KB |
Output is correct |
| 18 |
Correct |
14 ms |
1112 KB |
Output is correct |
| 19 |
Correct |
15 ms |
1116 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
