# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
34868 | cheater2k | Factories (JOI14_factories) | C++14 | 4616 ms | 277444 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 "factories.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 500005;
int n;
vector< pair<int,int> > G[N];
int t[N], TIME;
int dep[N], e[N << 1], lg[N << 1];
pair<int,int> rmq[N << 1][20];
long long dist[N];
void dfs(int u, int p) {
t[u] = ++TIME; e[TIME] = u;
for (auto &edge : G[u]) {
int v = edge.second, w = edge.first; if (v == p) continue;
dist[v] = dist[u] + w; dep[v] = dep[u] + 1; dfs(v, u);
e[++TIME] = u;
}
}
int get(int l, int r) {
int k = lg[r - l + 1];
pair<int,int> res = min(rmq[l][k], rmq[r - (1 << k) + 1][k]);
return res.second;
}
int lca(int u, int v) {
if (t[u] > t[v]) swap(u, v);
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... |