#include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<vector<int>> adj(n);
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
adj[--u].push_back(--v);
adj[v].push_back(u);
}
int ans = 0;
vector<int> vis(n), vis2(n), vis3(n), d(n);
for (int i = 0; i < n; i++) {
if (vis[i]) continue;
int s;
queue<int> q;
q.push(i);
vis2[i] = 1;
while (!q.empty()) {
int u = q.front();
q.pop();
s = u;
for (int v : adj[u]) {
if (!vis2[v]) {
vis2[v] = 1;
q.push(v);
}
}
}
vis[s] = 1;
int x = 0;
d[s] = 1;
q.push(s);
while (!q.empty()) {
int u = q.front();
x = max(x, d[u]);
q.pop();
for (int v : adj[u]) {
if (!vis[v]) {
vis[v] = 1;
q.push(v);
d[v] = d[u] + 1;
}
}
}
ans += x;
}
cout << ans;
return 0;
}
# | 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... |