双拓扑排序 HDOJ 5098 Smart Software Installer

题目传送门

 /*
     双拓扑排序：抄的，以后来补
     详细解释：http://blog.csdn.net/u012774187/article/details/40736995
 */
 #include <cstdio>
 #include <algorithm>
 #include <iostream>
 #include <sstream>
 #include <cstring>
 #include <cmath>
 #include <string>
 #include <vector>
 #include <queue>
 #include <map>
 #include <set>
 #include <ctime>
 #include <cstdlib>
 using namespace std;

 #define lson l, mid, rt << 1
 #define rson mid + 1, r, rt << 1 | 1
 typedef long long ll;

 const int MAXN = 1e3 + ;
 const int INF = 0x3f3f3f3f;
 const double PI = acos (-1.0);
 const double EPS = 1e-;
 struct Edge
 {
     int v, nxt;
 }e[MAXN * MAXN];
 int in[MAXN], out[MAXN];
 int re[MAXN], head[MAXN];
 bool vis[MAXN];
 map<string, int> M;
 vector<int> G[MAXN];
 int ecnt, cnt;

 int TopoSort(void)
 {
     queue<int> Q1, Q2;        //Q1 !re Q2 re
     for (int i=; i<=cnt; ++i)
     {
         if (!in[i])
         {
             if (!re[i])    Q1.push (i);
             else    Q2.push (i);
         }
     }

     int ans = ;
     while (!Q1.empty () || !Q2.empty ())
     {
         if (Q1.empty () && !Q2.empty ())        //重启
         {
             ans++;
             while (!Q2.empty ())        //所有都重启安装
             {
                 Q1.push (Q2.front ());    Q2.pop ();
             }
         }
         while (!Q1.empty ())
         {
             int u = Q1.front ();    Q1.pop ();
             vis[u] = true;
             for (int i=head[u]; i!=-; i=e[i].nxt)
             {
                 int v = e[i].v;
                 if (!(--in[v]))
                 {
                     if (!re[v])    Q1.push (v);
                     else Q2.push (v);
                 }
             }
         }
     }

     return ans;
 }

 void init(void)
 {
     M.clear ();
     ecnt = cnt = ;
     memset (in, , sizeof (in));
     memset (out, , sizeof (out));
     memset (re, , sizeof (re));
     memset (head, -, sizeof (head));
     memset (vis, false, sizeof (vis));
 }

 void add_edge(int u, int v)
 {
     e[ecnt].nxt = head[u];
     e[ecnt].v = v;
     head[u] = ecnt++;
 }

 int main(void)        //HDOJ 5098 Smart Software Installer
 {
     //freopen ("I.in", "r", stdin);

     string s;
     char name[];
     int n, cas = ;    scanf ("%d", &n);    getchar (); getchar ();
     while (n--)
     {
         init ();
         while (getline (cin, s))
         {
             if (s[] == '\0')    break;
             istringstream sin (s);
             sin >> name;
             int len = strlen (name);    int flag = ;
             if (name[len-] == '*')    {flag = ;    name[len-] = '\0';}
             else name[len-] = '\0';

             string u = name, v;
             if (M.find (u) == M.end ())
                 M[u] = ++cnt;
             re[M[u]] = flag;

             while (sin >> v)
             {
                 if (M.find (v) == M.end ())
                     M[v] = ++cnt;
                 add_edge (M[v], M[u]);
                 out[M[v]]++;
                 in[M[u]]++;
             }
         }
         printf ("Case %d: %d\n", ++cas, TopoSort ());
     }

     return ;
 }

 /*
 Case 1: 1
 Case 2: 2
 */