Submission #1257876

#TimeUsernameProblemLanguageResultExecution timeMemory
1257876brover29Cijanobakterije (COCI21_cijanobakterije)C++17
70 / 70
26 ms15176 KiB
#include <bits/stdc++.h> //qwerty47924692 using namespace std; using ll = long long; const ll N=2e5+29; const string br="617283"; ll n,m,ans,used[N]; vector<ll>g[N]; pair<ll,ll> dfs(ll v,ll pr){ used[v]=1; pair<ll,ll>ans={1,v}; for(ll to:g[v]){ if(to==pr)continue; auto p=dfs(to,v); p.first++; ans=max(ans,p); } return ans; } int main(){ ios_base::sync_with_stdio(0); cin.tie(0); cin>>n>>m; for(ll i=1;i<=m;i++){ ll v,u; cin>>v>>u; g[v].push_back(u); g[u].push_back(v); } for(ll i=1;i<=n;i++){ if(used[i])continue; ans+=dfs(dfs(i,0).second,0 ).first; // cout<<ans<<' '; } 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...