oj.uz

답안 #236372

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
236372 2020-06-01T15:43:18 Z MohamedAhmed04 바이오칩 (IZhO12_biochips) C++14
0 / 100
 19 ms 22912 KB 
#include <bits/stdc++.h>

using namespace std ;

const int MAXN = 2e5 + 5 , MAXM = 505 ;

int arr[MAXN] , sz[MAXN] , dp[MAXN][MAXM] , tmpdp[MAXM] ;
int n , m ;

vector< vector<int> >adj(MAXN) ;

void dfs(int node)
{
	dp[node][0] = 0 ;
	sz[node] = 1 ;
	for(auto &child : adj[node])
	{
		dfs(child) ;
		int Max = 0 ;
		for(int k1 = 0 ; k1 <= min(sz[node] , m) ; ++k1)
		{
			if(!dp[node][k1] && k1)
				break ;
			for(int k2 = 1 ; k2 <= sz[child] && k1 + k2 <= m ; ++k2)
			{
				if(!dp[child][k2])
					break ;
				Max = max(Max , k1+k2) ;
				tmpdp[k1+k2] = max(dp[node][k1+k2] , dp[node][k1] + dp[child][k2]) ;	
			}
		}
		for(int i = 1 ; i <= Max ; ++i)
			dp[node][i] = tmpdp[i] ;
		sz[node] += sz[child] ;
	}
	dp[node][1] = max(dp[node][1] , arr[node]) ;
}

int main()
{
	ios_base::sync_with_stdio(0) ;
	cin.tie(0) ;
	cin>>n>>m ;
	int root ;
	for(int i = 1 ; i <= n ; ++i)
	{
		int par ;
		cin>>par>>arr[i] ;
		if(par == 0)
			root = i ;
		adj[par].push_back(i) ;
	}
	dfs(root) ;
	return cout<<dp[root][m]<<"\n" , 0 ;
}

Compilation message

biochips.cpp: In function 'int main()':
biochips.cpp:54:28: warning: 'root' may be used uninitialized in this function [-Wmaybe-uninitialized]
  return cout<<dp[root][m]<<"\n" , 0 ;
                            ^~~~

Subtask #1
0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 5120 KB Output is correct
2 Correct 7 ms 5120 KB Output is correct
3 Correct 7 ms 5248 KB Output is correct
4 Incorrect 19 ms 22912 KB Output isn't correct
5 Halted 0 ms 0 KB -