# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
799259 | Tunglam07 | Cijanobakterije (COCI21_cijanobakterije) | C++17 | 41 ms | 11676 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;
long long n, m;
vector <long long> vec[100005];
bool visited[100005], visited1[100005];
pair <long long, long long> ans;
void dfs (long long v, long long d)
{
if (d > ans.first)
{
ans = {d, v};
}
visited[v] = 1;
for (int i = 0; i < vec[v].size (); i++)
{
long long id = vec[v][i];
if (!visited[id])
{
dfs (id, d + 1);
}
}
}
void dfs1 (long long v, long long d)
{
if (d > ans.first)
{
ans = {d, v};
}
visited1[v] = 1;
for (int i = 0; i < vec[v].size (); i++)
{
long long id = vec[v][i];
if (!visited1[id])
{
dfs1 (id, d + 1);
}
}
}
int main ()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long t = 1;
while (t--)
{
long long len = 0;
cin >> n >> m;
for (int i = 1; i <= m; i++)
{
long long x, y;
cin >> x >> y;
vec[x].push_back (y);
vec[y].push_back (x);
}
for (int i = 1; i <= n; i++)
{
if (!visited[i])
{
dfs (i, 1);
ans.first = 0;
dfs1 (ans.second, 1);
len += ans.first;
ans = {0, 0};
}
}
cout << len;
}
}
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... |