# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
120704 | _demon_ | Duathlon (APIO18_duathlon) | C++14 | 1089 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;
typedef long long ll;
ll n,m;
ll child[100009];
ll ans;
vector<ll>v[100009];
void dfs1(int node,int p){
child[node]=1;
for(int i=0;i<v[node].size();i++){
int u=v[node][i];
if(u==p)continue;
dfs1(u,node);
child[node]+=child[u];
}
}
void dfs2(int node,int p){
ll sum=0;
for(int i=0;i<v[node].size();i++){
int u=v[node][i];
if(u==p)continue;
sum+=(child[u]*(n-child[u]-1))*2;
}
ans+=sum;
for(int i=0;i<v[node].size();i++){
int u=v[node][i];
if(u==p)continue;
dfs2(u,node);
}
}
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);
}
dfs1(0,0);
dfs2(0,0);
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... |