oj.uz

Submission #245829

# Submission time Handle Problem Language Result Execution time Memory
245829 2020-07-07T14:25:47 Z kshitij_sodani Chase (CEOI17_chase) C++17
70 / 100
 1103 ms 330616 KB 
/*
https://www.oi.edu.pl/old/ioi/downloads/ioi2005-tasks-and-solutions-a5.pdf
*/
#include <bits/stdc++.h>
using namespace std;
typedef int64_t llo;
#define mp make_pair
#define pb push_back
#define a first 
#define b second
//#define endl '\n'
llo n,m;
llo it[100001];
llo co[100001];
vector<llo> adj[100001];
llo dp[100001][101][2];
llo dp2[100001][101][2];
llo ans=0;
vector<pair<llo,int>> ac[101][2];
void dfs(llo no,llo par2=-1){
	for(llo i=1;i<=m;i++){
		dp[no][i][0]=0;
		dp2[no][i][0]=0;
		dp[no][i][1]=co[no];
		dp2[no][i][1]=co[no];
	}
	
	for(auto j:adj[no]){
		if(j==par2){
			continue;
		}
		dfs(j,no);
	}
	for(int i=0;i<=m;i++){
		ac[i][0].clear();
		ac[i][1].clear();
	}
	for(auto j:adj[no]){
		if(j==par2){
			continue;
		}
		for(llo i=0;i<=m;i++){
			llo x=0;
			llo y=0;
			if(i>0){
				x=max(x,dp[j][i-1][0]+co[no]);
				if(i>1){
					x=max(x,dp[j][i-1][1]+co[no]-it[no]);
				}
			}
			dp[no][i][1]=max(dp[no][i][1],x);

			y=max(y,dp[j][i][0]);
			if(i>0){
				y=max(y,dp[j][i][1]-it[no]);
			}
			dp[no][i][0]=max(dp[no][i][0],y);
		//	ac[i][0].pb({max(x,y),j});
			x=0;
			y=0;

			if(i>0){
				x=max(x,dp2[j][i-1][0]+co[no]-it[j]);
				if(i>1){
					x=max(x,dp2[j][i-1][1]+co[no]-it[j]);
				}
				y=max(y,dp2[j][i][1]);
			}
			y=max(y,dp2[j][i][0]);
			dp2[no][i][0]=max(dp2[no][i][0],y);
			dp2[no][i][1]=max(dp2[no][i][1],x);
		//	ac[i][1].pb({max(x,y),j});
		}
	}
	ans=max(ans,dp[no][m][0]);
	ans=max(ans,dp[no][m][1]);
	ans=max(ans,dp2[no][m][0]);
	ans=max(ans,dp2[no][m][1]);

	/*for(llo i=0;i<=m;i++){
		if(ac[i][0].size()>0 and ac[m-i][1].size()>0){
			if(ac[i][0][0].b==ac[m-i][1][0].b){
				if(ac[i][0].size()>1){
					ans=max(ans,ac[i][0][1].a+ac[m-i][1][0].a);
				}
				if(ac[m-i][1].size()>1){
					ans=max(ans,ac[i][0][0].a+ac[m-i][1][1].a);
				}
			}
			else{
				ans=max(ans,ac[i][0][0].a+ac[m-i][1][0].a);
			}
		}
	}

*/


}
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin>>n>>m;
	for(llo i=0;i<n;i++){
		cin>>it[i];
	}
	for(llo i=0;i<n-1;i++){
		llo aa,bb;
		cin>>aa>>bb;
		aa--;
		bb--;
		adj[aa].pb(bb);
		adj[bb].pb(aa);
		co[aa]+=it[bb];
		co[bb]+=it[aa];
	}
	if(n<=1000){
		for(int i=0;i<n;i++){
			dfs(i);
		}
	}
	dfs(0);
	cout<<ans<<endl;
//	cout<<max(dp[0][m][1],dp[0][m][0])<<endl;


	return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2688 KB Output is correct
2 Correct 6 ms 2688 KB Output is correct
3 Correct 7 ms 2688 KB Output is correct
4 Correct 6 ms 2688 KB Output is correct
5 Correct 6 ms 2688 KB Output is correct
6 Correct 6 ms 2688 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2688 KB Output is correct
2 Correct 6 ms 2688 KB Output is correct
3 Correct 7 ms 2688 KB Output is correct
4 Correct 6 ms 2688 KB Output is correct
5 Correct 6 ms 2688 KB Output is correct
6 Correct 6 ms 2688 KB Output is correct
7 Correct 1079 ms 6044 KB Output is correct
8 Correct 96 ms 6136 KB Output is correct
9 Correct 84 ms 5888 KB Output is correct
10 Correct 1103 ms 6008 KB Output is correct
11 Correct 391 ms 5968 KB Output is correct
12 Correct 144 ms 6008 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 405 ms 330504 KB Output is correct
2 Correct 411 ms 330616 KB Output is correct
3 Correct 321 ms 326508 KB Output is correct
4 Correct 256 ms 326392 KB Output is correct
5 Correct 416 ms 326392 KB Output is correct
6 Correct 422 ms 326392 KB Output is correct
7 Correct 462 ms 326368 KB Output is correct

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2688 KB Output is correct
2 Correct 6 ms 2688 KB Output is correct
3 Correct 7 ms 2688 KB Output is correct
4 Correct 6 ms 2688 KB Output is correct
5 Correct 6 ms 2688 KB Output is correct
6 Correct 6 ms 2688 KB Output is correct
7 Correct 1079 ms 6044 KB Output is correct
8 Correct 96 ms 6136 KB Output is correct
9 Correct 84 ms 5888 KB Output is correct
10 Correct 1103 ms 6008 KB Output is correct
11 Correct 391 ms 5968 KB Output is correct
12 Correct 144 ms 6008 KB Output is correct
13 Correct 405 ms 330504 KB Output is correct
14 Correct 411 ms 330616 KB Output is correct
15 Correct 321 ms 326508 KB Output is correct
16 Correct 256 ms 326392 KB Output is correct
17 Correct 416 ms 326392 KB Output is correct
18 Correct 422 ms 326392 KB Output is correct
19 Correct 462 ms 326368 KB Output is correct
20 Incorrect 438 ms 326520 KB Output isn't correct
21 Halted 0 ms 0 KB -