# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
656498 | Do_you_copy | Biochips (IZhO12_biochips) | C++17 | 577 ms | 398852 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.
/*
Procrastination is the art of keeping up with yesterday
*/
#include <bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
#define faster ios_base::sync_with_stdio(0); cin.tie(0);
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair <int, int>;
mt19937_64 Rand(chrono::steady_clock::now().time_since_epoch().count());
const int maxN = 2e5 + 10;
//const int Mod = 1e9 + 7;
//const int inf =
int n, m;
int root;
vector <int> adj[maxN];
int dp[maxN][502];
int sz[maxN];
int tem[502];
int a[maxN];
void dfs(int u = root){
sz[u] = 1;
memset(tem, 0, sizeof(tem));
for (int v: adj[u]){
dfs(v);
for (int i = 0; i <= min(m, sz[u]); ++i){
for (int j = 0; j <= min(m - i, sz[v]); ++j){
tem[i + j] = max(tem[i + j], dp[u][i] + dp[v][j]);
}
}
sz[u] += sz[v];
for (int i = 1; i <= min(m, sz[u]); ++i) dp[u][i] = tem[i];
}
dp[u][1] = max(dp[u][1], a[u]);
}
void Init(){
cin >> n >> m;
for (int i = 1; i <= n; ++i){
int x; cin >> x >> a[i];
if (x) adj[x].pb(i);
else root = i;
}
dfs();
cout << dp[root][m];
}
#define debug
#define taskname "test"
signed main(){
faster
if (fopen(taskname".inp", "r")){
freopen(taskname".inp", "r", stdin);
freopen(taskname".out", "w", stdout);
}
int tt = 1;
//cin >> tt;
while (tt--){
Init();
}
if (fopen("timeout.txt", "r")){
ofstream timeout("timeout.txt");
timeout << signed(double(clock()) / CLOCKS_PER_SEC * 1000);
timeout.close();
#ifndef debug
cerr << "Time elapsed: " << signed(double(clock()) / CLOCKS_PER_SEC * 1000) << "ms\n";
#endif // debug
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |