# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
34313 | aome | Factories (JOI14_factories) | C++14 | 4586 ms | 277440 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>
#include "factories.h"
using namespace std;
const int N = 500005;
const long long INF = 1e18;
typedef pair<int, int> ii;
int n, TIME;
int P[N], E[N * 2], H[N], LG[N * 2];
ii rmq[20][N * 2];
long long res;
long long dis[N];
long long f[2][N];
bool color[2][N];
vector<ii> G[N];
void dfs(int u, int p) {
P[u] = ++TIME, E[TIME] = u;
for (auto v : G[u]) {
if (v.first == p) continue;
dis[v.first] = dis[u] + v.second;
H[v.first] = H[u] + 1, dfs(v.first, u);
E[++TIME] = u;
}
}
ii get(int l, int r) {
int k = LG[r - l + 1];
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |