【题解】LuoGu4645：[COCI2006-2007 Contest#3] BICIKLI

原题传送门
如果是求一个点到另一个点的路径条数，那么直接用拓扑就好了
但是这道题目里面不一定是$DAG$
所以要判环，问题是有些环跟自己没关系，存在着并不影响答案，但是如果我能经过一个环到达终点，那么我就有无数条路径，所以是inf

就是如何判断会不会走过环
从起点跑一遍$dfs$，$vis1$表示哪些点被经过
建反图，从终点跑一遍$dfs$，$vis2$表示哪些点被经过

对于一个点$u$，有一条合法路径经过$u$的充要条件是$vis{1}_u=1且vis{2}_u=1$
对于这些$u$建拓扑图，跑一遍拓扑，如果有点的入度不为0，说明有环

Code：

#include <bits/stdc++.h>
#define maxn 1000010
using namespace std;
const int qy = 1e9;
struct Edge{
	int to, next;
}edge[maxn << 1], edge2[maxn << 1];
int num, num2, head[maxn], head2[maxn], dp[maxn], vis1[maxn], vis2[maxn], vis[maxn], d[maxn], n, m;
queue <int> q;

inline int read(){
	int s = 0, w = 1;
	char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') w = -1;
	for (; isdigit(c); c = getchar()) s = (s << 1) + (s << 3) + (c ^ 48);
	return s * w;
}

void addedge(int x, int y){ edge[++num] = (Edge){y, head[x]}, head[x] = num; }
void addedge2(int x, int y){ edge2[++num2] = (Edge){y, head2[x]}, head2[x] = num2; }

void dfs1(int u, int pre){
	if (vis1[u]) return;
	vis1[u] = 1;
	for (int i = head[u]; i; i = edge[i].next){
		int v = edge[i].to;
		if (v == pre) continue;
		dfs1(v, u);
	}
}

void dfs2(int u, int pre){
	if (vis2[u]) return;
	vis2[u] = 1;
	for (int i = head2[u]; i; i = edge2[i].next){
		int v = edge2[i].to;
		if (v == pre) continue;
		dfs2(v, u);
	}
}

void dfs(int u, int pre){
	if (vis[u]) return;
	vis[u] = 1;
	for (int i = head[u]; i; i = edge[i].next){
		int v = edge[i].to;
		if (vis1[v] && vis2[v]){ 
//			printf("%d to %d\n", u, v);
			++d[v];
			dfs(v, u);
		}
	}
}

int main(){
	n = read(), m = read();
	for (int i = 1; i <= m; ++i){
		int x = read(), y = read();
		addedge(x, y), addedge2(y, x);
	}
	dfs1(1, 0); dfs2(2, 0);
	if (!vis1[2]) return puts("0"), 0;
	dfs(1, 0);
	q.push(1), dp[1] = 1;
//	for (int i = 1; i <= n; ++i)
//		printf("d[%d] = %d\n", i, d[i]);

	while (!q.empty()){
		int u = q.front(); q.pop();
		for (int i = head[u]; i; i = edge[i].next){
			int v = edge[i].to;
			if (vis1[v] && vis2[v]){
				--d[v], dp[v] = (dp[v] + dp[u]) % qy;
				if (!d[v]) q.push(v);
			}
		}
	}
	for (int i = 1; i <= n; ++i)
		if (d[i]) return puts("inf"), 0;
	printf("%d\n", dp[2]);
	return 0;
}