# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
747693 | 1075508020060209tc | Duathlon (APIO18_duathlon) | C++14 | 1074 ms | 1048576 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define int long long
int n;int m;
vector<int>e[300005];
int sz[300005];
int ans;
void dfssz(int nw,int pa){
sz[nw]=1;
for(int i=0;i<e[nw].size();i++){
int v=e[nw][i];
if(v==pa){continue;}
dfssz(v,nw);
sz[nw]+=sz[v];
}
}
void dfs(int nw,int pa,int rtsz){
ans+=(rtsz-sz[nw])*(sz[nw]-1);
for(int i=0;i<e[nw].size();i++){
int v=e[nw][i];
if(v==pa){continue;}
dfs(v,nw,rtsz);
ans+=sz[v]*(rtsz-1-sz[v]);
}
}
signed main()
{
cin>>n>>m;
for(int i=1;i<=m;i++){
int a;int b;
cin>>a>>b;
e[a].push_back(b);
e[b].push_back(a);
}
ans=0;
vector<int>rt;
for(int i=1;i<=n;i++){
if(sz[i]==0){
dfssz(i,0);
rt.push_back(i);
}
}
for(int i=0;i<1;i++){
dfs(rt[i],0,sz[rt[i]]);
}
cout<<ans<<endl;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |