Submission #406166

#	Time	Username	Problem	Language	Result	Execution time	Memory
406166		dvdg6566	Worst Reporter 4 (JOI21_worst_reporter4)	C++14	0 / 100	12 ms	5324 KiB

worst_reporter2

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pi;
typedef vector<ll> vi;
typedef vector<pi> vpi;
#define pb emplace_back
#define f first 
#define s second
#define mp make_pair
#define SZ(x) (ll)x.size()
#define ALL(x) x.begin(),x.end()
#define lb lower_bound
#define ub upper_bound

const int MAXN = 200100;
const int MAXK = 19;
int p[MAXN];
int H[MAXN],C[MAXN];
int N;
vi V[MAXN];
vi roots;
ll ans;
ll dp1[MAXN];

ll calc(ll x,ll c){
	ll r=0;
	if(H[x]>=c)r=C[x];
	for(auto v:V[x])r=max(r,calc(v,c));
	return r;
}

ll solve(int x){
	ll r1=0;
	for(auto v:V[x])r1+=solve(v);
	// if you choose to continue, everything else chosen must be not less
	ll tx=C[x];
	for(auto v:V[x]){
		// cerr<<"Calc "<<v<<' '<<calc(v,H[x])<<'\n';
		tx+=calc(v,H[x]);
	}
	// cerr<<"DP "<<x<<' '<<tx<<' '<<r1<<'\n';
	dp1[x]=tx;
	// if(x==2)exit(0);
	return max(tx,r1);
}

int main(){
	cin>>N;
	for(int i=1;i<=N;++i){
		cin>>p[i]>>H[i]>>C[i];
		if(p[i]==i){
			p[i]=-1;
			roots.pb(i);
		}else V[p[i]].pb(i);
		ans+=C[i];
	}
	for(auto i:roots){
		ans-=solve(i);
	}
	cout<<ans;
}

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