Submission #1361037

#	Time	Username	Problem	Language	Result	Execution time	Memory
1361037		eyadooz	Magic Tree (CEOI19_magictree)	C++20	Compilation error	0 ms	0 KiB

magictree

#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 f[200005], a[200005], dp[200005][2];
vector<int> adj[200005];
void init(int x, int p=-1) 
{
    if(a[x]==1) dp[x][1]+=f[x];
    else dp[x][2]+=f[x];
    for(auto i : adj[x]) 
    {
        if(i==p) continue;
        init(i, x);
        dp[x][2]+=max(dp[i][1], dp[i][2]);
        dp[x][1]+=dp[i][1];
    }
}
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;
        f[v]=w;
        sum+=w;
    }
    if(k<=2) 
    {
        init(1);
        cout << max(dp[1][1], dp[1][2])<< endl;
        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);
}   
    

Compilation message (stderr)

magictree.cpp:27:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   27 | main()
      | ^~~~
magictree.cpp: In function 'int main()':
magictree.cpp:47:10: error: invalid types 'bool[long long int]' for array subscript
   47 |         f[v]=w;
      |          ^