oj.uz

Submission #199677

# Submission time Handle Problem Language Result Execution time Memory
199677 2020-02-02T17:38:56 Z algorithm16 Chase (CEOI17_chase) C++14
0 / 100
 4000 ms 54648 KB 
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
typedef long long int llint;
vector <int> v[100005];
llint arr[100005],s[100005],dp[100005][105],n,v1;
void dfs(int x,int par) {
	for(int j=0;j<v[x].size();j++) {
		if(v[x][j]==par) continue;
		dfs(v[x][j],x);
	}
	for(int j=0;j<v[x].size();j++) {
		if(v[x][j]==par) continue;
		dp[x][0]=max(dp[x][0],dp[v[x][j]][0]);
		for(int i=1;i<=v1;i++) {
			dp[x][i]=max(dp[x][i],dp[v[x][j]][i]);
			dp[x][i]=max(dp[x][i],dp[v[x][j]][i-1]+s[x]-arr[par]);
		}
	}
}
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cin >> n >> v1;
	for(int i=0;i<n;i++) {
		cin >> arr[i];
	}
	for(int i=0;i<n-1;i++) {
		int a,b;
		cin >> a >> b;
		v[a-1].push_back(b-1);
		v[b-1].push_back(a-1);
	}
	for(int i=0;i<n;i++) {
		for(int j=0;j<v[i].size();j++) {
			s[i]+=arr[v[i][j]];
		}
	}
	for(int i=0;i<=v1;i++) {
		dfs(0,-1);
	}
	cout << dp[0][v1];
	return 0;
}

Compilation message

chase.cpp: In function 'void dfs(int, int)':
chase.cpp:9:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int j=0;j<v[x].size();j++) {
              ~^~~~~~~~~~~~
chase.cpp:13:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int j=0;j<v[x].size();j++) {
              ~^~~~~~~~~~~~
chase.cpp: In function 'int main()':
chase.cpp:37:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int j=0;j<v[i].size();j++) {
               ~^~~~~~~~~~~~

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 2680 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 2680 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3908 ms 52552 KB Output is correct
2 Execution timed out 4021 ms 54648 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 2680 KB Output isn't correct
2 Halted 0 ms 0 KB -