translate
有n个人打电话,给出很多个u->v的打电话的关系
定义u给v打电话(直接或间接),且v给u打电话(直接或间接),则u,v在同一个Calling Circles(电话环)里面
然后输出所有Calling Circles里面的人
analysis
分析后发现,打电话这个关系是有连通性的
在进一步分析的话这个题是符合scc缩点的模式的(tarjan)
于是直接套tarjan就好了
注意输出!UVA对输出卡的特别严格
code
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <map>
#include <set>
#include <bitset>
#include <ctime>
#include <cstring>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
using namespace std;
#define loop(i,start,end) for(register int i=start;i<=end;++i)
#define anti_loop(i,start,end) for(register int i=start;i>=end;--i)
#define clean(arry,num) memset(arry,num,sizeof(arry))
#define ll long long
template<typename T>void read(T &x){
x=0;char r=getchar();T neg=1;
while(r>'9'||r<'0'){if(r=='-')neg=-1;r=getchar();}
while(r>='0'&&r<='9'){x=(x<<1)+(x<<3)+r-'0';r=getchar();}
x*=neg;
}
const int maxn=30;
map<string,int>M;
map<int,string>name;
string name1,name2;
int n,m;
int nfn=0;
bool f[maxn][maxn];
struct node{
int e;
int nxt;
}edge[maxn*maxn];
int head[maxn];
int cnt=0;
inline void addl(int u,int v){
edge[cnt].e=v;
edge[cnt].nxt=head[u];
head[u]=cnt++;
}
int dfn[maxn];
int low[maxn];
int sta[maxn];
int belong[maxn];
int top=0;
int col=0;
void tarjan(int u){
dfn[u]=low[u]=++nfn;
sta[++top]=u;
for(int i=head[u];i!=-1;i=edge[i].nxt){
int v=edge[i].e;
if(!dfn[v]){
tarjan(v);
low[u]=min(low[u],low[v]);
}else if(!belong[v]) low[u]=min(low[u],dfn[v]);
}
if(low[u]==dfn[u]){
belong[u]=++col;
while(sta[top]!=u){
belong[sta[top]]=col;
--top;
}
--top;
}
}
struct res{
int point;
int bel;
}ans[maxn];
inline bool cmp(res a,res b){
return a.bel<b.bel;
}
int main(){
int nft=0;
while(1){
clean(f,false);
clean(head,-1);
clean(dfn,0);
clean(belong,0);
clean(low,0);
M.clear();
name.clear();
nfn=0;
top=0;
col=0;
cnt=0;
read(n);
read(m);
if(n==0&&m==0)
break;
if(nft)
cout<<endl;
printf("Calling circles for data set %d:\n",++nft);
loop(i,1,m){
cin>>name1;
cin>>name2;
if(M[name1]==0)
M[name1]=++nfn,
name[nfn]=name1;
if(M[name2]==0)
M[name2]=++nfn,
name[nfn]=name2;
f[M[name1]][M[name2]]=1;
}
loop(i,1,n)
loop(j,1,n)
if(f[i][j])
addl(i,j);
nfn=0;
loop(i,1,n)
if(!dfn[i])
tarjan(i);
loop(i,1,n){
ans[i].point=i;
ans[i].bel=belong[i];
}
sort(ans+1,ans+1+n,cmp);
loop(i,1,n){
cout<<name[ans[i].point];
if(ans[i].bel!=ans[i+1].bel||i>=n)
printf("\n");
else if(m)
printf(", ");
}
}
return 0;
}