题目链接:https://www.luogu.org/problem/P1407
分析:
代码:
#include<cstdio>
#include<iostream>
#include<cstring>
#include<string>
#include<map>
#include<algorithm>
using namespace std;
const int N=4*1e4+10;
const int M=2*1e5+10;
int n,m;
int to[M],net[M],fir[M],num;
int low[N],dfn[N],tot;
int co[N],col;
int st[N],top;
map<string,int>mp;
void Index(int x,int y)
{
to[++num]=y;
net[num]=fir[x];
fir[x]=num;
}
void tarjan(int u)
{
dfn[u]=low[u]=++tot;
st[++top]=u;
for(int i=fir[u]; i; i=net[i])
{
int v=to[i];
if(!dfn[v])
{
tarjan(v);
low[u]=min(low[u],low[v]);
}
else if(!co[v])
low[u]=min(low[u],dfn[v]);
}
if(low[u]==dfn[u])
{
co[u]=++col;
while(u!=st[top])
{
co[st[top]]=col;
--top;
}
--top;
}
}
int main()
{
scanf("%d",&n);
string gril,boy;
for(int i=1; i<=n; i++)
{
cin>>gril>>boy;
mp[gril]=i;/*将名字赋值为i和i+n后在进行处理*/
mp[boy]=i+n;
Index(i,i+n);
}
scanf("%d",&m);
for(int i=1; i<=m; i++)
{
cin>>gril>>boy;
Index(mp[boy],mp[gril]);
}
for(int i=1; i<=2*n; i++)
if(!dfn[i])
tarjan(i);
for(int i=1; i<=n; i++)
if(co[i]!=co[i+n])
printf("Safe\n");
else
printf("Unsafe\n");
return 0;
}