Submission #518928

#	Time	Username	Problem	Language	Result	Execution time	Memory
518928		Keshi	Worst Reporter 4 (JOI21_worst_reporter4)	C++17	14 / 100	139 ms	200704 KiB

worst_reporter2

//In the name of God
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
 
const int maxn = 5100;
const int mod = 1e9 + 7;
const int inf = 1e9;
 
#define fast_io ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file_io freopen("input.txt", "r+", stdin);freopen("output.txt", "w+", stdout);
#define pb push_back
#define Mp make_pair
#define F first
#define S second
#define Sz(x) ll((x).size())
#define all(x) (x).begin(), (x).end()
 
ll pw(ll a, ll b){
	ll c = 1;
	while(b){
		if(b & 1) c = c * a % mod;
		a = a * a % mod;
		b >>= 1;
	}
	return c;
}
 
int n, a[maxn], h[maxn], c[maxn];
vector<int> g[maxn];
vector<int> vec;
ll dp[maxn][maxn];
 
void solve(int v){
	for(int u : g[v]){
		solve(u);
		for(int i = 0; i <= n; i++){
			dp[v][i] += dp[u][i];
		}
	}
	ll x = dp[v][h[v]] + c[v];
	for(int i = h[v]; i <= n; i++){
		dp[v][i] = max(dp[v][i], x);
	}
	return;
}
 
int main(){
	fast_io;
	
	cin >> n;
	ll sc = 0;
	for(int i = 1; i <= n; i++){
		cin >> a[i] >> h[i] >> c[i];
		vec.pb(h[i]);
		if(i != 1) g[a[i]].pb(i);
		sc += c[i];
	}
	sort(all(vec));
	vec.resize(unique(all(vec)) - vec.begin());
	for(int i = 1; i <= n; i++){
		h[i] = Sz(vec) - 1 - (lower_bound(all(vec), h[i]) - vec.begin());
	}
	solve(1);
	cout << sc - dp[1][n] << "\n";
	
	return 0;
}

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