# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
666988 | Kenpar | Cijanobakterije (COCI21_cijanobakterije) | C++17 | 38 ms | 10040 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;
#define ll long long
#define endl '\n'
const ll MOD = 1e9+7;
const ll INF = 1e18;
const ll MAX = 1e5;
vector<vector<int>> edges(MAX);
vector<bool> visited(MAX, false);
int getLengthChild(int cur){
if(visited[cur]) return 0;
visited[cur] = true;
int ans = 0;
for(int tar : edges[cur]){
ans = max(ans, getLengthChild(tar));
}
return ans+1;
}
int getLength(int cur){
visited[cur] = true;
int a = 0,b = 0;
for(int tar : edges[cur]){
int cur = getLengthChild(tar);
if(cur > a){
b = a;
a = cur;
}else if(cur > b){
b = cur;
}
}
return a+b+1;
}
void solve(){
int n,m;
cin>>n>>m;
for(int i = 0; i < m; i++){
int a,b; cin>>a>>b;
a--,b--;
edges[a].push_back(b);
edges[b].push_back(a);
}
vector<int> ans;
for(int i = 0; i < n; i++){
if(!visited[i]) ans.push_back(getLength(i));
}
int sum = 0;
for(int a : ans) sum+=a;
cout<<sum;
}
int main()
{
cin.tie(NULL);
ios::sync_with_stdio(NULL);
int t = 1;
//cin>>t;
int temp = t;
while(t--){
//cout<<"Case #"<<temp - t<<" > "<<endl;
solve();
cout<<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... |