Submission #1341930

#	Time	Username	Problem	Language	Result	Execution time	Memory
1341930		mantaggez	Cijanobakterije (COCI21_cijanobakterije)	C++20	70 / 70	36 ms	10884 KiB

Main

#include <bits/stdc++.h>

using namespace std;

const int nx = 1e5+5;

int n, m, ans, farnode, deep;
int vs[nx];
vector<int> adj[nx];

void dfs(int u, int pa, int d)
{
    if(d > deep) {
        farnode = u;
        deep = d;
    }

    vs[u] = 1;
    for(int v : adj[u]) {
        if(v == pa) continue;
        dfs(v, u, d + 1);
    }
}

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin >> n >> m;
    for(int i=0;i<m;i++) {
        int u, v;
        cin >> u >> v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }

    for(int i=1;i<=n;i++) {
        if(vs[i]) continue;
        deep = 0;
        dfs(i, -1, 1);
        dfs(farnode, -1, 1);
        ans += deep;
    }

    cout << ans << '\n';

    return 0;
}

• Subtask 1: 15 / 15
• Subtask 2: 6 / 6
• Subtask 3: 6 / 6
• Subtask 4: 15 / 15
• Subtask 5: 28 / 28