# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
104527 | _demon_ | Duathlon (APIO18_duathlon) | C++14 | 135 ms | 11896 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;
int n,m;
vector<int>v[100009];
int child1[100009];
int child2[100009];
void dfs(int node,int p){
for(int i=0;i<v[node].size();i++){
int u=v[node][i];
if(u==p) continue;
dfs(u,node);
child1[node]=child1[u]+1;
}
}
int main(){
cin>>n>>m;
for(int i=0;i<m;i++){
int a,b;
cin>>a>>b;
a--;b--;
v[a].push_back(b);
v[b].push_back(a);
}
int r;
for(int i=0;i<n;i++){
if(v[i].size()==1){r=i;break;}
}dfs(r,r);
for(int i=0;i<n;i++){
child2[i]=n-child1[i]-1;}
long long ans=0;for(int i=0;i<n;i++){int x=child1[i]*(child1[i]-1)/2;int y=child2[i]*(child2[i]-1)/2;ans+=x+y;}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... |