# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1160036 | nhphuc | Factories (JOI14_factories) | C++17 | 2851 ms | 339144 KiB |
#include <bits/stdc++.h>
#include "factories.h"
using namespace std;
const int N = 500500;
const long long inf = 1e18;
int sub[N], pos[N];
long long dis[N], mn[N];
vector<int> modify;
vector<pair<int, long long>> par[N];
vector<pair<int, int>> adj[N];
void dfs (int u, int p = 0){
sub[u] = 1;
for (auto [v, d] : adj[u]){
if (v != p && pos[v] == 0){
dfs(v, u);
sub[u] += sub[v];
}
}
}
void dfs2 (int u, int p, int root, long long dep){
par[u].push_back({root, dep});
for (auto [v, d] : adj[u]){
if (v != p && pos[v] == 0){
dfs2(v, u, root, dep + 1ll * d);
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |