제출 #540751

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
540751		AlperenT	Cijanobakterije (COCI21_cijanobakterije)	C++17	70 / 70	50 ms	13780 KiB

Main

#include <bits/stdc++.h>

using namespace std;

const int N = 1e5 + 5;

int n, m, a, b, dist[N], ans;

bool vis[N];

vector<int> tree[N];

int dfs(int v, int p){
    vis[v] = true;
    dist[v] = dist[p] + 1;

    int mx = v, cur;

    for(auto e : tree[v]){
        if(e != p){
            cur = dfs(e, v);

            if(dist[cur] > dist[mx]) mx = cur;
        }
    }

    return mx;
}

int main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);

    cin >> n >> m;

    for(int i = 0; i < m; i++){
        cin >> a >> b;

        tree[a].push_back(b);
        tree[b].push_back(a);
    }

    for(int i = 1; i <= n; i++){
        if(!vis[i]){
            a = dfs(i, 0);

            b = dfs(a, 0);

            ans += dist[b];
        }
    }

    cout << ans;
}

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