Submission #165402

#	Time	Username	Problem	Language	Result	Execution time	Memory
165402		crushteacherswife	Dostavljač (COCI18_dostavljac)	C++14	140 / 140	155 ms	2424 KiB

dostavljac

//Rochy'.'
#include <bits/stdc++.h>
#define fo(i,a,b) for(int i=a;i<=b;++i)
#define fd(i,a,b) for(int i=a;i>=b;--i)
#define fl(i,a,b) for(int i=a;i<b;++i)
#define fa(i,a) for(auto (i):(a))
#define F first
#define S second
#define all(a) a.begin(),a.end()
#define vi vector <int>
#define ii pair <int,int>
#define pb push_back
using namespace std;
template <typename T> inline void read(T &x){char c;bool nega=0;while((!isdigit(c=getchar()))&&(c!='-'));
if(c=='-'){nega=1;c=getchar();}x=c-48;while(isdigit(c=getchar()))x=x*10+c-48;if(nega)x=-x;}
template <typename T> inline void writep(T x){if(x>9)writep(x/10);putchar(x%10+48);}
template <typename T> inline void write(T x){if(x<0){putchar('-');x=-x;}writep(x);putchar(' ');}
template <typename T> inline void writeln(T x){write(x);putchar('\n');}
template <typename R, typename D> inline void Min(R &a, D b){if(a>b) a=b;}
template <typename D, typename R> inline void Max(D &a, R b){if(a<b) a=b;}
const int N=502,mod=1e9+7;
int n,m,dp[N][N][2],w[N];
vi a[N];
void dfs(int u,int pa){
	fa(v,a[u]) if(v!=pa){
		dfs(v,u);
		fd(i,m,1){
			fo(j,2,i){
				Max(dp[u][i][0],dp[u][i-j][0]+dp[v][j-2][1]);
				Max(dp[u][i][1],dp[u][i-j][1]+dp[v][j-2][1]);
			}
			fo(j,1,i) Max(dp[u][i][0],dp[u][i-j][1]+dp[v][j-1][0]);
		}
	}
	fd(i,m,1){
		Max(dp[u][i][0],dp[u][i-1][0]+w[u]);
		Max(dp[u][i][1],dp[u][i-1][1]+w[u]);
	}
}
int main(){
	ios_base::sync_with_stdio(NULL);
	cin. tie(NULL); cout. tie(NULL);
//	freopen(".inp" , "r", stdin);
//	freopen(".out", "w", stdout);
	cin>>n>>m;
	fo(i,1,n) cin>>w[i];
	fl(i,1,n){
		int u,v;cin>>u>>v;
		a[u].pb(v);
		a[v].pb(u);
	}
	dfs(1,0);
	cout<<dp[1][m][0];
	return 0;
}

• Subtask 1: 14 / 14
• Subtask 2: 14 / 14
• Subtask 3: 14 / 14
• Subtask 4: 14 / 14
• Subtask 5: 14 / 14
• Subtask 6: 14 / 14
• Subtask 7: 14 / 14
• Subtask 8: 14 / 14
• Subtask 9: 14 / 14
• Subtask 10: 14 / 14