This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
/*************************************
*    author: marvinthang             *
*    created: 09.07.2023 11:03:31`    *
*************************************/
#include <bits/stdc++.h>
using namespace std;
#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i--; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif
template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }
// end of template
const int MAX = 2e5 + 5;
int N, A[MAX], H[MAX], C[MAX];
void init(void) {
	cin >> N;
	REP(i, N) {
		cin >> A[i] >> H[i] >> C[i];
		--A[i];
	}
}
int visited[MAX];
vector <int> adj[MAX];
map <int, long long> dp[MAX];
void dfs(int u) {
	for (int v: adj[u]) {
		dfs(v);
		if (dp[u].size() < dp[v].size()) dp[u].swap(dp[v]);
		for (auto [x, y]: dp[v]) dp[u][x] += y;
	}
	dp[u][H[u]] += C[u];
	int val = C[u];
	auto it = dp[u].find(H[u]);
	while (it != dp[u].begin()) {
		it = prev(it);
		if (it->se <= val) {
			val -= it->se;
			it = dp[u].erase(it);
		} else {
			it->se -= val;
			break;
		}
	}
}
int lab[MAX];
void process(void) {
	iota(lab, lab + N, 0);
	REP(i, N) if (!visited[i]) {
		vector <int> v;
		int u = i;
		while (!visited[u]) {
			visited[u] = 1;
			v.push_back(u);
			u = A[u];
		}
		v.erase(v.begin(), find(ALL(v), u));
		if (v.empty()) continue;
		sort(ALL(v), [&] (int u, int v) { return H[u] > H[v]; });
		for (int u: v) {
			visited[u] = 2;
			lab[u] = v.back();
		}
		REP(i, (int) v.size() - 1) adj[v[i]].push_back(v[i + 1]);
		visited[v[0]] = 3;
	}
	REP(i, N) if (visited[i] == 1) adj[lab[A[i]]].push_back(i);
	long long res = accumulate(C, C + N, 0LL);
	REP(i, N) if (visited[i] == 3) {
		dfs(i);
		for (auto [u, v]: dp[i]) res -= v;
	}
	cout << res << '\n';
}
int main(void) {
	ios_base::sync_with_stdio(false); cin.tie(nullptr); // cout.tie(nullptr);
	file("worst_reporter4");
	init();
	process();
	cerr << "Time elapsed: " << TIME << " s.\n";
	return (0^0);
}
Compilation message (stderr)
worst_reporter2.cpp: In function 'int main()':
worst_reporter2.cpp:30:61: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
worst_reporter2.cpp:115:2: note: in expansion of macro 'file'
  115 |  file("worst_reporter4");
      |  ^~~~
worst_reporter2.cpp:30:94: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                                                       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
worst_reporter2.cpp:115:2: note: in expansion of macro 'file'
  115 |  file("worst_reporter4");
      |  ^~~~| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... |