bzoj 1123

#include<iostream>
#include<cstring>
#include<cstdio>
#define ll long long
using namespace std;

const int maxn = 100010 ;

const int maxm = 500010 ;

int n,m,head[maxn],size,low[maxn],dfn[maxn],tt[maxn],tim;

ll ans[maxn];

struct edge{
    int v,nex;
}e[maxm<<1];

void adde(int u,int v){
    e[size].v=v;e[size].nex=head[u];head[u]=size++;
}

void dfs(int u){
    low[u]=dfn[u]=++tim;
    int t=0;tt[u]=1;
    for(int i=head[u];~i;i=e[i].nex){
        int v=e[i].v;
        if(!dfn[v]){
            dfs(v);
            low[u]=min(low[u],low[v]);
            tt[u]+=tt[v];
            if(low[v]>=dfn[u]) {
                ans[u]+=(long long) t*tt[v];
                t+=tt[v];
            }
        }else low[u]=min(low[u],dfn[v]);
    }
    ans[u]+=(ll)t*(n-t-1);
}

int main(){
    scanf("%d%d",&n,&m);
    memset(head,-1,sizeof(head));
    for(int i=1;i<=m;i++){
        int u,v;
        scanf("%d%d",&u,&v);
        adde(u,v);adde(v,u);
    }
    for(int i=1;i<=n;i++) 
    if(!dfn[i]) dfs(i);
    for(int i=1;i<=n;i++) printf("%lld\n",(ans[i]+n-1)*2);
    return 0;
}