codeforces round 377 div2 F Tourist Reform tarjan求边双连通分量

最新推荐文章于 2019-12-16 18:42:34 发布

jijijix

最新推荐文章于 2019-12-16 18:42:34 发布

阅读量495

点赞数

分类专栏：无向图双连通分量文章标签： codeforces tarjan算法

本文链接：https://blog.csdn.net/jijijix/article/details/58688659

版权

无向图双连通分量专栏收录该内容

4 篇文章 0 订阅

订阅专栏

Berland is a tourist country! At least, it can become such — the government of Berland is confident about this.

There are n cities in Berland, some pairs of which are connected by two-ways roads. Each road connects two different cities. In Berland there are no roads which connect the same pair of cities. It is possible to get from any city to any other city using given two-ways roads.

According to the reform each road will become one-way. It will be oriented to one of two directions.

To maximize the tourist attraction of Berland, after the reform for each city i the value r_i will be calculated. It will equal to the number of cities x for which there is an oriented path from the city i to the city x. In other words, r_i will equal the number of cities which can be reached from the city i by roads.

The government is sure that tourist's attention will be focused on the minimum value of r_i.

Help the government of Berland make the reform to maximize the minimum of r_i.

Input

The first line contains two integers n, m (2 ≤ n ≤ 400 000, 1 ≤ m ≤ 400 000) — the number of cities and the number of roads.

The next m lines describe roads in Berland: the j-th of them contains two integers u_j and v_j (1 ≤ u_j, v_j ≤ n, u_j ≠ v_j), where u_j and v_j are the numbers of cities which are connected by the j-th road.

The cities are numbered from 1 to n. It is guaranteed that it is possible to get from any city to any other by following two-ways roads. In Berland there are no roads which connect the same pair of cities.

Output

In the first line print single integer — the maximum possible value min_{1 ≤ i ≤ n}{r_i} after the orientation of roads.

The next m lines must contain the description of roads after the orientation: the j-th of them must contain two integers u_j, v_j, it means that the j-th road will be directed from the city u_j to the city v_j. Print roads in the same order as they are given in the input data.

Example

Input

Output

题目描述：给出一个有n(0 < n < 4e5)个点和m(0 < m < 4e5)条边的连通的无重边无向图，现在给每条边规定一个方向，图中所有边都有了方向之后，ri表示点i所能直接或间接到达的点的数量，要求给出一种规定方向的方式，使得所有ri中的最小值最大。

题目思路：规定方向后，应该使得尽量多的点相互可达，而每一个边双连通分量，就是在规定方向之后能够变为强连通分量的最大点集。因此，首先要将所有的边双连通分量都求出来，然后在每个边双连通分量内部dfs一次将边双连通分量变为强连通分量。将一个边双连通分量看作一个节点的话，图中剩下的就是一棵树，找到包含点的个数最多的边双连通分量，以他所在的节点作为根，dfs这棵树，让所有的树边都指向父亲节点，这样标记方向就满足题意了。在这种构图下ri的最小值就是点数最多的边双连通分量中所包含的点的个数。

收获：原来这就叫tarjan缩点...

#pragma warning(disable:4786)
#pragma comment(linker, "/STACK:102400000,102400000")
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<vector>
#include<cmath>
#include<string>
#include<sstream>
#include<bitset>
#define LL long long
#define FOR(i,f_start,f_end) for(int i=f_start;i<=f_end;++i)
#define mem(a,x) memset(a,x,sizeof(a))
#define lson l,m,x<<1
#define rson m+1,r,x<<1|1
using namespace std;
const int INF = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const double PI = acos(-1.0);
const double eps=1e-6;
const int maxn = 4e5 + 5;
struct Edge
{
    int u , v , is;
    Edge(int u = 0 , int v = 0 , int is = 0) : u(u) , v(v) , is(is){}
}e[maxn * 3];
int  n , m , ecnt , stamp , dfn[maxn] , low[maxn] , bccno[maxn] ,num[maxn] ,  bcc_cnt ;
vector<int>vec[maxn] , bcc[maxn];
vector<Edge>ans;
bool isbridge[maxn * 2] , vis[maxn * 2];
void add_edge(int u , int v)
{
    Edge e1 = Edge(u , v);
    e[ecnt++] = e1;
    vec[u].push_back(ecnt - 1);
    Edge e2 = Edge(v , u);
    e[ecnt++] = e2;
    vec[v].push_back(ecnt - 1);
}
void tarjan(int index , int fa)
{
    int tmp ;
    dfn[index] = low[index] = ++stamp;
    for(int i = 0 ; i < vec[index].size() ; i++){
        tmp = e[vec[index][i]].v;
        if(!dfn[tmp]){
            tarjan(tmp , index);
            low[index] = min(low[index] , low[tmp]);
            if(low[tmp] > dfn[index]){
                isbridge[vec[index][i]] = isbridge[vec[index][i] ^ 1] = 1;
            }
        }
        else if(dfn[tmp] < dfn[index] && tmp != fa){
            low[index] = min(low[index] , dfn[tmp]);
        }
    }
}

void dfs(int index)
{
    dfn[index] = 1;
    bccno[index] = bcc_cnt;
    ++num[bcc_cnt];
    for(int i = 0 ; i < vec[index].size() ; i++){
        int tmp = vec[index][i];
        if(isbridge[tmp])       continue;
        if(!dfn[e[tmp].v])
            dfs(e[tmp].v);
    }
}

void find_ebcc()
{
    bcc_cnt = stamp = 0;
    mem(dfn , 0);
    mem(low , 0);
    mem(isbridge , 0);
    mem(bccno , 0);
    mem(bcc , 0);
    for(int i = 1 ; i <= n ; i++){
        if(!dfn[i])
            tarjan(i , -1);
    }
    mem(dfn , 0);
    for(int i = 1 ; i<= n ; i++){
        if(!dfn[i]){
            bcc_cnt ++;
            dfs(i);
        }
    }
}

void dfs2(int cur)      //点可以重复，边不能重复，每条边被访问两次
{
    for(int i = 0 ; i< vec[cur].size() ; i++){
        int tmp = vec[cur][i];
        if(vis[tmp])        continue;
        Edge &ed = e[vec[cur][i]];
        int nt = ed.v;
        if(bccno[nt] != bccno[cur])     continue;
        ed.is = 1;
        vis[tmp ^ 1] = vis[tmp] = 1;
        dfs2(nt);
    }
}

void dfs3(int cur)
{
    dfn[cur] = 1;
    for(int i = 0 ; i < vec[cur].size() ; i++){
        int tmp = vec[cur][i];
        Edge ed = e[tmp];
        int nt = ed.v;
        if(dfn[nt])     continue;
        if(isbridge[tmp]){
            e[tmp ^ 1].is = 1;
        }
        dfs3(nt);
    }
}
int main()
{
    int u , v , res = -1 , max_id;
    ecnt = 0;
    scanf("%d %d" , &n , &m);
    for(int i = 1 ; i <= m ; i++){
        scanf("%d %d" , &u , &v);
        add_edge(u , v);
    }
    find_ebcc();
    mem(vis , 0);
    for(int i = 1 ; i <= n ; i++){
        dfs2(i);
    }
    for(int i = 1 ; i <= bcc_cnt ; i++){        //找到最大的边双连通分量
        if(num[i] > res){
            max_id  =  i;
            res = num[i];
        }
    }
    for(int i = 1 ; i<= n ; i++){       //找到双连通分量的一个点以进行dfs3
        if(bccno[i] == max_id){
            max_id = i;     break;
        }
    }
    mem(dfn , 0);
    mem(vis , 0);
    dfs3(max_id);
    for(int i = 0 ; i < ecnt ; i++){
        if(vis[i])      continue;
        if(e[i].is == 1 )
            ans.push_back(e[i]);
        else
            ans.push_back(e[i ^ 1]);
        vis[i] = vis[i ^ 1] = 1;
    }
    printf("%d\n",res);
    for(int i =0 ; i < ans.size() ; i++){
        printf("%d %d\n" , ans[i].u , ans[i].v);
    }
    return 0;
}