# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
497671 | hgmhc | Cijanobakterije (COCI21_cijanobakterije) | C++17 | 51 ms | 8404 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define REP(i,a,b) for (auto i = (a); i <= (b); ++i)
#define SIZE(x) int(x.size())
#define debug(x) cerr << #x << " is " << x << endl
#define el '\n'
using namespace std; using ll = long long;
const int N = 1e5+3;
int n, m;
vector<int> adj[N];
vector<int> components;
bool visited[N];
void dfs(int s) {
if (visited[s]) return;
visited[s] = true;
for (auto u : adj[s]) {
dfs(u);
}
}
void dfs1(int &x, int &l, int s = 1, int e = 0, int d = 0) {
if (l < d) {
x = s;
l = d;
}
for (auto u : adj[s]) if (u != e) {
dfs1(x,l,u,s,d+1);
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |