# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
112629 | maruii | Factories (JOI14_factories) | C++14 | 3861 ms | 110336 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;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ff first
#define ss second
const ll INF = 1e15;
int dfn[500005], dfnn, efn[500005], prt[19][500005];
int dep[500005];
ll D[500005];
vector<pii> edge[500005];
void dfs0(int x, int p) {
dfn[x] = ++dfnn;
for (auto i : edge[x]) {
if (i.ss == p) continue;
dep[dfnn + 1] = dep[dfn[x]] + 1;
D[dfnn + 1] = D[dfn[x]] + i.ff;
prt[0][dfnn + 1] = dfn[x];
dfs0(i.ss, x);
}
efn[dfn[x]] = dfnn;
}
int C[1000005], cnt, pv, XY[500005];
ll res;
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... |