Submission #558485

#	Time	Username	Problem	Language	Result	Execution time	Memory
558485		kym	Worst Reporter 4 (JOI21_worst_reporter4)	C++14	79 / 100	543 ms	192564 KiB

worst_reporter2

#include <bits/stdc++.h>
using namespace std;
#define int ll 
#define FOR(i,s,e) for(ll i = s; i <= (ll)e; ++i)
#define DEC(i,s,e) for(ll i = s; i >= (ll)e; --i)
#define IAMSPEED ios_base::sync_with_stdio(false); cin.tie(0);
#ifdef LOCAL
#define db(x) cerr << #x << "=" << x << "\n"
#define db2(x, y) cerr << #x << "=" << x << " , " << #y << "=" << y << "\n"
#define db3(a,b,c) cerr<<#a<<"="<<a<<","<<#b<<"="<<b<<","<<#c<<"="<<c<<"\n"
#define dbv(v) cerr << #v << ":"; for (auto ite : v) cerr << ite << ' '; cerr <<"\n"
#define dbvp(v) cerr << #v << ":"; for (auto ite : v) cerr << "{"  << ite.f << ',' << ite.s << "} "; cerr << "\n"
#define dba(a,ss,ee) cerr << #a << ":"; FOR(ite,ss,ee) cerr << a[ite] << ' '; cerr << "\n"
#define reach cerr << "LINE: " << __LINE__ << "\n";
#else
#define db(x)
#define db2(x,y)
#define db3(a,b,c)
#define dbv(v)
#define dbvp(v)
#define dba(a,ss,ee)
#define reach 
#endif
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define ll long long 
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define f first
#define s second
#define g0(x) get<0>(x)
#define g1(x) get<1>(x)
#define g2(x) get<2>(x)
#define g3(x) get<3>(x)
typedef pair <ll, ll> pi;
typedef tuple<ll,ll,ll> ti3;
typedef tuple<ll,ll,ll,ll> ti4;
ll rand(ll a, ll b) { return a + rng() % (b-a+1); }
const int MOD = 1e9 + 7;
const int inf = (int)1e9 + 500;
const long long oo = (ll)1e18 + 500;
template <typename T> void chmax(T& a, const T b) { a=max(a,b); }
template <typename T> void chmin(T& a, const T b) { a=min(a,b); }
const int MAXN = 200005;
int n;
int A[MAXN], H[MAXN], C[MAXN];
vector<int>V[MAXN];
map<int,int> M[MAXN];

void dfs(int x, int p) {
	for(auto v:V[x])if(v!=p) {
		dfs(v,x);
		if(M[v].size() > M[x].size())swap(M[x], M[v]);
		for(auto i:M[v])M[x][i.f] += i.s;
	}
	M[x][0] += C[x];
	M[x][H[x]] -= C[x];
	M[x][H[x]+1] += C[x];
	auto it=M[x].find(H[x]);
	while(it->s < 0) {
		int t=min(-it->s, prev(it)->s);
		(*it).s += t;
		if((*it).s == 0)(*(prev(it))).s -= t;
		else M[x].erase(prev(it));
	}
}

int32_t main() 
{
	IAMSPEED
	cin >> n;
	reach
	FOR(i,1,n) cin >> A[i] >> H[i] >> C[i];
	FOR(i,1,n) {
		if(i!=A[i])V[A[i]].pb(i);
	}
	
	dfs(1,-1);
	cout << M[1][0];
}

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