oj.uz

답안 #121561

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
121561 2019-06-26T18:58:15 Z sofhiasouza Chase (CEOI17_chase) C++14
30 / 100
 1771 ms 97440 KB 
#include <bits/stdc++.h>
#define pb push_back
using namespace std;
typedef long long int ll;

const int maxn = 1e5+10;

int n, v, vet[maxn];
ll dp[maxn][110];

vector < int > grafo[maxn];

ll dfs(int u, int val, int pai)
{
	if(val == 0) return 0;
	if(dp[u][val]) return dp[u][val];

	ll resp1 = 0, resp2 = 0, cont = 0;
	for(int i = 0 ; i < grafo[u].size() ; i++)
	{
		int v = grafo[u][i];
		if(v == pai) continue;

		cont += vet[v];
		resp1 = max(resp1, dfs(v, val-1, u));
		resp2 = max(resp2, dfs(v, val, u));
	}

	resp1 += cont;

	return dp[u][val] = max(resp1, resp2);
}

int main()
{
	cin >> n >> v;
	
	for(int i = 1 ; i <= n ; i++) cin >> vet[i];

	for(int i = 0 ; i < n-1 ; i++)
	{
		int a, b;
		cin >> a >> b;
		grafo[a].pb(b);
		grafo[b].pb(a);
	}

	ll resp = dfs(1, v, 0);

	if(n <= 10)
	{
		for(int i = 2 ; i <= n ; i++) resp = max(resp, dfs(i, v, 0));
	}

	cout << resp << endl;
}

Compilation message

chase.cpp: In function 'll dfs(int, int, int)':
chase.cpp:19:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0 ; i < grafo[u].size() ; i++)
                  ~~^~~~~~~~~~~~~~~~~

Subtask #1
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 2688 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 2688 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1771 ms 97172 KB Output is correct
2 Correct 1757 ms 97440 KB Output is correct
3 Correct 204 ms 92788 KB Output is correct
4 Correct 238 ms 92664 KB Output is correct
5 Correct 691 ms 92636 KB Output is correct
6 Correct 625 ms 92572 KB Output is correct
7 Correct 682 ms 92536 KB Output is correct

Subtask #4
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 2688 KB Output isn't correct
2 Halted 0 ms 0 KB -