Submission #844801

#TimeUsernameProblemLanguageResultExecution timeMemory
844801irmuunDuathlon (APIO18_duathlon)C++17
0 / 100
42 ms7260 KiB
#include<bits/stdc++.h> using namespace std; #define ll long long #define pb push_back #define ff first #define ss second #define all(s) s.begin(),s.end() #define rall(s) s.rbegin(),s.rend() int main(){ ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); ll n,m; cin>>n>>m; vector<ll>adj[n+1]; for(ll i=1;i<=m;i++){ ll u,v; cin>>u>>v; adj[u].pb(v); adj[v].pb(u); } if(m==n-1){ ll ans=0; vector<ll>cnt(n+1,0); function <void(ll,ll)> dfs=[&](ll x,ll p){ cnt[x]=1; for(auto y:adj[x]){ if(y!=p){ dfs(y,x); cnt[x]+=cnt[y]; } } ans+=(cnt[x]-1)*(n-cnt[x])*2; }; dfs(1,-1); cout<<ans; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...