light oj 1219 树上贪心

#include <iostream>
#include <cstdlib>
#include <cstring>
#include <queue>
#include <cstdio>
#include <algorithm>
#include <map>
//#include <time.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define LL long long

using namespace std;
//using namespace __gnu_pbds;
const int N = 1e4+10;
int head[N],tot,cost[N],used[N];
struct nodes
{
    int to,next;
} Edge[N*2];

void init()
{
    tot = 0;
    memset(head,-1,sizeof(head));
    memset(used,0,sizeof(used));
}

void add(int u,int v)
{
    Edge[tot].to = v;
    Edge[tot].next = head[u];
    head[u] = tot++;
}

int sum;

int dfs(int cur)
{
    for(int i = head[cur]; i != -1; i = Edge[i].next)
    {
        int to = Edge[i].to;
        if(!used[to])
        {
            used[to] = 1;
            int aft = dfs(to);
            cost[cur] += aft;
            sum += abs(aft);
        }
    }
    int ans = cost[cur] - 1;
    cost[cur] = 1;
    return ans;
}

void solve()
{
    int n;
    scanf("%d",&n);
    init();
    for(int i = 0; i < n; i++)
    {
        int th,m;
        scanf("%d",&th);
        scanf("%d %d",&cost[th],&m);
        for(int j = 0; j < m; j++)
        {
            int v;
            scanf("%d",&v);
            add(th,v);
            add(v,th);
        }
    }
    sum = 0;
    used[1] = 1;
    int ans = dfs(1);

    printf("%d
",sum);
}

int main(void)
{
    int t,cnt = 0;
    scanf("%d",&t);
    while(t--)
    {
        printf("Case %d: ",++cnt);
        solve();
    }
    return 0;
}