# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
683733 | nifeshe | Biochips (IZhO12_biochips) | C++17 | 2096 ms | 524288 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>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
//#pragma GCC target ("avx2")
//#pragma GCC optimize ("O3")
//#pragma GCC optimize ("unroll-loops")
//#pragma comment (linker, "/STACK: 16777216")
#define f first
#define s second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define mp make_pair
#define int long long
using namespace std;
using namespace __gnu_pbds;
template <typename T> inline bool umax(T &a, const T &b) { if(a < b) { a = b; return 1; } return 0; }
template <typename T> inline bool umin(T &a, const T &b) { if(a > b) { a = b; return 1; } return 0; }
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
template <typename T> using oset = tree<T, null_type, less <T>, rb_tree_tag, tree_order_statistics_node_update>;
const ll mod = 998244353;
const ll base = 1e6 + 5;
const ll inf = 1e12;
const int MAX = 2e5 + 5;
const int LG = 31;
random_device rd;
mt19937 gen(rd());
uniform_int_distribution<ll> dis(1, inf);
void solve() {
int n, m;
cin >> n >> m;
vector<int> a(n + 1);
vector<vector<int>> g(n + 1);
int root;
for(int i = 1; i <= n; i++) {
int p;
cin >> p >> a[i];
if(!p) {
root = i;
continue;
}
g[p].pb(i);
g[i].pb(p);
}
vector<vector<int>> dp(n + 1, vector<int>(m + 1, -inf));
function<void(int, int)> dfs = [&](int v, int p) {
dp[v][0] = 0;
for(auto to : g[v]) {
if(to == p) continue;
dfs(to, v);
auto ndp = dp[v];
for(int j = 0; j <= m; j++) {
if(!dp[to][j]) continue;
for(int k = 0; k + j <= m; k++) {
if(dp[v][k] == -inf) break;
umax(ndp[k + j], dp[v][k] + dp[to][j]);
}
}
dp[v] = ndp;
}
umax(dp[v][1], a[v]);
};
dfs(root, 0);
cout << dp[root][m] << '\n';
}
signed main() {
// freopen("skyline.in", "r", stdin); freopen("skyline.out", "w", stdout);
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int ttt = 1;
// cin >> ttt;
while(ttt--) {
solve();
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |