# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
527632 | NekoRolly | Factories (JOI14_factories) | C++17 | 3459 ms | 170304 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;
typedef long long ll;
const int N = 5e5+4;
const ll inf = 1e18;
struct Cd{
vector<pair<int,int>> adj[N];
int sz[N],up[N],h[N],vis[N];
ll dis[N][19],val[N];
int find(int u,int p,int Sz){
int val = 0,x = 0; sz[u] = 1;
for (auto [v, w] : adj[u]) if (v != p && !vis[v]){
x ^= find(v, u, Sz); sz[u] += sz[v];
val = max(val, sz[v]);
}
if (max(val, Sz-sz[u]) <= Sz/2) up[x = u] = p;
return x;
}
void dfs(int u,int p,int H){
for (auto [v, w] : adj[u]) if (v != p && !vis[v]){
dis[v][H] = dis[u][H] + w;
dfs(v, u, H);
}
}
void build(int u,int p,int Sz){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |