# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
532372 | mmonteiro | Factories (JOI14_factories) | C++17 | 6382 ms | 202064 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;
#include "factories.h"
const int MAX = 1e6 + 200;
const long long OO = 0x3f3f3f3f3f3f3f3f;
#define ii pair<int, int>
#define f first
#define s second
int n;
vector<ii> G[MAX];
vector<int> tl;
int SpT[22][MAX], pos[MAX], depth[MAX];
int CD[MAX], sz[MAX];
bool cut[MAX];
long long ans[MAX], weight[MAX];
void dfs(int v, int p, int d)
{
depth[v] = d;
pos[v] = tl.size();
tl.push_back(v);
for(auto [u, w] : G[v]) {
if(u != p) {
weight[u] = weight[v] + w;
dfs(u, v, d + 1);
tl.push_back(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... |