Submission #417262

#	Time	Username	Problem	Language	Result	Execution time	Memory
417262		lyc	Worst Reporter 4 (JOI21_worst_reporter4)	C++14	14 / 100	133 ms	1484 KiB

worst_reporter2

#include <bits/stdc++.h>
using namespace std;

#define TRACE(x) cerr << #x << " :: " << x << endl
#define _ << " " <<
#define SZ(x) (int)(x).size()
#define ALL(x) (x).begin(),(x).end()
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define RFOR(i,a,b) for(int i=(a);i>=(b);--i)
typedef long long ll;

//const int mxN = 2e5+5;
const int mxN = 5e3+5;
const ll inf = 1e18;

int N, A[mxN], H[mxN], C[mxN];
vector<int> al[mxN];

ll dp[mxN], sum[mxN];

ll best(int u, int x) {
    ll ret = 0;
    for (int v : al[u]) {
        ret += best(v,x);
    }

    if (H[x] <= H[u]) {
        ret = min(ret, dp[u]-sum[u]);
    }
    return ret;
}

void dfs(int u) {
    sum[u] = 0;
    dp[u] = 0;
    for (int v : al[u]) {
        dfs(v);
        sum[u] += sum[v];
        dp[u] += best(v,u);
    }
    dp[u] += sum[u];
    sum[u] += C[u];
}

int main() {
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);

    cin >> N;
    FOR(i,1,N){
        cin >> A[i] >> H[i] >> C[i];
        if (i != 1) al[A[i]].push_back(i);
    }

    H[0] = 1;
    dfs(1);
    cout << sum[1] + best(1,0) << '\n';
}

• Subtask 1: 14 / 14
• Subtask 2: 0 / 65
• Subtask 3: 0 / 21