a/Library
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

Use struct instead of namespace

Browse source
This commit is contained in:
Anthony Wang 2020-08-21 15:17:54 -05:00
parent 0ba24fbd07
commit 0f80ef68d7
No known key found for this signature in database
GPG key ID: DCDAC3EF330BB9AC
2 changed files with 15 additions and 17 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
Graph/centroid.cpp
View file

@ -1,4 +1,4 @@
namespace centroid {
struct centroid {
int sz[MN], cpar[MN];
bitset<MN> vis;
void dfs(vector<int> * G, int u, int p = 0) {

30
Graph/lca.cpp
View file

@ -1,17 +1,15 @@
int d[MN], L[MN][20];
vector<int> G[MN];
void dfs(int u = 1, int p = 0) {
d[u] = d[p] + 1;
L[u][0] = p;
for (int i = 0; i < 18 && L[u][i]; i++) L[u][i + 1] = L[L[u][i]][i];
for (auto& v : G[u]) if (v != p) dfs(v, u);
}
int lca(int u, int v) {
if (d[u] > d[v]) swap(u, v);
for (int i = 18; i >= 0; i--) if (d[v] - (1 << i) >= d[u]) v = L[v][i];
if (u == v) return u;
for (int i = 18; i >= 0; i--) if (L[u][i] && L[u][i] != L[v][i]) u = L[u][i], v = L[v][i];
return L[u][0];
struct lca {
int d[MN], L[MN][20];
void dfs(vector<int> * G, int u = 1, int p = 0) {
d[u] = d[p] + 1, L[u][0] = p;
for (int i = 0; i < 18 && L[u][i]; i++) L[u][i + 1] = L[L[u][i]][i];
for (auto& v : G[u]) if (v != p) dfs(G, v, u);
}
int lca(vector<int> * G, int u, int v) {
if (d[u] > d[v]) swap(u, v);
for (int i = 18; i >= 0; i--) if (d[v] - (1 << i) >= d[u]) v = L[v][i];
if (u == v) return u;
for (int i = 18; i >= 0; i--) if (L[u][i] && L[u][i] != L[v][i]) u = L[u][i], v = L[v][i];
return L[u][0];
}
}