FFF at Valentine(强连通分量缩点+拓扑排序)

FFF at Valentine

Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 730    Accepted Submission(s): 359

Problem Description

At Valentine's eve, Shylock and Lucar were enjoying their time as any other couples. Suddenly, LSH, Boss of FFF Group caught both of them, and locked them into two separate cells of the jail randomly. But as the saying goes: There is always a way out , the lovers made a bet with LSH: if either of them can reach the cell of the other one, then LSH has to let them go.
The jail is formed of several cells and each cell has some special portals connect to a specific cell. One can be transported to the connected cell by the portal, but be transported back is impossible. There will not be a portal connecting a cell and itself, and since the cost of a portal is pretty expensive, LSH would not tolerate the fact that two portals connect exactly the same two cells.
As an enthusiastic person of the FFF group, YOU are quit curious about whether the lovers can survive or not. So you get a map of the jail and decide to figure it out.

Input

∙Input starts with an integer T (T≤120), denoting the number of test cases.
∙For each case,
First line is two number n and m, the total number of cells and portals in the jail.(2≤n≤1000,m≤6000)
Then next m lines each contains two integer u and v, which indicates a portal from u to v.

Output

If the couple can survive, print “I love you my love and our love save us!”
Otherwise, print “Light my fire!”

Sample Input

3

5 5

1 2

2 3

2 4

3 5

4 5

 

 

3 3

1 2

2 3

3 1

 

5 5

1 2

2 3

3 1

3 4

4 5

Sample Output

Light my fire!

I love you my love and our love save us!

I love you my love and our love save us!

Source

2017 Multi-University Training Contest - Team 9

//题意:给出一个有向图，问是否任意两点都可以有，至少从其中一点到另一点可行的路径

//题解:首先想到的是好像是问是否是强连通图，然后看清题后发现并不是，求出连通分量缩点后变为有向无环图后，只需要确定，有唯一的拓扑排序的结果即可

 # include <cstring>
 # include <cstdio>
 # include <cstdlib>
 # include <iostream>
 # include <vector>
 # include <queue>
 # include <stack>
 # include <map>
 # include <bitset>
 # include <sstream>
 # include <set>
 # include <cmath>
 # include <algorithm>
 # pragma  comment(linker,"/STACK:102400000,102400000")
 using namespace std;
 # define LL          long long
 # define pr          pair
 # define mkp         make_pair
 # define lowbit(x)   ((x)&(-x))
 # define PI          acos(-1.0)
 # define INF         0x3f3f3f3f3f3f3f3f
 # define eps         1e-
 # define MOD         

 inline int scan() {
     int x=,f=; char ch=getchar();
     while(ch<''||ch>''){if(ch=='-') f=-; ch=getchar();}
     while(ch>=''&&ch<=''){x=x*+ch-''; ch=getchar();}
     return x*f;
 }
 inline void Out(int a) {
     if(a<) {putchar('-'); a=-a;}
     if(a>=) Out(a/);
     putchar(a%+'');
 }
 const int N = ;
 const int M = ;
 /**************************/
 struct Edge
 {
     int to;
     int nex;
 }edge[M*];
 int n,m,realm,scc,Ddex;
 int hlist[N],hlist2[N];
 int dfn[N],low[N],belong[N];
 bool instk[N];
 stack<int> stk;
 int indu[N];

 void addedge(int u,int v)
 {
     edge[realm] = (Edge){v,hlist[u]};
     hlist[u]=realm++;
 }
 void addedge2(int u,int v)
 {
     edge[realm] = (Edge){v,hlist2[u]};
     hlist2[u]=realm++;
 }

 void Init_tarjan()
 {
     Ddex=;scc=;
     memset(dfn,,sizeof(dfn));
     memset(instk,,sizeof(instk));
 }

 void tarjan(int u)
 {
     dfn[u]=low[u]=++Ddex;
     stk.push(u); instk[u]=;
     for (int i=hlist[u];i!=-;i=edge[i].nex)
     {
         int v = edge[i].to;
         if (!dfn[v])
         {
             tarjan(v);
             low[u] =  min(low[u],low[v]);
         }
         else if (instk[v])
                 low[u] = min(low[u],dfn[v]);
     }
     if (dfn[u]==low[u])
     {
         scc++;
         while(){
             int p = stk.top(); stk.pop();
             instk[p]=;
             belong[p]=scc;
             if (u==p) break;
         }
     }
 }

 void build()
 {
     memset(hlist2,-,sizeof(hlist2));
     memset(indu,,sizeof(indu));
     for (int i=;i<=n;i++)
     {
         for (int j=hlist[i];j!=-;j=edge[j].nex)
         {
             int x = belong[i];
             int y = belong[edge[j].to];
             if (x!=y)
             {
                 addedge2(x,y);
                 indu[y]++;
             }
         }
     }
 }

 int topo()
 {
     queue<int> Q;
     for (int i=;i<=scc;i++)
         if (indu[i]==) Q.push(i);
     if (Q.size()!=) return ;
     while (!Q.empty())
     {
         int u = Q.front(); Q.pop();
         for (int i=hlist2[u];i!=-;i=edge[i].nex)
         {
             int v = edge[i].to;
             indu[v]--;
             if (indu[v]==)
                 Q.push(v);
         }
         if (Q.size()>) return ;
     }
     return ;
 }

 int main()
 {
     int T = scan();
     while (T--)
     {
         memset(hlist,-,sizeof(hlist));
         realm=;
         scanf("%d%d",&n,&m);
         for (int i=;i<m;i++)
         {
             int u,v;
             scanf("%d%d",&u,&v);
             addedge(u,v);
         }
         Init_tarjan();
         for (int i=;i<=n;i++)
             if (!dfn[i])
                 tarjan(i);
         build();//建新图
         if (topo())//拓扑
             printf("I love you my love and our love save us!\n");
         else
             printf("Light my fire!\n");
     }
     return ;
 }