题目描述
In order to get from one of the F (1 <= F <= 5,000) grazing fields (which are numbered 1..F) to another field, Bessie and the rest of the herd are forced to cross near the Tree of Rotten Apples. The cows are now tired of often being forced to take a particular path and want to build some new paths so that they will always have a choice of at least two separate routes between any pair of fields. They currently have at least one route between each pair of fields and want to have at least two. Of course, they can only travel on Official Paths when they move from one field to another.
Given a description of the current set of R (F-1 <= R <= 10,000) paths that each connect exactly two different fields, determine the minimum number of new paths (each of which connects exactly two fields) that must be built so that there are at least two separate routes between any pair of fields. Routes are considered separate if they use none of the same paths, even if they visit the same intermediate field along the way.
There might already be more than one paths between the same pair of fields, and you may also build a new path that connects the same fields as some other path.
为了从F(1≤F≤5000)个草场中的一个走到另一个，贝茜和她的同伴们有时不得不路过一些她们讨厌的可怕的树．奶牛们已经厌倦了被迫走某一条路，所以她们想建一些新路，使每一对草场之间都会至少有两条相互分离的路径，这样她们就有多一些选择．
每对草场之间已经有至少一条路径．给出所有R(F-1≤R≤10000)条双向路的描述，每条路连接了两个不同的草场，请计算最少的新建道路的数量, 路径由若干道路首尾相连而成．两条路径相互分离，是指两条路径没有一条重合的道路．但是，两条分离的路径上可以有一些相同的草场． 对于同一对草场之间，可能已经有两条不同的道路，你也可以在它们之间再建一条道路，作为另一条不同的道路．
输入输出格式
输入格式：
Line 1: Two space-separated integers: F and R
Lines 2..R+1: Each line contains two space-separated integers which are the fields at the endpoints of some path.
输出格式：
Line 1: A single integer that is the number of new paths that must be built.
输入输出样例
说明
Explanation of the sample:
One visualization of the paths is:
1 2 3
+---+---+
| |
| |6 +---+---+ 4
/ 5 / / 7 +Building new paths from 1 to 6 and from 4 to 7 satisfies the conditions.
1 2 3
+---+---+
| : |
|---|
6 +---+---+ 4
/ 5 : / :
/ :
7 + - - - - Check some of the routes:
1 – 2: 1 –> 2 and 1 –> 6 –> 5 –> 2
1 – 4: 1 –> 2 –> 3 –> 4 and 1 –> 6 –> 5 –> 4
3 – 7: 3 –> 4 –> 7 and 3 –> 2 –> 5 –> 7
Every pair of fields is, in fact, connected by two routes.
It's possible that adding some other path will also solve the problem (like one from 6 to 7). Adding two paths, however, is the minimum.
首先，对于边双联通分量里的点我们是不用考虑的。
因此我们先用tarjan把边双联通分量缩出来
这样的话必定会形成一棵树
接下来考虑贪心，对于任意三个不在同一边双联通分量里且入度唯一的点
我们在他们中间连一条边，这样一定是最优的
因此我们只需要统计入度为1的点就行了
最后的答案为$(ans+1)/2$
// luogu-judger-enable-o2 #include<cstdio> #include<cstring> #include<algorithm> #include<stack> #define getchar() (S == T && (T = (S = BB) + fread(BB, 1, 1 << 15, stdin), S == T) ? EOF : *S++) char BB[1 << 15], *S = BB, *T = BB; using namespace std; const int MAXN=1e5+10; inline int read() { char c=getchar();int x=0,f=1; while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();} while(c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();} return x*f; } struct node { int u,v,w,nxt; }edge[MAXN]; int head[MAXN],num=1; inline void AddEdge(int x,int y) { edge[num].u=x; edge[num].v=y; edge[num].nxt=head[x]; head[x]=num++; } int dfn[MAXN],low[MAXN],vis[MAXN],tot=0,colornum=0,color[MAXN],inder[MAXN]; int fuck[5001][5001]; stack<int>s; void tarjan(int now,int fa) { dfn[now]=low[now]=++tot; s.push(now); vis[now]=1; for(int i=head[now];i!=-1;i=edge[i].nxt) { if(!dfn[edge[i].v]&&edge[i].v!=fa) tarjan(edge[i].v,now),low[now]=min(low[now],low[edge[i].v]); if(vis[edge[i].v]&&edge[i].v!=fa) low[now]=min(low[now],dfn[edge[i].v]); } if(dfn[now]==low[now]) { int h=0; colornum++; do { h=s.top(); color[h]=colornum; s.pop(); }while(h!=now); } } int main() { #ifdef WIN32 freopen("a.in","r",stdin); #else #endif memset(head,-1,sizeof(head)); int N=read(),M=read(); for(int i=1;i<=M;i++) { int x=read(),y=read(); AddEdge(x,y); AddEdge(y,x); } tarjan(1,0); for(int i=1;i<=num-1;i++) if(color[edge[i].u]!=color[edge[i].v]&&fuck[edge[i].u][edge[i].v]==0) fuck[edge[i].u][edge[i].v]=1, inder[color[edge[i].u]]++, inder[color[edge[i].v]]++; int ans=0; for(int i=1;i<=colornum;i++) if(inder[i]==2)//双向边 ans++; printf("%d",(ans+1)>>1); return 0; }