# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
754803 | Desh03 | Factories (JOI14_factories) | C++17 | 5103 ms | 171520 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 long long INF = 1e18;
vector<long long> d, mn;
vector<int> dep, out, sz, par, euler;
vector<bool> centroid;
vector<vector<pair<int, int>>> g;
void dfs(int u, int p) {
out[u] = euler.size();
euler.push_back(u);
for (auto [v, w] : g[u])
if (v ^ p) {
d[v] = d[u] + w;
dep[v] = dep[u] + 1;
dfs(v, u);
out[u] = euler.size();
euler.push_back(u);
}
}
struct RMQ {
vector<vector<int>> sparse;
vector<int> lg;
int comp(const int &a, const int &b) {
return dep[a] < dep[b] ? a : b;
}
void init(const vector<int> &v) {
int n = v.size();
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |