oj.uz

Submission #680533

# Submission time Handle Problem Language Result Execution time Memory
680533 2023-01-11T05:45:44 Z ReLice Biochips (IZhO12_biochips) C++14
60 / 100
 244 ms 524288 KB 
#include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define ll long long 
#define pb push_back
#define sz size()
#define fr first
#define sc second
#define all(x) x.begin(),x.end()
void start(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}
const ll N=2e5+5;
const ll mod=1e9+7;
const ll inf=1e9;
ll n,m;
ll a[N],b[N],tin[N],p;
ll dp[N][505];
ll timer=1;
vector <ll> g[N];
void dfs(ll v){
	ll tt=timer;
	for(auto to : g[v]) dfs(to);
	tin[timer]=tt;
	b[timer]=a[v];
	timer++;
}
void solve(){
    ll i,j,c=0;
    cin>>n>>m;
    for(i=1;i<=n;i++){
        cin>>p>>a[i];
        if(!p) {
            c=i;
            continue;
        }
        g[p].pb(i);
    }
    dfs(c);
    for(i=0;i<=n;i++){
		for(j=1;j<=m;j++){
			dp[i][j]=-inf;
		}
    }
    for(i=1;i<=n;i++){
        for(j=1;j<=m;j++){
            dp[i][j]=max(dp[i-1][j],dp[tin[i]-1][j-1]+b[i]);
        }
    }
    cout<<dp[n][m];
}
signed main(){
    //fre("");
    start();
    ll t=1;
    //cin>>t;
    while(t--)solve();

}

Subtask #1
60.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5076 KB Output is correct
2 Correct 4 ms 5076 KB Output is correct
3 Correct 3 ms 5332 KB Output is correct
4 Correct 20 ms 40460 KB Output is correct
5 Correct 23 ms 44976 KB Output is correct
6 Correct 22 ms 44912 KB Output is correct
7 Runtime error 244 ms 524288 KB Execution killed with signal 9
8 Runtime error 219 ms 524288 KB Execution killed with signal 9
9 Runtime error 224 ms 524288 KB Execution killed with signal 9
10 Runtime error 227 ms 524288 KB Execution killed with signal 9