BZOJ1123: [POI2008]BLO

  1 #include<cstdio>
  2 
  3 #include<cstdlib>
  4 
  5 #include<cmath>
  6 
  7 #include<cstring>
  8 
  9 #include<algorithm>
 10 
 11 #include<iostream>
 12 
 13 #include<vector>
 14 
 15 #include<map>
 16 
 17 #include<set>
 18 
 19 #include<queue>
 20 
 21 #include<string>
 22 
 23 #define inf 1000000000
 24 
 25 #define maxn 100000+1000
 26 
 27 #define maxm 500000+1000
 28 
 29 #define eps 1e-10
 30 
 31 #define ll long long
 32 
 33 #define pa pair<int,int>
 34 
 35 #define for0(i,n) for(int i=0;i<=(n);i++)
 36 
 37 #define for1(i,n) for(int i=1;i<=(n);i++)
 38 
 39 #define for2(i,x,y) for(int i=(x);i<=(y);i++)
 40 
 41 #define for3(i,x,y) for(int i=(x);i>=(y);i--)
 42 
 43 #define mod 1000000007
 44 
 45 using namespace std;
 46 
 47 inline int read()
 48 
 49 {
 50 
 51     int x=0,f=1;char ch=getchar();
 52 
 53     while(ch<‘0‘||ch>‘9‘){if(ch==‘-‘)f=-1;ch=getchar();}
 54 
 55     while(ch>=‘0‘&&ch<=‘9‘){x=10*x+ch-‘0‘;ch=getchar();}
 56 
 57     return x*f;
 58 
 59 }
 60 int head[maxn],low[maxn],dfn[maxn],ti,n,m,tot;
 61 ll s[maxn],ans[maxn];
 62 struct edge{int go,next;}e[2*maxm];
 63 inline void insert(int x,int y)
 64 {
 65     e[++tot].go=y;e[tot].next=head[x];head[x]=tot;
 66     e[++tot].go=x;e[tot].next=head[y];head[y]=tot;
 67 }
 68 inline void dfs(int x)
 69 {
 70     ll t=0;
 71     s[x]=1;
 72     low[x]=dfn[x]=++ti;
 73     for(int i=head[x],y;i;i=e[i].next)
 74      if(!dfn[y=e[i].go])
 75      {
 76          dfs(y);
 77          s[x]+=s[y];
 78          low[x]=min(low[x],low[y]);
 79          if(low[y]>=dfn[x])
 80          {
 81           ans[x]+=t*s[y];
 82           t+=s[y];
 83          }
 84      }
 85      else low[x]=min(low[x],dfn[y]);
 86      ans[x]+=t*(n-t-1);
 87 }     
 88 
 89 int main()
 90 
 91 {
 92 
 93     freopen("input.txt","r",stdin);
 94 
 95     freopen("output.txt","w",stdout);
 96 
 97     n=read();m=read();
 98     for1(i,m)insert(read(),read());
 99     dfs(1);
100     for1(i,n)printf("%lld\n",(ans[i]+n-1)*2);
101 
102     return 0;
103 
104 }