/** made by amunduzbaev **/
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define fastios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define vll vector<ll>
#define vii vector<int>
#define vpii vector<pii>
#define vpll vector<pll>
template<class T> bool umin(T& a, const T& b) {return a > b? a = b, true:false;}
template<class T> bool umax(T& a, const T& b) {return a < b? a = b, true:false;}
const int N = 2e5+5;
const int mod = 1e9+7;
const ll inf = 1e18;
const ld Pi = acos(-1);
int n, m, k, timer, root, tin[N], w[N], vv[N], dp[N][505];
vii edges[N];
void dfs(int u){
int tmp = timer;
for(auto x:edges[u]) dfs(x);
vv[timer] = w[u];
tin[timer] = tmp;
timer++;
}
void solve(){
cin>>n>>m;
timer = 1;
for(int i=1;i<=n;i++){
cin>>k>>w[i];
edges[k].pb(i);
if(k == 0) root = i;
}
dfs(root);
for(int i=0;i<=n;i++){
for(int j=1;j<=m;j++) dp[i][j] = -mod;
}
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
dp[i][j] = max(dp[i-1][j], dp[tin[i]-1][j-1]+vv[i]);
}
}
cout<<dp[n][m]<<endl;
return;
}
signed main(){
fastios
int t = 0;
if(!t) solve();
else {
cin>>t;
while (t--) solve();
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
5100 KB |
Output is correct |
| 2 |
Correct |
4 ms |
5100 KB |
Output is correct |
| 3 |
Correct |
4 ms |
5228 KB |
Output is correct |
| 4 |
Correct |
17 ms |
22892 KB |
Output is correct |
| 5 |
Correct |
21 ms |
25196 KB |
Output is correct |
| 6 |
Correct |
19 ms |
25196 KB |
Output is correct |
| 7 |
Correct |
261 ms |
301164 KB |
Output is correct |
| 8 |
Correct |
259 ms |
300908 KB |
Output is correct |
| 9 |
Correct |
320 ms |
365420 KB |
Output is correct |
| 10 |
Correct |
378 ms |
403436 KB |
Output is correct |
