제출 #252771

#제출 시각아이디문제언어결과실행 시간메모리
252771leakedDostavljač (COCI18_dostavljac)C++14
0 / 140
108 ms2380 KiB
#include<bits/stdc++.h> using namespace std; #include<ext/pb_ds/assoc_container.hpp> //#include<ext/pb_ds/tree_policy.hpp> // // #pragma GCC optimize("unroll-loops") // #pragma GCC optimize("Ofast") // #pragma GCC optimize("-O3") // #pragma GCC optimize("no-stack-protector") // #pragma GCC optimize("fast-math") //#define LOCAL #define sim template < class c #define ris return * this #define dor > debug & operator << #define eni(x) sim > typename \ enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) { sim > struct rge { c b, e; }; sim > rge<c> range(c i, c j) { return rge<c>{i, j}; } sim > auto dud(c* x) -> decltype(cout << *x, 0); sim > char dud(...); struct debug { #ifndef LOCAL ~debug() { cout << endl; } eni(!=) cout << boolalpha << i; ris; } eni(==) ris << range(begin(i), end(i)); } sim, class b dor(pair < b, c > d) { ris << "(" << d.first << ", " << d.second << ")"; } sim dor(rge<c> d) { *this << "["; for (auto it = d.b; it != d.e; ++it) *this << ", " + 2 * (it == d.b) << *it; ris << "]"; } #else sim dor(const c&) { ris; } #endif }; #define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] " #define fi first #define f first #define se second #define s second #define vi_a vector<int>a; #define p_b push_back ////////////////////////////////???????????????CHECK THIS OUT???????????????////////////////////////////// #define ll long long typedef unsigned long long ull; ////////////////////////////////???????????????CHECK THIS OUT???????????????////////////////////////////// #define ld long double #define pll pair<ll,ll> #define pii pair<int,int> #define m_p make_pair #define fast_io cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0); #define all(x) x.begin(),x.end() #define getfiles ifstream cin("input.txt");ofstream cout("output.txt"); #define pw(x) (1ll << x) #define sz(x) (int)x.size() #define endl "\n" #define rall(x) x.rbegin(),x.rend() #define len(a) (ll)a.size() #define rep(x,l,r) for(ll x=l;x<r;x++) using namespace __gnu_pbds; ld eps = (ld)1 / 1e6; const ld pi=3.14159265359; ll inf = 1e18,mod1=1e9+7; ll sqr(ll a) { return a * a; } ll qb(ll a) { return a * a * a; } ll gcd(ll a, ll b) { return !a ? b : gcd(b % a, a); } ll binpow(ll a, ll b, ll mod) { return b ? (b % 2 ? (a * (sqr(binpow(a, b / 2, mod)) % mod)) % mod : sqr(binpow(a, b / 2, mod)) % mod) : 1; } ll binmult(ll a, ll b, ll mod) { return b ? (b % 2 ? (2 * binmult(a, b / 2, mod) + a) % mod : (2 * binmult(a, b / 2, mod)) % mod) : 0; } ///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// const ll R=1e4; const ll tx[4]={0,0,-1,1}; const ll ty[4]={-1,1,0,0}; const char rev_to[4]={'E','W','N','S'}; const int N=5e2+1; const int M=1e9+7; //typedef tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update> st; auto rnd=bind(uniform_int_distribution<ll>(1,125),mt19937(time(0))); void bad(){ cout<<-1; exit(0); } bool cmp(pll a,pll b){ return (a.f!=b.f ? a.f>b.f : a.s<b.s); } int dp[N][N],h[N],mx[N][N];/// vertex,time vector<int>g[N]; int a[N]; int n,m; int ans=0; void dfs(int v,int p){ if(v) h[v]=h[p]+1; for(auto &z : g[v]){ if(z==p) continue; dfs(z,v); for(int my=0;my<=m;my++){ for(int his=0;his+my+2<=m;his++){ if(my+his+2<=m){ dp[v][my+his+2]=max(dp[v][my+his+2],dp[v][my]+dp[z][his]); // debug()<<imie(v)<<imie(dp[v][my+his+2])<<imie(my+his+2)<<imie(z); } } } for(int j=1;j<=m-1;j++){ mx[v][j]=max(mx[v][j],mx[z][j-1]+a[v]); } mx[v][1]=a[v]; } } signed main() { fast_io; cin>>n>>m; for(int i=0;i<n;i++) cin>>a[i]; for(int i=0;i<n;i++)for(int j=1;j<=m;j++) dp[i][j]=a[i]; int v,u; for(int i=1;i<n;i++){ cin>>v>>u;--v;--u; g[v].p_b(u);g[u].p_b(v); } dfs(0,0); for(int i=0;i<=m;i++) ans=max(ans,dp[0][i]); for(int i=0;i<n;i++)for(int j=1;j<=m;j++) mx[i][j]=max(mx[i][j],mx[i][j-1]); for(int i=0;i<=m;i++){ for(int j=1;j<n;j++){ int need=m-i-h[j]; ans=max(ans,mx[j][need]+dp[0][i]); } } cout<<ans; return 0; } /* 1 7 1 2 4 8 131 64 128 1 100000000000 100000000000 */
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...