Codeforces Contest 1099 problem D Sum in the tree——树上前缀和最小值

Mitya has a rooted tree with n vertices indexed from 1 to n, where the root has index 1. Each vertex v initially had an integer number av≥0 written on it. For every vertex v Mitya has computed sv: the sum of all values written on the vertices on the path from vertex v to the root, as well as hv — the depth of vertex v, which denotes the number of vertices on the path from vertex v to the root. Clearly, s1=a1 and h1=1.

Then Mitya erased all numbers av, and by accident he also erased all values sv for vertices with even depth (vertices with even hv). Your task is to restore the values av for every vertex, or determine that Mitya made a mistake. In case there are multiple ways to restore the values, you’re required to find one which minimizes the total sum of values av for all vertices in the tree.

Input
The first line contains one integer n — the number of vertices in the tree (2≤n≤105). The following line contains integers p2, p3, … pn, where pi stands for the parent of vertex with index i in the tree (1≤pi<i). The last line contains integer values s1, s2, …, sn (−1≤sv≤109), where erased values are replaced by −1.

Output
Output one integer — the minimum total sum of all values av in the original tree, or −1 if such tree does not exist.

Examples
inputCopy
5
1 1 1 1
1 -1 -1 -1 -1
outputCopy
1
inputCopy
5
1 2 3 1
1 -1 2 -1 -1
outputCopy
2
inputCopy
3
1 2
2 -1 1
outputCopy
-1

题意：

给你一棵树，和所有的前缀，但是偶数度的前缀擦掉了，让你复原使得所有节点的值和最小。

题解：

偶数度的点，在不违反条件的情况下要达到最大，那么就是取得所有儿子节点的最小值，我们设所有偶数度的节点为1e9+1，那么如果最后一排是偶数度的就可以判掉了。

#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N=1e5+5;
int fa[N],d[N];
ll s[N];
int main()
{
    d[1]=1;
    int n;
    scanf("%d",&n);
    for(int i=2;i<=n;i++)
        scanf("%d",&fa[i]),d[i]=d[fa[i]]+1;
    for(int i=1;i<=n;i++)
    {
        scanf("%lld",&s[i]);
        if(s[i]==-1)
            s[i]=1e9+1;
    }
    for(int i=2;i<=n;i++)
        if(d[i]%2)
            s[fa[i]]=min(s[fa[i]],s[i]);
    ll ans=0;
    for(int i=1;i<=n;i++)
    {
        if(s[i]<s[fa[i]])
            return 0*printf("-1\n");
        if(s[i]==1e9+1)
            continue;
        ans+=s[i]-s[fa[i]];
    }
    printf("%lld\n",ans);
    return 0;
}