# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
125007 | gs14004 | Valley (BOI19_valley) | C++17 | 227 ms | 36992 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;
const int MAXN = 100005;
using lint = long long;
using pi = pair<int, int>;
struct edg{
int s, e, x;
}ed[MAXN];
vector<pi> gph[MAXN];
int n, m, q, r, din[MAXN], dout[MAXN], lvl[MAXN], piv;
lint dp[MAXN], dep[MAXN];
int par[17][MAXN];
lint spt[17][MAXN];
bool sub(int s, int e){
return din[s] <= din[e] && dout[e] <= dout[s];
}
void dfs(int x, int p){
din[x] = ++piv;
for(auto &i : gph[x]){
if(i.second == p) continue;
dep[i.second] = dep[x] + i.first;
lvl[i.second] = lvl[x] + 1;
par[0][i.second] = x;
dfs(i.second, x);
dp[x] = min(dp[x], dp[i.second] + i.first);
}
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... |