| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1361043 | eyadooz | Magic Tree (CEOI19_magictree) | C++20 | 0 ms | 0 KiB |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int) (x).size()
#define endl '\n'
#define int long long
int fa[200005], a[200005], dp[200005][2];
vector<int> adj[200005];
void init(int x, int p=-1)
{
dp[x][a[x]]+=fa[x];
for(auto i : adj[x])
{
if(i==p) continue;
init(i, x);
for(int j = 1;j<=20;j++)
{
int cnt=0;
for(int k=1;k<=j;k++)
{
cnt=max(cnt, dp[i][k]);
}
dp[x][j]+=cnt;
}
}
}
main()
{
cin.tie(0) -> sync_with_stdio(0);
int n, m, k;
cin >> n >> m >> k;
int p[n+5]={}, sum=0;
bool f=0;
for(int i = 2;i <= n;i++)
{
cin>> p[i];
adj[i].pb(p[i]);
adj[p[i]].pb(i);
if(p[i]!=i-1) f=1;
}
for(int i = 0;i < m;i++)
{
int v, d, w;
cin >> v >> d >> w;
a[v]=d;
fa[v]=w;
sum+=w;
}
if(k<=20)
{
init(1);
for(int i = 0;i <= 20;i++) ans=max(ans, dp[1][i]);
cout << ans;
return 0;
}
if(f) {cout << sum;return 0;}
vector<int> v;
for(int i = n;i>=1;i--)
{
if(a[i]==0) continue;
auto it=upper_bound(all(v), a[i]);
if(it==v.end()) v.pb(a[i]);
else *it=a[i];
}
cout << sz(v);
}
