# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
473047 | ljuba | Factories (JOI14_factories) | C++17 | 4859 ms | 235992 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 int mxN = 600012;
typedef long long ll;
vector<pair<int, ll>> adj[mxN];
bool vis[mxN];
int sub[mxN];
int dfsSize(int s, int p = -1) {
sub[s] = 1;
for(auto b : adj[s]) {
int e = b.first;
if(e == p || vis[e])
continue;
dfsSize(e, s);
sub[s] += sub[e];
}
return sub[s];
}
int centroid(int s, int p, int n) {
for(auto b : adj[s]) {
int e = b.first;
if(e == p || vis[e])
continue;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |