답안 #90153

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
90153 2018-12-20T15:16:36 Z antimirage 바이오칩 (IZhO12_biochips) C++14
100 / 100
521 ms 408560 KB
#include <bits/stdc++.h>

#define fr first
#define sc second
#define mk make_pair
#define pb emplace_back
#define all(s) s.begin(), s.end()

using namespace std;

const int N = 2e5 + 5;

int n, m, x, y, root, a[N];

int dp[N][505], tin[N], tiktak, inf = 1e9 + 7;

vector < vector <int> > g;

vector < pair <int, int> > vec;

void dfs (int v)
{
	if (g[v].empty() )
		tin[v] = ++tiktak;
		
	for (auto to : g[v]){
		dfs(to);
		
		if (!tin[v])
			tin[v] = tin[to];
		else
			tin[v] = min( tin[v], tin[to] ); 
	}
	vec.pb( mk( tiktak, v ) );
}

main() 
{
	cin >> n >> m;
	g.resize(n + 1);
	
	for (int i = 1; i <= n; i++){
		scanf("%d%d", &x, &a[i]);
		if (x == 0)
			root = i;
		else
			g[x].pb(i);
	}
	dfs(root);
	
	sort( all(vec) );
	
	for (int i = 0; i <= n; i++)
		for (int j = 0; j <= m; j++)
			dp[i][j] = -inf;
			
	dp[0][0] = 0;
	
	for (auto it : vec)
	{	
		for (int j = 1; j <= m; j++)
			dp[it.fr][j] = max( dp[ tin[it.sc] - 1 ][j - 1] + a[it.sc], dp[it.fr][j] );
			
		for (int j = 0; j <= m; j++)
			dp[it.fr][j] = max( dp[it.fr][j], dp[it.fr - 1][j] );
	}
	cout << dp[vec.back().fr][m] << endl;
}
/**
7 2
2 100
0 1000
2 150
3 100
3 5
5 100
2 50
**/

Compilation message

biochips.cpp:37:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main() 
      ^
biochips.cpp: In function 'int main()':
biochips.cpp:43:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &x, &a[i]);
   ~~~~~^~~~~~~~~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 444 KB Output is correct
3 Correct 2 ms 580 KB Output is correct
4 Correct 18 ms 18776 KB Output is correct
5 Correct 24 ms 21088 KB Output is correct
6 Correct 24 ms 21220 KB Output is correct
7 Correct 371 ms 300864 KB Output is correct
8 Correct 369 ms 302188 KB Output is correct
9 Correct 492 ms 369188 KB Output is correct
10 Correct 521 ms 408560 KB Output is correct