Submission #435949

#TimeUsernameProblemLanguageResultExecution timeMemory
435949cgiosyBiochips (IZhO12_biochips)C++17
0 / 100
4 ms4940 KiB
// gs14004's code test #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 W[N+1]; for(int i=1; i<=N; i++) { int p; cin>>p>>W[i];inp[i]=W[i]; if(p) 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'; }
#Verdict Execution timeMemoryGrader output
Fetching results...