oj.uz

Submission #268098

# Submission time Handle Problem Language Result Execution time Memory
268098 2020-08-16T08:36:34 Z MarcoMeijer Chase (CEOI17_chase) C++14
40 / 100
 4000 ms 255692 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];

ll getAns(int e, int bc) {
    if(dp[e][bc] != -1) return dp[e][bc];
    int u=a[e], v=b[e];

    ll sm=0;
    ll ans=0;
    FOR(w,adj[v]) if(w.fi != u) sm += p[w.fi];
    FOR(w,adj[v]) if(w.fi != u) {
        ans = max(ans,    getAns(w.se, bc  )); // go to w without placing breadcrumpts
        ans = max(ans, sm+getAns(w.se, bc-1)); // go to w with placing breadcrumpt at v
    }

    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];
    RE(i,n-1) a[i+(n-1)*2] = -1;
    RE(i,n-1) b[i+(n-1)*2] = i;
    m = (n-1)*3;
    RE(i,m) RE(j,101) dp[i][j] = -1;
    RE(i,m) dp[i][0] = 0;
    
    ll ans = 0;
    RE(i,n-1) ans = max(ans, getAns(i+(n-1)*2,mxbc));
    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 6 ms 7680 KB Output is correct
4 Correct 5 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 6 ms 7680 KB Output is correct
4 Correct 5 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 13 ms 10112 KB Output is correct
8 Correct 8 ms 10112 KB Output is correct
9 Correct 34 ms 10240 KB Output is correct
10 Correct 8 ms 10112 KB Output is correct
11 Correct 8 ms 10112 KB Output is correct
12 Correct 8 ms 10112 KB Output is correct

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 871 ms 255632 KB Output is correct
2 Correct 884 ms 255692 KB Output is correct
3 Execution timed out 4043 ms 252008 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
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 6 ms 7680 KB Output is correct
4 Correct 5 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 13 ms 10112 KB Output is correct
8 Correct 8 ms 10112 KB Output is correct
9 Correct 34 ms 10240 KB Output is correct
10 Correct 8 ms 10112 KB Output is correct
11 Correct 8 ms 10112 KB Output is correct
12 Correct 8 ms 10112 KB Output is correct
13 Correct 871 ms 255632 KB Output is correct
14 Correct 884 ms 255692 KB Output is correct
15 Execution timed out 4043 ms 252008 KB Time limit exceeded
16 Halted 0 ms 0 KB -