oj.uz

Submission #268182

# Submission time Handle Problem Language Result Execution time Memory
268182 2020-08-16T10:09:10 Z MarcoMeijer Chase (CEOI17_chase) C++14
100 / 100
 2174 ms 459512 KB 
#include <bits/stdc++.h>
using namespace std;
 
// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e9
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
#define sz size()
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
 
// input
template<class T> void IN(T& x) {cin >> x;}
template<class H, class... T> void IN(H& h, T&... t) {IN(h); IN(t...); }
 
// output
template<class T1, class T2> void OUT(const pair<T1,T2>& x);
template<class T> void OUT(const T& x) {cout << x;}
template<class H, class... T> void OUT(const H& h, const T&... t) {OUT(h); OUT(t...); }
template<class T1, class T2> void OUT(const pair<T1,T2>& x) {OUT(x.fi,' ',x.se);}
template<class... T> void OUTL(const T&... t) {OUT(t..., "\n"); }
template<class H> void OUTLS(const H& h) {OUTL(h); }
template<class H, class... T> void OUTLS(const H& h, const T&... t) {OUT(h,' '); OUTLS(t...); }
 
//===================//
//  Added libraries  //
//===================//
 
//===================//
//end added libraries//
//===================//
 
void program();
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    program();
}
 
 
//===================//
//   begin program   //
//===================//
 
const int MX = 3e5+1e4;
 
int n, m, mxbc;
ll p[MX];
vii adj[MX];
int a[MX], b[MX];
ll dp[MX][101];
int skip[MX][101];
int skipe[MX][101];
lll best[MX][101];
int bestU[MX][101];
ll SM[MX];
 
lll push(lll p, ll v) {
    return {max(p.fi,v), max(p.se,min(p.fi,v))};
}
ll getAns(int e, int bc);
void fillBest(int e, int bc) {
    int u = b[e];
    if(best[u][bc].fi != -1 && skip[u][bc] == -1) return;
    if(best[u][bc].fi != -1 && skip[u][bc] == a[e]) return;
 
    if(best[u][bc].fi != -1) {
        ll res = getAns(skipe[u][bc], bc);
        best[u][bc] = push(best[u][bc], res);
        if(best[u][bc].fi == res) bestU[u][bc] = skip[u][bc];
        skip[u][bc] = -1;
    } else {
        FOR(v,adj[u]) if(v.fi != a[e]) {
            ll res = getAns(v.se, bc);
            best[u][bc] = push(best[u][bc], res);
            if(best[u][bc].fi == res) bestU[u][bc] = v.fi;
        } else {
            skipe[u][bc] = v.se;
        }
        skip[u][bc] = a[e];
    }
}
ll getAns(int e, int bc) {
    if(dp[e][bc] != -1) return dp[e][bc];
    int u=a[e], v=b[e];
 
    ll sm = SM[v] - ll(u == -1 ? 0 : p[u]);
    ll ans=sm;
    fillBest(e, bc);
    fillBest(e, bc-1);
    ans = max(ans,    (bestU[v][bc] == u ? best[v][ bc].se : best[v][ bc].fi));
    ans = max(ans, sm+(bestU[v][bc-1] == u ? best[v][bc-1].se : best[v][bc-1].fi));
 
    return dp[e][bc]=ans;
}
 
void program() {
    IN(n,mxbc);
    RE(i,n) IN(p[i]);
    RE(i,n-1) {
        IN(a[i], b[i]); a[i]--; b[i]--;
        adj[a[i]].pb({b[i],i});
        adj[b[i]].pb({a[i],i+n-1});
    }
    RE(i,n-1) a[i+n-1] = b[i];
    RE(i,n-1) b[i+n-1] = a[i];
    m = (n-1)*2;
    RE(u,n) {
        SM[u] = 0;
        FOR(v,adj[u]) SM[u] += p[v.fi];
    }
 
    RE(j,m) dp[j][0] = 0;
    RE1(i,mxbc) {
        RE(j,m) dp[j][i] = -1;
        RE(j,n) best[j][i] = {-1, 0};
    }
    
    ll ans = 0;
    RE(u,n-1) {
        FOR(v,adj[u]) {
            ans = max(ans, getAns(v.se, mxbc));
            ans = max(ans, SM[u]+getAns(v.se, mxbc-1));
        }
    }
    if(mxbc == 0) ans = 0;
    OUTL(ans);
}

Subtask #1
20.0 / 20.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7680 KB Output is correct
2 Correct 5 ms 7680 KB Output is correct
3 Correct 5 ms 7680 KB Output is correct
4 Correct 6 ms 7680 KB Output is correct
5 Correct 5 ms 7680 KB Output is correct
6 Correct 5 ms 7680 KB Output is correct
7 Correct 18 ms 12116 KB Output is correct
8 Correct 9 ms 12160 KB Output is correct
9 Correct 8 ms 11648 KB Output is correct
10 Correct 10 ms 12032 KB Output is correct
11 Correct 10 ms 12032 KB Output is correct
12 Correct 9 ms 12032 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1814 ms 457300 KB Output is correct
2 Correct 1832 ms 457188 KB Output is correct
3 Correct 614 ms 410128 KB Output is correct
4 Correct 350 ms 449528 KB Output is correct
5 Correct 1860 ms 446216 KB Output is correct
6 Correct 1965 ms 448296 KB Output is correct
7 Correct 1936 ms 448216 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7680 KB Output is correct
2 Correct 5 ms 7680 KB Output is correct
3 Correct 5 ms 7680 KB Output is correct
4 Correct 6 ms 7680 KB Output is correct
5 Correct 5 ms 7680 KB Output is correct
6 Correct 5 ms 7680 KB Output is correct
7 Correct 18 ms 12116 KB Output is correct
8 Correct 9 ms 12160 KB Output is correct
9 Correct 8 ms 11648 KB Output is correct
10 Correct 10 ms 12032 KB Output is correct
11 Correct 10 ms 12032 KB Output is correct
12 Correct 9 ms 12032 KB Output is correct
13 Correct 1814 ms 457300 KB Output is correct
14 Correct 1832 ms 457188 KB Output is correct
15 Correct 614 ms 410128 KB Output is correct
16 Correct 350 ms 449528 KB Output is correct
17 Correct 1860 ms 446216 KB Output is correct
18 Correct 1965 ms 448296 KB Output is correct
19 Correct 1936 ms 448216 KB Output is correct
20 Correct 1724 ms 448248 KB Output is correct
21 Correct 142 ms 174840 KB Output is correct
22 Correct 1787 ms 447992 KB Output is correct
23 Correct 369 ms 451448 KB Output is correct
24 Correct 2174 ms 448504 KB Output is correct
25 Correct 632 ms 411916 KB Output is correct
26 Correct 1789 ms 459420 KB Output is correct
27 Correct 1829 ms 459512 KB Output is correct