# [BZOJ3887] [Usaco2015 Jan]Grass Cownoisseur

## Description

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.

## Input

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.

## Output

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.

## Sample Input

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


## Sample Output

6


## 题目分析

#include <cstdio>
#include <cstring>
#include <set>
#include <map>
#include <vector>
#include <cmath>
#include <queue>
#include <algorithm>
using namespace std;
int n,m;
int size;
struct tar
{
int tot;
int deep,low,sa,tim,color,belong;
bool vis;
void tarjan(int x)
{
deep[x]=low[x]=++tim;
sa[++sa]=x,vis[x]=1;
{
if(!deep[to[i]])
tarjan(to[i]),low[x]=min(low[x],low[to[i]]);
else if(vis[to[i]]) low[x]=min(low[x],deep[to[i]]);
}
if(deep[x]==low[x])
{
color++;
int tmp;
do
{
tmp=sa[sa--],vis[tmp]=0;
belong[tmp]=color,size[color]++;
}while(tmp!=x);
}
}
}S;
struct your
{
int tot;
int dis;
bool vis;
int que;
int l,r;
your() { l=1; }
void spfa()
{
dis[S.belong]=size[S.belong];
que[++r]=S.belong;
while(l<=r)
{
int x=que[l++];
vis[x]=0;
if(dis[to[i]]<dis[x]+size[to[i]])
{
dis[to[i]]=dis[x]+size[to[i]];
if(!vis[to[i]]) que[++r]=(to[i]);
}
}
}
}A,B;
int main()
{
scanf("%d%d",&n,&m);
for(int x,y,i=1;i<=m;i++)
for(int i=1;i<=n;i++)
if(!S.deep[i]) S.tarjan(i);
for(int i=1;i<=n;i++)