题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=6165
思路:要找的是任意两点能否到达,如果成环,环内的点肯定相互到达,所以tarjan缩点,然后拓扑排序,要找的是一条单链,所以拓扑排序每一层只能找到一个入度为0的点。
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <bitset>
#include <cmath>
#include <cctype>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <sstream>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll inff = 0x3f3f3f3f3f3f3f3f;
#define FOR(i,a,b) for(int i(a);i<=(b);++i)
#define FOL(i,a,b) for(int i(a);i>=(b);--i)
#define REW(a,b) memset(a,b,sizeof(a))
#define inf int(0x3f3f3f3f)
#define si(a) scanf("%d",&a)
#define sl(a) scanf("%I64d",&a)
#define sd(a) scanf("%lf",&a)
#define ss(a) scanf("%s",a)
#define mod int(1e9+7)
#define pb push_back
#define lc (d<<1)
#define Pll pair<ll,ll>
#define P pair<int,int>
#define pi acos(-1)
int deep,dfn[10008],low[10008],vis[10008],z[10008],b[10008],sum,tmp,n,m;
vector<int>g[10008],ne[10008];
stack<int> st;
queue<int> q;
bool as()
{
while(q.size()) q.pop();
int zz=0;
FOR(i,1,sum) if(!b[i]) q.push(i),zz++;
if(zz>1) return 0;
while(q.size())
{
int v=q.front();q.pop();zz=0;
for(int i=0;i<ne[v].size();i++)
{
b[ne[v][i]]--;
if(!b[ne[v][i]]) q.push(ne[v][i]),zz++;
}
if(zz>1) return 0;
}
return 1;
}
void tarjan(int u)
{
dfn[u]=low[u]=++deep;
vis[u]=1,st.push(u);
for(int i=0;i<g[u].size();i++)
{
int v=g[u][i];
if(!dfn[v])
{
tarjan(v);
low[u]=min(low[u],low[v]);
}
else if(vis[v]) low[u]=min(low[u],dfn[v]);
}
if(dfn[u]==low[u])
{
sum++,tmp=0;
while(tmp!=u)
{
tmp=st.top();st.pop();
z[tmp]=sum;
vis[tmp]=0;
}
}
}
int main()
{
cin.tie(0);
cout.tie(0);
int t;
si(t);
while(t--)
{
cin>>n>>m;
int x,y;
FOR(i,1,n) g[i].clear(),ne[i].clear();
while(m--)
{
si(x),si(y);
g[x].pb(y);
}
sum=deep=0;
if(st.size()) st.pop();
REW(vis,0),REW(dfn,0),REW(low,0),REW(b,0);
FOR(i,1,n) if(!dfn[i]) tarjan(i);
int s=0,qw=0;
FOR(i,1,n)
{
for(int j=0;j<g[i].size();j++)
{
if(z[i]!=z[g[i][j]]) b[z[g[i][j]]]++,ne[z[i]].pb(z[g[i][j]]);
}
}
if(as()) puts("I love you my love and our love save us!");
else puts("Light my fire!");
}
return 0;
}