# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
676047 | Tangirkul | Cijanobakterije (COCI21_cijanobakterije) | C++17 | 27 ms | 13196 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>
#define ll long long
#define fi first
#define se second
#define pb push_back
#define sz size
#define Junanna ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
const ll K = 32;
const ll INF = 1e9 + 7;
const ll MOD = 1e9 + 7;
const ll N = (1e5 + 125);
ll n, m;
vector <ll> g[N];
bool used[N];
ll dfs (ll v, ll st)
{
used[v] = 1;
ll ans1 = 0;
for (ll i = 0; i < g[v].sz (); i++)
{
ll to = g[v][i];
if (!used[to])
{
ans1 = max (ans1, dfs (to, st));
}
}
return ans1 + 1;
}
void ma1n ()
{
cin >> n >> m;
ll ans = 0;
for (ll i = 1; i <= m; i++)
{
ll x, y;
cin >> x >> y;
g[x].pb (y);
g[y].pb (x);
}
for (ll i = 1; i <= n; i++)
{
if (!used[i] && g[i].sz () == 1)
{
ans += dfs (i, i);
}
else
{
if (g[i].sz () == 0)
{
ans++;
}
}
}
cout << ans;
}
int main ()
{
Junanna;
ll t = 1;
while (t--)
{
ma1n ();
}
return 0;
}
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... |