Submission #1180154

#	Time	Username	Problem	Language	Result	Execution time	Memory
1180154		ByeWorld	Magic Tree (CEOI19_magictree)	C++20	0 / 100	2095 ms	13164 KiB

magictree

#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define int long long
#define ll long long
#define pb push_back
#define fi first
#define se second
#define lf (id<<1)
#define rg ((id<<1)|1)
#define md ((l+r)>>1)
#define ld long double
using namespace std;
typedef pair<int,int> pii;
typedef pair<int,pii> ipii;
const int MAXN = 1e5+10;
const int MAXA = 1e9;
const int INF = 2e9+100;
const int SQRT = 500;
const int LOG = 19;
const int MOD = 998244353;
void chmn(auto &a, auto b){ a = min(a, b); }
void chmx(auto &a, auto b){ a = max(a, b); }
int sum(int a, int b){ a %= MOD; b %= MOD; return (a+b)%MOD; }
void chsum(int &a, int b){ a %= MOD; b %= MOD; a = (a+b)%MOD; }
void chsub(int &a, int b){ a %= MOD; b %= MOD; a = (a+MOD-b)%MOD; }
int mul(int a, int b){ a %= MOD; b %= MOD; return a*b%MOD;}
void chmul(int &a, int b){ a = a*b%MOD; }
int expo(int a, int b){
	if(b==0) return 1;
	int te = expo(a, b/2); te = mul(te, te);
	return (b%2 ? mul(te, a) : te);
}

int n, m, k, par[MAXN], d[MAXN], w[MAXN];
vector<int> adj[MAXN]; // from root decreasing days
int opt[MAXN], val[MAXN], tot[MAXN];

void dfs(int nw){
	tot[nw] = val[nw];
	for(auto nx : adj[nw]){
		dfs(nx); tot[nw] += tot[nx];
	}
}
void era(int nw){
	val[nw] = 0;
	for(auto nx : adj[nw]) 
		era(nx);
}
signed main(){
	// ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin>>n>>m>>k;
	for(int i=2; i<=n; i++){
		cin>>par[i]; adj[par[i]].pb(i);
	}
	vector<pii> vec;
	for(int i=1; i<=m; i++){
		int id, day, wei; cin>>id>>day>>wei;
		vec.pb({day, id});
		d[id] = day; w[id] = wei;
	}
	sort(vec.rbegin(), vec.rend()); // dec day

	for(int i=0; i<vec.size(); ){
		int j = vec[i].fi; 
		vector<int>upd;
		while(i<vec.size() && vec[i].fi==j){
			upd.pb(vec[i].se);
			i++;
		}
		sort(upd.begin(), upd.end());
		for(auto id : upd){
			era(id);
			val[id] = w[id];
		}
		sort(upd.rbegin(), upd.rend()); // bawah ke atas
		dfs(1);
		vector<int>del;
		for(int id=n; id>=1; id--){
			if(opt[id]<tot[id]){
				del.pb(id);
				int nw = id, add = tot[id]-opt[id];
				while(nw != 0){
					opt[nw] += add;
					nw = par[nw];
				}
			}
		}

	// for(int i=1; i<=n; i++) cout << i << ' ' <<opt[i] << " opt\n";
	// for(int i=1; i<=n; i++) cout << i << ' ' <<val[i] << " val\n";
	// 	cout << "gan\n";
	}

	cout << opt[1] << '\n';
}

• Subtask 1: 0 / 6
• Subtask 2: 0 / 3
• Subtask 3: 0 / 11
• Subtask 4: 0 / 12
• Subtask 5: 0 / 16
• Subtask 6: 0 / 13
• Subtask 7: 0 / 22
• Subtask 8: 0 / 17