Exchanging Gifts--2019CCPC哈尔滨 E题

题意：http://codeforces.com/gym/102394/problem/E

1操作是给你一串数，2操作是连结两个串（所以可能很长），问你最后一个串的值（知道最多的个数就很好算，关键计算个数）

思路：

对二操作建图，一开始还以为建出来的是树就可以直接BFS计算次数，自闭了好久，最后才发现是拓扑图，一点点扒点才行。

离散化加统计个数啥的导致代码冗长，奇奇怪怪的数组贼多。

 #define IOS ios_base::sync_with_stdio(0); cin.tie(0);
 #include <cstdio>//sprintf islower isupper
 #include <cstdlib>//malloc  exit strcat itoa system("cls")
 #include <iostream>//pair
 #include <fstream>//freopen("C:\\Users\\13606\\Desktop\\Input.txt","r",stdin);
 #include <bitset>
 //#include <map>
 #include<unordered_map>
 #include <vector>
 #include <stack>
 #include <set>
 #include <string.h>//strstr substr
 #include <string>
 #include <time.h>// srand(((unsigned)time(NULL))); Seed n=rand()%10 - 0~9;
 #include <cmath>
 #include <deque>
 #include <queue>//priority_queue<int, vector<int>, greater<int> > q;//less
 #include <vector>//emplace_back
 //#include <math.h>
 #include <cassert>
 //#include <windows.h>//reverse(a,a+len);// ~ ! ~ ! floor
 #include <algorithm>//sort + unique : sz=unique(b+1,b+n+1)-(b+1);+nth_element(first, nth, last, compare)
 using namespace std;//next_permutation(a+1,a+1+n);//prev_permutation
 //******************
 int abss(int a);
 int lowbit(int n);
 int Del_bit_1(int n);
 int maxx(int a,int b);
 int minn(int a,int b);
 double fabss(double a);
 void swapp(int &a,int &b);
 clock_t __STRAT,__END;
 double __TOTALTIME;
 void _MS(){__STRAT=clock();}
 void _ME(){__END=clock();__TOTALTIME=(double)(__END-__STRAT)/CLOCKS_PER_SEC;cout<<"Time: "<<__TOTALTIME<<" s"<<endl;}
 //***********************
 #define rint register int
 #define fo(a,b,c) for(rint a=b;a<=c;++a)
 #define fr(a,b,c) for(rint a=b;a>=c;--a)
 #define mem(a,b) memset(a,b,sizeof(a))
 #define pr printf
 #define sc scanf
 #define ls rt<<1
 #define rs rt<<1|1
 typedef pair<int,int> PII;
 typedef vector<int> VI;
 typedef long long ll;
 const double E=2.718281828;
 const double PI=acos(-1.0);
 const ll INF=(1LL<<);
 const int inf=(<<);
 const double ESP=1e-;
 const int mod=(int)1e9+;
 const int N=(int)1e6+;

 int a[N],b[N],in[N];
 ll much[N];
 ll mark[N];
 void LS(int n)
 {
     int m=;
     for(int i=;i<=n;++i)
         b[++m]=a[i];
     sort(b+,b++m);
     m=unique(b+,b++m)-b-;
     for(int i=;i<=n;++i)
         a[i]=lower_bound(b+,b++m,a[i])-b;
     return;
 }
 vector<vector<int> >arr(N);
 struct node
 {
     int to,next;
     ll val;
 }edge[N*];
 int head[N];
 ll val[N];
 bool is[N];
 int tot;
 void Init(int n)
 {
     tot=;
     for(int i=;i<=n;++i)
         val[i]=in[i]=head[i]=is[i]=;
 }
 void add(int from,int to)
 {
     ++tot;
     edge[tot].to=to;
 //    edge[tot].val=val;
     edge[tot].next=head[from];
     head[from]=tot;
 }

 queue<int>q;
 void bfs(int start)
 {
     q.push(start);
     while(!q.empty())
     {
         int now=q.front();q.pop();
         is[now]=;
         for(int i=head[now];i!=;i=edge[i].next)
         {
             int to=edge[i].to;
             in[to]++;
             if(!is[to])
             {
                 is[to]=;
                 q.push(to);
             }
         }
     }
 }
 void topu(int x)
 {
     q.push(x);
     val[x]=;
     while(!q.empty())
     {
         int now=q.front();q.pop();
         for(int i=head[now];i!=;i=edge[i].next)
         {
             int to=edge[i].to;
             in[to]--;
             val[to]+=val[now];
             if(in[to]==)
                 q.push(to);
         }
     }
 }

 void solve()
 {
     int n;
     sc("%d",&n);
     Init(n);
     for(int i=;i<=n;++i)
     {
         int J;
         sc("%d",&J);
         if(J==)
         {
             int num;
             sc("%d",&num);
             for(int j=;j<=num;++j)
             {
                 int t;
                 sc("%d",&t);
                 arr[i].push_back(t);
             }
         }
         else
         {
             int u,v;
             sc("%d%d",&u,&v);
             add(i,u),add(i,v);
         }
     }
     bfs(n);
     topu(n);
     int num=;
     for(int i=;i<=n;++i)
     {
         if(is[i])
         {
             int sz=arr[i].size();
             for(int j=;j<sz;++j)
                 a[++num]=arr[i][j],much[num]=val[i];
         }
     }
     LS(num);
     for(int i=;i<=num;++i)
         mark[i]=;
     for(int i=;i<=num;++i)
         mark[a[i]]+=much[i];
     ll max_=,sum=;
     for(int i=;i<=num;++i)
         max_=max(max_,mark[i]),sum+=mark[i];
     ll ans=;
     if(max_>sum-max_)
         ans=*(sum-max_);
     else
         ans=sum;
     pr("%lld\n",ans);
     for(int i=;i<=n;++i)
         arr[i].clear();
 }

 int main()
 {
     int T;
     sc("%d",&T);
     while(T--)solve();
     return ;
 }

 /**************************************************************************************/

 int maxx(int a,int b)
 {
     return a>b?a:b;
 }

 void swapp(int &a,int &b)
 {
     a^=b^=a^=b;
 }

 int lowbit(int n)
 {
     return n&(-n);
 }

 int Del_bit_1(int n)
 {
     return n&(n-);
 }

 int abss(int a)
 {
     return a>?a:-a;
 }

 double fabss(double a)
 {
     return a>?a:-a;
 }

 int minn(int a,int b)
 {
     return a<b?a:b;
 }