oj.uz

답안 #680536

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
680536 2023-01-11T05:47:55 Z ReLice 바이오칩 (IZhO12_biochips) C++14
100 / 100
 301 ms 401712 KB 
#include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define ll int
#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
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 5204 KB Output is correct
4 Correct 14 ms 22832 KB Output is correct
5 Correct 16 ms 25040 KB Output is correct
6 Correct 16 ms 24968 KB Output is correct
7 Correct 190 ms 299368 KB Output is correct
8 Correct 203 ms 299340 KB Output is correct
9 Correct 242 ms 363960 KB Output is correct
10 Correct 301 ms 401712 KB Output is correct