# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
104346 | _demon_ | Duathlon (APIO18_duathlon) | C++14 | 1132 ms | 885796 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[1009];
int child[1009][1009];
int num[1009];
void dfs(int node,int p,int r){
for(int i=0;i<v[node].size();i++){
int u=v[node][i];
if(u==p) continue;
dfs(u,node,r);
child[r][node]+=child[r][u]+1;
}
}
void dfs2(int node,int p,int r){
for(int i=0;i<v[node].size();i++){
int u=v[node][i];
if(u==p) continue;
num[r]+=child[r][u];
dfs2(u,node,r);
}
}
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);
}
for(int i=0;i<n;i++){
dfs(i,i,i);
}
for(int i=0;i<n;i++){
dfs2(i,i,i);
}
int ans=0;
for(int i=0;i<n;i++){
ans+=num[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... |