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+;
 int head[N],tot,cost[N],used[N];
 struct nodes
 {
     int to,next;
 } Edge[N*];

 void init()
 {
     tot = ;
     memset(head,-,sizeof(head));
     memset(used,,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 != -; i = Edge[i].next)
     {
         int to = Edge[i].to;
         if(!used[to])
         {
             used[to] = ;
             int aft = dfs(to);
             cost[cur] += aft;
             sum += abs(aft);
         }
     }
     int ans = cost[cur] - ;
     cost[cur] = ;
     return ans;
 }

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

     printf("%d\n",sum);
 }

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