洛谷 P4645 [COCI2006-2007 Contest#3] BICIKLI 拓扑排序+bfs

题目描述
A bicycle race is being organized in a land far, far away. There are N town in the land, numbered 1 through N. There are also M one-way roads between the towns. The race will start in town 1 and end in town 2. How many different ways can the route be set? Two routes are considered different if they do not use the exact same roads.

输入格式
The first line of input contains two integers N and M (1 ≤ N ≤ 10 000, 1 ≤ M ≤ 100 000), the number of towns and roads. Each of the next M lines contains two different integers A and B, representing a road between towns A and B. Towns may be connected by more than one road.

输出格式
Output the number of distinct routes that can be set on a single line. If that number has more than nine digits, output only the last nine digits of the number. If there are infinitely many routes, output “inf”.

题意翻译
给定一个有向图，n个点，m条边。请问，1号点到2号点有多少条路径？如果有无限多条，输出inf，如果有限，输出答案模10^9的余数。

两点之间可能有重边，需要看成是不同的路径。

输入输出样例
输入 #1
6 7
1 3
1 4
3 2
4 2
5 6
6 5
3 4
输出 #1
3
输入 #2
6 8
1 3
1 4
3 2
4 2
5 6
6 5
3 4
4 3
输出 #2
inf

解法：拓扑排序+bfs

1. 我们先建两次图，一次正向图，一次反向图，用来排除无用环的情况，再来想如何判断inf的情况，如果有一个环经过1到2，说明是无限种情况
2. 然后我们用拓扑排序来判断环是否经过1到2，我们先用两次bfs来排除无用边的情况
3. 最后拓扑排序时，每次搜索到一条边，就把如何到这条边的情况加起来

AC代码

#include<cstdio>
#include<queue>
#include<vector>
#define re register int
using namespace std;
const long long mod=1e9;
inline int read() {
	int x=0,cf=1;
	char ch=getchar();
	while(ch<'0'||ch>'9') {
		if(ch=='-') cf=-1;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9') {
		x=(x<<3)+(x<<1)+(ch^48);
		ch=getchar();
	}
	return x*cf;
}
queue<int> q;
vector<int> g[10005],G[10005];
int n,m,cnt,ind[10005];
long long ans[10005];
bool v[10005],v1[10005];
int main() {
	n=read(),m=read();
	for(re i=1;i<=m;i++) {
		int x=read(),y=read();
		g[x].push_back(y);
		G[y].push_back(x);
	}
	q.push(1),v[1]=1;
	while(q.size()) {
		int x=q.front(); q.pop();
		for(re i=0;i<g[x].size();i++) {
			int y=g[x][i];
			if(!v[y]) {
				v[y]=1;
				q.push(y);
			}
		}
	}
	q.push(2),v1[2]=1;
	while(q.size()) {
		int x=q.front(); q.pop();
		for(re i=0;i<G[x].size();i++) {
			int y=G[x][i];
			if(!v1[y]) {
				v1[y]=1;
				q.push(y);
			}
		}
	}
	for(re i=1;i<=n;i++) {
		if(v[i]&&v1[i]) v[i]=1;
		else v[i]=0;
		if(v[i]) cnt++;
	}
	for(re i=1;i<=n;i++) {
		if(v[i]) {
			for(re j=0;j<g[i].size();j++) {
				if(v[g[i][j]]) ind[g[i][j]]++;
			}
		}
	}
	q.push(1),ans[1]=1;
	int k=0; while(q.size()) {
		int x=q.front(); k++; q.pop();
		for(re i=0;i<g[x].size();i++) {
			int y=g[x][i];
			if(v[y]) {
				(ans[y]+=ans[x])%=mod;
				ind[y]--;
				if(!ind[y]) q.push(y);
			}
		}
	}
	if(k<cnt) printf("inf");
	else printf("%lld",ans[2]);
	return 0;
}