//Bismillahirrahmanirrahim
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█▄█
//█─█─█▄─█▄─█─█─█─█
#include <bits/stdc++.h>
using namespace std;
typedef long long lo;
typedef pair< lo,lo > PII;
#define fi first
#define se second
#define int long long
#define mp make_pair
#define endl "\n"
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)
const lo inf = 1000000000000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 100005;
const lo mod = 1000000007;
int n,m,b[li],a[li],k,flag,t,dp[li][25],tree[li*4],cevap,st[li],en[li],dp1[li],sayac;
int cev;
string s;
PII p[li];
vector<int> v[li];
vector<PII> vec;
inline void dfs(int node,int ata){
for(int i=0;i<(int)v[node].size();i++){
int go=v[node][i];
if(go==ata)continue;
dfs(go,node);
}
if(p[node].fi!=0){
for(int i=p[node].fi;i<=p[node].fi;i++){
dp[node][i]=max(dp[node][i],(dp[node][p[node].fi]+p[node].se));
}
}
for(int i=1;i<=k;i++)dp[node][i]=max(dp[node][i],dp[node][i-1]);
//~ cout
for(int i=1;i<=k;i++){
dp[ata][i]+=(dp[node][i]);
}
}
inline void update(int node,int start,int end,int l,int r,int val){
if(start>end || start>r || end<l)return ;
if(start>=l && end<=r){tree[node]+=val;return ;}
update(node*2,start,mid,l,r,val),update(node*2+1,mid+1,end,l,r,val);
tree[node]=tree[node*2]+tree[node*2+1];
}
inline int query(int node,int start,int end,int l,int r){
if(start>end || start>r || end<l)return 0;
if(start>=l && end<=r)return tree[node];
return query(node*2,start,mid,l,r)+query(node*2+1,mid+1,end,l,r);
}
inline void solve(int node,int ata){
for(int i=0;i<(int)v[node].size();i++){
int go=v[node][i];
if(go==ata)continue;
solve(go,node);
}
if(p[node].fi!=0){
update(1,1,n,p[node].fi,p[node].fi,p[node].se);
cevap=max(cevap,query(1,1,n,1,p[node].fi));
}
}
inline void dfs4(int node,int ata){
st[node]=++sayac;
en[node]=sayac;
for(int i=0;i<(int)v[node].size();i++){
int go=v[node][i];
if(go==ata)continue;
dfs4(go,node);
en[node]=max(en[node],en[go]);
}
}
inline void dfs3(int node,int ata){
for(int i=0;i<(int)v[node].size();i++){
int go=v[node][i];
if(go==ata)continue;
dfs3(go,node);
}
if(p[node].fi!=0){
int topl=0;
for(int i=0;i<m;i++){
PII go=vec[i];
if(st[node]<=st[go.fi] && en[node]>=en[go.fi] && p[node].fi>=go.se && go.fi!=node){
topl=max(topl,dp1[go.fi]);
}
}
dp1[node]=max(dp1[node],topl+p[node].se);
}
//~ if()dp1[ata]+=dp1[node];
//~ cout<<dp1[node]<<endl;
}
inline void LIS(){
int len=1;
b[len]=a[1];
for(int i=2;i<=m;i++){
if(a[i]<b[1])b[1]=a[i];
else if(a[i]>=b[len])b[++len]=a[i];
else{
int bas=1;
int son=len;
while(bas<=son){
if(b[ort]>a[i])son=ort-1;
else bas=ort+1;
}
b[bas]=a[i];
}
}
printf("%lld\n",len);exit(0);
}
main(void){
scanf("%lld %lld %lld",&n,&m,&k);
int yes=0,yes1=0;
for(int i=2;i<=n;i++){
int x;
scanf("%lld",&x);
v[i].pb(x);
v[x].pb(i);
if(x==i-1)yes++;
}
for(int i=1;i<=m;i++){
int x,y,z;
scanf("%lld %lld %lld",&x,&y,&z);
if(z==1)yes1++;
cev+=z;
p[x].fi=y;
p[x].se=z;
vec.pb({x,y});
}
if(k<=20){
cev=0;
dfs(1,0);
for(int i=1;i<=k;i++)cev=max(cev,dp[i][k]);
}
if(yes==n-1 && yes1==m){
sort(vec.begin(),vec.end());
reverse(vec.begin(),vec.end());
for(int i=0;i<m;i++)a[i+1]=vec[i].se;
LIS();
}
if(m<=2005){
//~ cout<<"**\n";
dfs4(1,0);
dfs3(1,0);
for(int i=0;i<m;i++){
PII go=vec[i];
dp1[1]=max(dp1[1],dp1[go.fi]);
}
printf("%lld\n",dp1[1]);
return 0;
}
printf("%lld\n",cev);
return 0;
}
Compilation message
magictree.cpp:131:10: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
131 | main(void){
| ^
magictree.cpp: In function 'int main()':
magictree.cpp:132:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
132 | scanf("%lld %lld %lld",&n,&m,&k);
| ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
magictree.cpp:136:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
136 | scanf("%lld",&x);
| ~~~~~^~~~~~~~~~~
magictree.cpp:143:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
143 | scanf("%lld %lld %lld",&x,&y,&z);
| ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
2688 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
58 ms |
9076 KB |
Output is correct |
| 2 |
Correct |
51 ms |
7416 KB |
Output is correct |
| 3 |
Correct |
79 ms |
10536 KB |
Output is correct |
| 4 |
Correct |
64 ms |
10736 KB |
Output is correct |
| 5 |
Correct |
70 ms |
10480 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
2816 KB |
Output is correct |
| 2 |
Correct |
2 ms |
2688 KB |
Output is correct |
| 3 |
Correct |
2 ms |
2816 KB |
Output is correct |
| 4 |
Correct |
68 ms |
10220 KB |
Output is correct |
| 5 |
Correct |
63 ms |
11116 KB |
Output is correct |
| 6 |
Correct |
71 ms |
10432 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
122 ms |
29412 KB |
Output is correct |
| 2 |
Correct |
120 ms |
29524 KB |
Output is correct |
| 3 |
Correct |
93 ms |
30952 KB |
Output is correct |
| 4 |
Correct |
79 ms |
29560 KB |
Output is correct |
| 5 |
Correct |
92 ms |
33512 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
2688 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
19 ms |
4352 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
2688 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
2688 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
