oj.uz

Submission #411177

# Submission time Handle Problem Language Result Execution time Memory
411177 2021-05-24T14:05:22 Z Blagojce Chase (CEOI17_chase) C++11
30 / 100
 466 ms 170968 KB 
#include <bits/stdc++.h>
#define fr(i, n, m) for(int i = (n); i < (m); i ++)
#define pb push_back
#define st first
#define nd second
#define pq priority_queue
#define all(x) begin(x), end(x)


using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
const int i_inf = 1e9;
const ll inf = 1e18;
const ll mod = 1e9+7;
const ld eps = 1e-13;
const ld pi  = 3.14159265359;

mt19937 _rand(time(NULL));
clock_t z;

const int mxn = 2e5+5;

int n, v;
ll a[mxn];

ll nsum[mxn];



vector<int> g[mxn];

ll ans = 0;


ll dp1[mxn][101][2];

void dfs(int u, int p){
	for(auto e : g[u]){
		if(e == p) continue;
		dfs(e, u);
	}
	
	fr(k, 1, 101){
		for(auto e : g[u]){
			dp1[u][k][0] = max(dp1[u][k][0], max(dp1[e][k][0], dp1[e][k][1] - a[u])); 
			dp1[u][k][1] = max(dp1[u][k][1], max(dp1[e][k-1][0], dp1[e][k-1][1]-a[u])+nsum[u]);
		}
	}
}




void solve(){	
	cin >> n >> v;
	fr(i, 0, n){
		cin >> a[i];
	}
	fr(i, 0, n-1){
		int u, v;
		cin >> u >> v;
		--u, --v;
		g[u].pb(v);
		g[v].pb(u);
	}
	fr(i, 0, n){
		nsum[i] = 0;
		for(auto u : g[i]){
			nsum[i] += a[u];
		}
	}
	dfs(0, 0);
	ll ans = 0;
	fr(i, 0, v+1) ans = max(ans, dp1[0][i][0]);
	fr(i, 0, v+1) ans = max(ans, dp1[0][i][1]);
	cout<<ans<<endl;
	
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	solve();
}/*
12 2
2 3 3 8 1 5 6 7 8 3 5 4
2 1
2 7
3 4
4 7
7 6
5 6
6 8
6 9
7 10
10 11
10 12
*/

Subtask #1
0 / 20.0

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

Subtask #2
0 / 20.0

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

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 291 ms 170968 KB Output is correct
2 Correct 289 ms 170940 KB Output is correct
3 Correct 466 ms 168232 KB Output is correct
4 Correct 312 ms 167928 KB Output is correct
5 Correct 309 ms 167848 KB Output is correct
6 Correct 302 ms 167880 KB Output is correct
7 Correct 310 ms 167944 KB Output is correct

Subtask #4
0 / 30.0

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