HDU - 6409 没有兄弟的舞会 （ STL

题意：

考虑对每个节点维护一个set 标记 然后就是维护最大最小值 xjb搞搞

#include <bits/stdc++.h>
using namespace std;

#define cpp_io() {ios::sync_with_stdio(false); cin.tie(NULL);}
#define rep(i,a,n) for (int i=a;i<n;i++)
#define repp(i,a,n) for (int i=a;i<=n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define CLR(a,b) memset(a,(b),sizeof(a))
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ls o<<1
#define rs o<<1|1


typedef long long ll;
typedef vector<int> VI;
const int MAXN = (int)1e5+10;
const int INF = 0x3f3f3f3f;
const int mod = (int)1e9+7;

void F() {
#ifndef ONLINE_JUDGE
    freopen("in.txt","r",stdin);
    freopen("out.txt","w",stdout);
#endif
}
ll fa[MAXN],a[MAXN];
set<ll> st[MAXN];
int main() {
    cpp_io();
    int T; cin>>T;
    while(T--) {
        int n; cin>>n;
        repp(i,2,n) cin>>fa[i];
        repp(i,1,n) {
            cin>>a[i]; st[fa[i]].insert(a[i]);
        }
        ll ans1=0,ans2=0;
        ll mx=0, mn=0;
        repp(i,0,n) {
            if(SZ(st[i])==1) {
                auto it=st[i].begin();
                if(*it>0) ans1+=*it;
                if(*it<0) ans2+=*it;
            }
            if(SZ(st[i])>=2) {
                auto it=--st[i].end();
                if(*it>0) ans1+=*it;
                it--;
                mx=max(mx,*it);

                it=st[i].begin();
                if(*it<0) ans2+=*it;
                it++;
                mn=min(mn,*it);
            }
        }
        ans1+=mx; ans2+=mn;
        cout<<ans1<<" "<<ans2<<endl;
        repp(i,0,n) st[i].clear();

    }
    return 0;
}