| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 409509 |
2021-05-21T02:05:42 Z |
rrrr10000 |
Chase (CEOI17_chase) |
C++14 |
|
683 ms |
217356 KB |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define pb emplace_back
#define lb(v,k) (lower_bound(all(v),(k))-v.begin())
#define ub(v,k) (upper_bound(all(v),(k))-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
#define all(a) a.begin(),a.end()
#define rsort(a) {sort(all(a));reverse(all(a));}
#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vvvvi=vector<vvvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001001;
const ll INF=1001001001;
const ll mod=1000000007;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void outset(T s){auto itr=s.begin();while(itr!=s.end()){if(itr!=s.begin())cout<<' ';cout<<*itr;itr++;}cout<<'\n';}
void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){ll res=1;a%=mod;while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}return res;}
int main(){
ll n,k;cin>>n>>k;
vvi dp(n,vi(k+1)),dp2(n,vi(k+1));
vi v(n);rep(i,n)cin>>v[i];
vvi g(n);rep(i,n-1){ll a,b;cin>>a>>b;a--;b--;g[a].pb(b);g[b].pb(a);}
function<void(ll,ll)> dfs=[&](ll i,ll p){
ll ch=0;
for(ll x:g[i])if(x!=p){
dfs(x,i);
rep(j,k+1)chmax(dp[i][j],dp[x][j]);
ch+=v[x];
}
for(int j=k;j>0;j--)chmax(dp[i][j],dp[i][j-1]+ch);
};dfs(0,-1);
ll ans=0;
function<void(ll,ll)> dfs2=[&](ll i,ll p){
ll ch=0;if(p!=-1)ch+=v[p];
vi sum(k+1);
rep(j,k)chmax(ans,dp2[i][j]+ch);
for(ll x:g[i])if(x!=p){
ch+=v[x];rep(j,k+1)sum[j]+=dp[x][j];
}
for(ll x:g[i])if(x!=p){
rep(j,k+1)chmax(dp2[x][j],sum[j]-dp[x][j]);
rep(j,k)chmax(dp2[x][j+1],sum[j]-dp[x][j]+ch-v[x]);
dfs2(x,i);
}
};dfs2(0,-1);
rep(i,k+1)rep(j,n){
chmax(ans,dp[j][i]);
chmax(ans,dp2[j][i]);
}
out(ans);
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
683 ms |
217356 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
