Submission #814821

#	Time	Username	Problem	Language	Result	Execution time	Memory
814821		exodus_	Cijanobakterije (COCI21_cijanobakterije)	C++17	70 / 70	74 ms	10472 KiB

Main

#include<bits/stdc++.h>
using namespace std;
vector<int>adj[100001];
bool vis[100001]={false};
int again, maxdepth;
void dfs(int current, int past, int depth) {
    vis[current]=true;
    if(depth>maxdepth) {
        maxdepth=depth;
        again=current;
    }
    for(auto iter:adj[current]) {
        if(iter != past) {
            dfs(iter, current, depth+1);
        }
    }
}
int longest(int i) {
    maxdepth=0;
    dfs(i, -1, 1);
    maxdepth=0;
    dfs(again, -1, 1);
    return maxdepth;
}
int main() {
    int N,M,A,B;
    cin >> N >> M;
    for(int i=1; i<=M; i++) {
        cin >> A >> B;
        adj[A].push_back(B);
        adj[B].push_back(A);
    }
    int sum=0;
    for(int i=1; i<=N; i++) {
        if(vis[i]==false) {
            sum+=longest(i);
        }
    }
    cout << sum << endl;
    return 0;
}

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