oj.uz

Submission #745882

# Submission time Handle Problem Language Result Execution time Memory
745882 2023-05-21T09:13:13 Z Ahmed57 Cijanobakterije (COCI21_cijanobakterije) C++17
0 / 70
 153 ms 10148 KB 
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>

using namespace std;
vector<int> adj[100001];
int ma = 0 , dep = 0;
int vis[100001];
void dfs(int i,int dp){
    vis[i] = 1;
    if(dp>dep){
        dep = dp;
        ma = i;
    }
    for(auto j:adj[i]){
        if(vis[j])continue;
        dfs(j,dp+1);
    }
}
int main(){
    int n,m;
    cin>>n>>m;
    for(int i = 0;i<m;i++){
        int a,b;cin>>a>>b;
        adj[a].push_back(b);
        adj[b].push_back(a);
    }
    vector<pair<int,int>> v(n+1);
    for(int i = 1;i<=n;i++){
        if(!vis[i]){
            dep= 0 ,ma =0;
            dfs(1,1);
            v[i].first = dep, v[i].second = ma;
        }
    }
    memset(vis,0,sizeof vis);
    long long all = 0;
    for(int i = 1;i<=n;i++){
        if(!vis[i]){
            dep= 0 ,ma =0;
            dfs(v[i].first,1);
            all+=ma;
        }
    }
    cout<<all<<endl;
    return 0;
}

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 14 ms 3796 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 153 ms 10148 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3036 KB Output is correct
2 Incorrect 2 ms 3028 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 3028 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 28.0

# Verdict Execution time Memory Grader output
1 Incorrect 14 ms 3796 KB Output isn't correct
2 Halted 0 ms 0 KB -