oj.uz

Submission #162584

# Submission time Handle Problem Language Result Execution time Memory
162584 2019-11-08T20:27:45 Z darkkcyan Biochips (IZhO12_biochips) C++14
100 / 100
 385 ms 13240 KB 
#include <bits/stdc++.h>
using namespace std;
using namespace std::placeholders;

#define llong long long 
#define xx first
#define yy second
#define len(x) ((int)x.size())
#define rep(i,n) for (int i = -1; ++ i < n; )
#define rep1(i,n) for (int i = 0; i ++ < n; )
#define all(x) x.begin(), x.end()
// #define rand __rand
// mt19937 rng(chrono::system_clock::now().time_since_epoch().count());  // or mt19937_64
// template<class T = int> T rand(T range = numeric_limits<T>::max()) {
    // return (T)(rng() % range);
// }

#define maxn 200010
int n, m;
int a[maxn];
vector<int> gr[maxn];

vector<int> topo_a, prev_pos;
void dfs(int u) {
    int t = len(topo_a);
    for (auto v: gr[u]) {
        dfs(v);
    }
    topo_a.push_back(a[u]);
    prev_pos.push_back(t);
}

llong dp[2][maxn];
int main(void) {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n >> m;

    rep1(i, n) {
        int p; cin >> p >> a[i];
        gr[p].push_back(i);
    }

    dfs(0);

    memset(dp[0], 0, sizeof dp[0]);

    rep1(i, m) {
        dp[i & 1][0] = INT_MIN;
        rep(u, n) {
            dp[i & 1][u + 1] = max(dp[i & 1][u], dp[~i & 1][prev_pos[u]] + topo_a[u]);
        }
    }

    cout << dp[m & 1][n];

    return 0;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 6648 KB Output is correct
2 Correct 7 ms 6648 KB Output is correct
3 Correct 7 ms 6648 KB Output is correct
4 Correct 12 ms 7032 KB Output is correct
5 Correct 13 ms 7032 KB Output is correct
6 Correct 31 ms 7032 KB Output is correct
7 Correct 202 ms 12232 KB Output is correct
8 Correct 200 ms 12324 KB Output is correct
9 Correct 298 ms 12728 KB Output is correct
10 Correct 385 ms 13240 KB Output is correct