이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#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;
vector<ll>v;
for(auto y:adj[x]){
if(y!=p){
dfs(y,x);
v.pb(cnt[y]);
cnt[x]+=cnt[y];
}
}
v.pb(n-cnt[x]);
for(auto y:v){
ans+=(n-1-y)*y;
}
};
dfs(1,-1);
cout<<ans;
}
}
# | 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... |