# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
120152 | Just_Solve_The_Problem | Unique Cities (JOI19_ho_t5) | C++11 | 715 ms | 49252 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 ll long long
#define ok puts("OK");
using namespace std;
const int N = (int)2e5 + 7;
int n, m, A, B;
vector <int> gr[N];
int c[N], h[N], mxhe[N], cnt[N], ans[N];
vector <int> st;
int dfs1(int v, int pr) {
int big = v;
for (int to : gr[v]) {
if (to == pr) continue;
h[to] = h[v] + 1;
int temp = dfs1(to, v);
if (big == -1 || h[temp] > h[big]) {
big = temp;
}
}
return big;
}
int res;
void add(int x) {
Compilation message (stderr)
# | 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... |