# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1116490 | stdfloat | Valley (BOI19_valley) | C++17 | 181 ms | 17224 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>
using namespace std;
using ll = long long;
int tim;
vector<bool> vis;
vector<int> d, tin, tout, sz, pr;
vector<ll> v, dis1;
vector<vector<pair<int, int>>> E;
void dfs(int x, int p = -1) {
tin[x] = tim++;
if (~p) d[x] = d[p] + 1;
for (auto [i, w] : E[x]) {
if (i != p) {
dfs(i, x);
v[x] = min(v[x], v[i] + w);
}
}
tout[x] = tim++;
}
# | 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... |