牛客网（tarjan割边）

链接：https://www.nowcoder.com/acm/contest/158/E

割点和割桥只存在于无向图

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<vector>
#include<queue>
#include<set>
#define mem(a,x) memset(a,x,sizeof(a))
#define s1(x) scanf("%d",&x)
#define s2(x,y) scanf("%d%d",&x,&y)
#define s3(x,y,z) scanf("%d%d%d",&x,&y,&z)
#define s4(x,y,z,k) scanf("%d%d%d%d",&x,&y,&z,&k)
#define ff(a,n) for(int i = 0 ; i < n; i++) scanf("%d",a+i)
#define ls 2*rt
#define rs 2*rt+1
#define lson ls,L,mid
#define rson rs,mid+1,R
#define ll long long
using namespace std;
typedef pair<int,int> pii;
//inline ll ask(int x){ll res=0;while(x)res+=c[x],x-=x&(-x);return res;}
//inline void add(int x,int d){while(x<=n)c[x]+=d,x+=x&(-x);}
//int gcd(int a, int b) { return b == 0 ? a : gcd(b, a%b);}
const ll inf = 0x3f3f3f3f;
const int mx = 1e6+10;
struct {
	int u,v,id,dir,ne;
}p[mx*2];
int head[mx],ans[mx],dfn[mx],low[mx]; 
int n,m,tol,cnt,ge;
void add(int u,int v,int id, int dir){
	p[tol].u=u;
	p[tol].v=v;
	p[tol].id=id;
	p[tol].dir = dir;
	p[tol].ne = head[u];
	head[u] = tol++;
}
void tarjan(int u,int f){    //这里写错 
	dfn[u]=low[u]=++cnt;
	for(int i = head[u]; i != -1; i =p[i].ne){
		int v = p[i].v;
		if(v == f)
			continue;
		if(!dfn[v]){
			tarjan(v,u);
			low[u] = min(low[u],low[v]);
			ans[p[i].id] = p[i].dir;
			if(low[v] > dfn[u]){
				ge++;
				return;
			}
		}
		else if(low[u] > dfn[v]){   //两个环相连的情况这里要取min
			low[u] =dfn[v];
			ans[p[i].id] = p[i].dir;
		}
	
	}
}

int main(){
	//	freopen("F:\\in.txt","r",stdin);
	//int T=10;	scanf("%d",&T);
	s2(n,m);
	int a,b;
	tol = 0;
	cnt = ge = 0;
	mem(head,-1);
	for(int i = 1; i <= m; i++){
		s2(a,b);
		add(a,b,i,1);
		add(b,a,i,0);
	}
	tarjan(1,-1);
	if(ge || cnt != n)
		puts("impossible");
	else{
		for(int i = 1; i <= m; i++)
			printf("%d",ans[i]);
		puts("");
	}

	return 0;
}