Submission #1210593

#	Time	Username	Problem	Language	Result	Execution time	Memory
1210593		PenguinsAreCute	Worst Reporter 4 (JOI21_worst_reporter4)	C++17	0 / 100	101 ms	98116 KiB

worst_reporter2

#include <bits/stdc++.h>
using namespace std;
int main() {
	int n;
	cin >> n;
	int a[n], h[n], c[n], g[n];
	for(int i=0;i<n;i++) {
		cin >> a[i] >> h[i] >> c[i];
		a[i]--;
	}
	memcpy(g,h,sizeof(g));
	sort(g,g+n);
	for(int i=0;i<n;i++)
		h[i] = lower_bound(g,g+n,h[i])-g;
	int dp[n][n];
	memset(dp,0,sizeof(dp));
	for(int i=n;i--;) {
		for(int j=0;j<n;j++)
			if(j!=h[i])
				dp[i][j] += c[i];
		for(int j=n-1;j--;)
			dp[i][j]=min(dp[i][j],dp[i][j+1]);
		if(i)
			for(int j=0;j<n;j++)
				dp[a[i]][j]+=dp[i][j];
	}
	cout << dp[0][0];
}

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