# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
944799 | aufan | Factories (JOI14_factories) | C++17 | 3934 ms | 287400 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 long long INFF = 1e18;
int dep[500000], par[500000], tin[500000], sz[500000], rem[500000], lgg[1000001], pw[20];
long long d[500000], ans[500000];
pair<int, int> sp[20][1000000];
vector<pair<int, int>> g[500000];
void Init(int n, int A[], int B[], int D[]) {
for (int i = 0; i < n - 1; i++) {
g[A[i]].push_back({B[i], D[i]});
g[B[i]].push_back({A[i], D[i]});
}
for (int i = 1; i <= 1000000; i++) {
lgg[i] = __lg(i);
}
for (int j = 0; j < 20; j++) {
pw[j] = 1 << j;
}
int tim = 0;
function<void(int, int)> dfs = [&](int x, int pr) {
sp[0][tim] = {dep[x], x};
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |