Untitled
unknown
plain_text
5 days ago
1.3 kB
2
Indexable
#include <bits/stdc++.h> using namespace std; const int maxn=100005; int n,m; vector<int>con[maxn]; int id[maxn],cnt,low[maxn],par[maxn], sl[maxn]; long long kq[maxn]; vector<int>parts[maxn]; void dfs(int u){ low[u]=id[u]=++cnt; sl[u]=1; int sl_pt=0; for(int v:con[u]){ if(par[u]==v)continue; if(id[v]!=0)low[u]=min(low[u],id[v]); else{ par[v]=u; dfs(v); low[u]=min(low[u],low[v]); sl[u]+=sl[v]; if(low[v]>=id[u]){ parts[u].push_back(sl[v]); sl_pt+=sl[v]; } } } if(par[u]!=-1) parts[u].push_back(n-sl_pt-1); } int main(){ ios_base::sync_with_stdio(0); cin.tie(0);cout.tie(0); if(fopen("i.txt","r")){ freopen("i.txt","r",stdin); freopen("o.txt","w",stdout); } cin>>n>>m; while(m--){ int u,v; cin>>u>>v; con[u].push_back(v); con[v].push_back(u); } dfs(1); //for(int i=1;i<=n;i++)cout<<kq[i]<<'\n'; for(int i=1;i<=n;i++){ long long sum_total=accumulate(parts[i].begin(),parts[i].end(),0); long long res=2*(n-1); for(int j:parts[i]) res+=1ll*j*(sum_total-j); cout<<res<<'\n'; } }
Editor is loading...
Leave a Comment