P3119 [USACO15JAN]草鉴定Grass Cownoisseur（缩点+spfa）

题目描述

In an effort to better manage the grazing patterns of his cows, Farmer John has installed one-way cow paths all over his farm. The farm consists of N fields, conveniently numbered 1..N, with each one-way cow path connecting a pair of fields. For example, if a path connects from field X to field Y, then cows are allowed to travel from X to Y but not from Y to X.

Bessie the cow, as we all know, enjoys eating grass from as many fields as possible. She always starts in field 1 at the beginning of the day and visits a sequence of fields, returning to field 1 at the end of the day. She tries to maximize the number of distinct fields along her route, since she gets to eat the grass in each one (if she visits a field multiple times, she only eats the grass there once).

As one might imagine, Bessie is not particularly happy about the one-way restriction on FJ's paths, since this will likely reduce the number of distinct fields she can possibly visit along her daily route. She wonders how much grass she will be able to eat if she breaks the rules and follows up to one path in the wrong direction. Please compute the maximum number of distinct fields she can visit along a route starting and ending at field 1, where she can follow up to one path along the route in the wrong direction. Bessie can only travel backwards at most once in her journey. In particular, she cannot even take the same path backwards twice.

约翰有n块草场，编号1到n，这些草场由若干条单行道相连。奶牛贝西是美味牧草的鉴赏家，她想到达尽可能多的草场去品尝牧草。

贝西总是从1号草场出发，最后回到1号草场。她想经过尽可能多的草场，贝西在通一个草场只吃一次草，所以一个草场可以经过多次。因为草场是单行道连接，这给贝西的品鉴工作带来了很大的不便，贝西想偷偷逆向行走一次，但最多只能有一次逆行。问，贝西最多能吃到多少个草场的牧草。

输入输出格式

输入格式：

 

INPUT: (file grass.in)

The first line of input contains N and M, giving the number of fields and the number of one-way paths (1 <= N, M <= 100,000).

The following M lines each describe a one-way cow path. Each line contains two distinct field numbers X and Y, corresponding to a cow path from X to Y. The same cow path will never appear more than once.

输入：

第一行：草场数n，道路数m。

以下m行，每行x和y表明有x到y的单向边，不会有重复的道路出现。

 

输出格式：

 

OUTPUT: (file grass.out)

A single line indicating the maximum number of distinct fields Bessie

can visit along a route starting and ending at field 1, given that she can

follow at most one path along this route in the wrong direction.

输出：

一个数，逆行一次最多可以走几个草场。

 

输入输出样例

输入样例#1： 复制

7 10 
1 2 
3 1 
2 5 
2 4 
3 7 
3 5 
3 6 
6 5 
7 2 
4 7 

输出样例#1： 复制

6 

说明

SOLUTION NOTES:

Here is an ASCII drawing of the sample input:

v---3-->6
7   | \ |
^\  v  \|
| \ 1   |
|   |   v
|   v   5
4<--2---^

Bessie can visit pastures 1, 2, 4, 7, 2, 5, 3, 1 by traveling

backwards on the path between 5 and 3. When she arrives at 3 she

cannot reach 6 without following another backwards path.

解题思路

 先缩点，然后建新图，建一个正向图和一个反向图，用spfa求出1到每个点的最大路程（可经过最多农村数）和每个点到1的最大路程（通过反向图）。然后枚举每一条边u->v，求（1到v的最大距离+u到1的最大距离）中最大的值就是答案。

代码如下

#include <iostream>
#include <vector>
#include <cstring>
#include <cstdio>
#include <queue>
#include <stack>
#define maxn 100005
using namespace std;
vector<int> g[maxn];
int scc[maxn];
int dfn[maxn], low[maxn];
int id, cnt;
bool vis[maxn];
stack<int> sta;
int s;
void tarjan(int x)
{
	id ++;
	sta.push(x);
	vis[x] = true;
	low[x] = dfn[x] = id;
	for(int i = 0; i < g[x].size(); i ++){
		int r = g[x][i];
		if(!dfn[r]){
			tarjan(r);
			low[x] = min(low[x], low[r]);
		}
		else if(vis[r])
			low[x] = min(low[x], dfn[r]);
	}
	if(dfn[x] == low[x]){
		cnt ++;
		while(!sta.empty()){
			int top = sta.top();
			sta.pop();
			vis[top] = false;
			scc[top] = cnt;
			if(top == x)
				break;
		}
	}
}
vector<int> g1[maxn];
vector<int> g2[maxn];
int v[maxn];
int dis1[maxn], dis2[maxn];
void spfa1()
{
	memset(vis, 0, sizeof(vis));
	queue<int> que;
	que.push(s);
	dis1[s] = v[s];
	vis[s] = true;
	while(!que.empty()){
		int top = que.front();
		que.pop();
		vis[top] = false;
		for(int i = 0; i < g1[top].size(); i ++){
			int r = g1[top][i];
			//cout << top << " " << r << " " << dis1[top] << endl;
			if(dis1[top] + v[r] > dis1[r]){
				dis1[r] = dis1[top] + v[r];
				if(!vis[r]){
					vis[r] = true;
					que.push(r);
				}
			}
		}
	}
}
void spfa2()
{
	memset(vis, 0, sizeof(vis));
	queue<int> que;
	que.push(s);
	vis[s] = true;
	dis2[s] = v[s];
	while(!que.empty()){
		int top = que.front();
		que.pop();
		vis[top] = false;
		for(int i = 0; i < g2[top].size(); i ++){
			int r = g2[top][i];
			if(dis2[top] + v[r] > dis2[r]){
				dis2[r] = dis2[top] + v[r];
				if(!vis[r]){
					vis[r] = true;
					que.push(r);
				}
			}
		}
	}
}
int main()
{
	int n, m;
	cin >> n >> m;
	for(int i = 1; i <= n; i ++)
		g[0].push_back(i);
	for(int i = 0; i < m; i ++){
		int x, y;
		scanf("%d%d", &x, &y);
		g[x].push_back(y);
	}
	cnt = id = 0;
	tarjan(0);
	s = scc[1];
	for(int i = 1; i <= n; i ++){
		v[scc[i]] ++;
		for(int j = 0; j < g[i].size(); j ++){
			int r = g[i][j];
			if(scc[i] != scc[r]){
				g1[scc[i]].push_back(scc[r]);
				g2[scc[r]].push_back(scc[i]);
			}
		} 
	}
	spfa1();
	spfa2();
	int ans = v[s];
	for(int i = 1; i < cnt; i ++){
		for(int j = 0; j < g1[i].size(); j ++){
			int r = g1[i][j];
			if(dis1[r] && dis2[i])
				ans = max(ans, dis1[r] + dis2[i] - v[s]); //
		}
	}
	cout << ans << endl;
	return 0;
}