제출 #880158

#제출 시각아이디문제언어결과실행 시간메모리
880158JoksimKaktusCijanobakterije (COCI21_cijanobakterije)C++17
15 / 70
25 ms9556 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; void output(bool yes){yes ? cout << "Yes" << "\n" : cout << "No" << "\n";} vector <int> adj[100005]; int point = 1; int maxi = 1; void dfs(int i,int p,int cur){ if(cur > maxi){ maxi = cur; point = i; } for(int j : adj[i]){ if(j != p){ dfs(j,i,cur+1); } } } int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(0); int n,m; 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); } dfs(1,-1,1); dfs(point,-1,1); cout << maxi << "\n"; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...