# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
435946 | 2021-06-24T02:28:50 Z | cgiosy | Biochips (IZhO12_biochips) | C++17 | 4 ms | 4940 KB |
#include <bits/stdc++.h> using namespace std; int n,m,inp[200005]; int piv,sz[200005],a[200005]; vector<int> g[200005]; int root; int dfs(int x){ int num = ++piv; a[num] = inp[x]; sz[num] = 1; for(int &i : g[x]){ sz[num] += dfs(i); } return sz[num]; } int dp[2][200005]; void mx(int&a, int b) { a=max(a, b); } int main() { ios::sync_with_stdio(0);cin.tie(0); int N, K, r; cin>>N>>K;n=N,m=K; int D[2][200004], F[N+1], G[N+1]{}, W[N+1]; for(int i=1; i<=N; i++) { int p; cin>>p>>W[i];inp[i]=W[i]; if(p) F[i]=G[p], G[p]=i,g[p].push_back(i); else root=r=i; } dfs(root); for (int i=1; i<=m; i++) { dp[i%2][n+1] = -1e9; for (int j=n; j; j--) { dp[i%2][j] = max(dp[i%2][j+1],dp[(i-1)%2][j+sz[j]] + a[j]); } } cout<<dp[m%2][1]<<'\n'; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 4940 KB | Output is correct |
2 | Incorrect | 4 ms | 4940 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |