bitset uses less memory

1 files changed, 2 insertions, 1 deletions

diff --git a/Graph/centroid.cpp b/Graph/centroid.cpp
index 3676d25..32d5a19 100644
--- a/Graph/centroid.cpp
+++ b/Graph/centroid.cpp
@@ -1,5 +1,6 @@
 namespace centroid {
-    int sz[MN], cpar[MN], vis[MN];
+    int sz[MN], cpar[MN];
+    bitset<MN> vis;
 	void dfs(vector<int> * G, int u, int p = 0) {
 		sz[u] = 1;
 		for (int v : G[u]) if (v != p && !vis[v]) dfs(G, v, u), sz[u] += sz[v];