(为了练习tarjan所以写复杂了,参考一下即可)
题意:给出一个图,N个点,N条边,保证图连通,且只有一个环,问每个点离环的距离。
范围:N至多3000
解法:如果边是桥,则距离为1,否则为0,然后以环上某点做最短路。 (求环过程可以dfs..其实tarjan就是dfs啦)
代码:
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<math.h>
#include<iostream>
#include<stdlib.h>
#include<set>
#include<map>
#include<queue>
#include<vector>
#include<bitset>
#pragma comment(linker, "/STACK:1024000000,1024000000")
template <class T>
bool scanff(T &ret){ //Faster Input
char c; int sgn; T bit=0.1;
if(c=getchar(),c==EOF) return 0;
while(c!='-'&&c!='.'&&(c<'0'||c>'9')) c=getchar();
sgn=(c=='-')?-1:1;
ret=(c=='-')?0:(c-'0');
while(c=getchar(),c>='0'&&c<='9') ret=ret*10+(c-'0');
if(c==' '||c=='\n'){ ret*=sgn; return 1; }
while(c=getchar(),c>='0'&&c<='9') ret+=(c-'0')*bit,bit/=10;
ret*=sgn;
return 1;
}
#define inf 1073741823
#define llinf 4611686018427387903LL
#define PI acos(-1.0)
#define lth (th<<1)
#define rth (th<<1|1)
#define rep(i,a,b) for(int i=int(a);i<=int(b);i++)
#define drep(i,a,b) for(int i=int(a);i>=int(b);i--)
#define gson(i,root) for(int i=ptx[root];~i;i=ed[i].next)
#define tdata int testnum;scanff(testnum);for(int cas=1;cas<=testnum;cas++)
#define mem(x,val) memset(x,val,sizeof(x))
#define mkp(a,b) make_pair(a,b)
#define findx(x) lower_bound(b+1,b+1+bn,x)-b
#define pb(x) push_back(x)
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define NN 10010
int n;
int ptx[NN],dfn[NN],low[NN],st[NN],index,lnum,top,ef[NN];
struct edge{
int v,next,w;
edge(){}
edge(int vv,int nn){v=vv;next=nn;}
}ed[NN];
void addline(int x,int y){
ed[lnum]=edge(y,ptx[x]);
ef[lnum]=0;
ed[lnum].w=0;
ptx[x]=lnum++;
}
void init(){
rep(i,1,n)ptx[i]=-1;
lnum=index=0;
}
void tarjan(int root){
dfn[root]=low[root]=++index;
st[++top]=root;
gson(i,root){
int v=ed[i].v;
if(ef[i])continue;
ef[i]=ef[i^1]=1;
if(!dfn[v]){
tarjan(v);
low[root]=min(low[root],low[v]);
if(dfn[root]<low[v]){
ed[i].w=ed[i^1].w=1;
}
}
else low[root]=min(low[root],dfn[v]);
}
if(low[root]==dfn[root]){
for(;;){
int x=st[top--];
if(x==root)break;
}
}
}
int dis[NN],q[NN*10],head,tail;
void spfa(int rt){
rep(i,1,n)dis[i]=inf;
head=tail=dis[rt]=0;
q[tail++]=rt;
while(head<tail){
int x=q[head++];
gson(i,x){
int y=ed[i].v;
if(dis[x]+ed[i].w<dis[y]){
dis[y]=dis[x]+ed[i].w;
q[tail++]=y;
}
}
}
}
int main(){
int x,y;
scanff(n);
init();
rep(i,1,n){
scanff(x);scanff(y);
addline(x,y);
addline(y,x);
}
tarjan(1);
rep(i,0,2*n-1){
if(ed[i].w==0){
spfa(ed[i].v);
break;
}
}
printf("%d",dis[1]);
rep(i,2,n){
printf(" %d",dis[i]);
}
printf("\n");
return 0;
}