modify code

Author: algorithmzuo

src/class183/Code01_CentroidDecomposition1.java

@@ -12,9 +12,10 @@
 public class Code01_CentroidDecomposition1 {
 
 	public static int MAXN = 10001;
+	public static int MAXM = 101;
 	public static int MAXV = 10000001;
 	public static int n, m, maxq, total;
-	public static int[] query = new int[MAXN];
+	public static int[] query = new int[MAXM];
 
 	public static int[] head = new int[MAXN];
 	public static int[] nxt = new int[MAXN << 1];
@@ -28,12 +29,12 @@ public class Code01_CentroidDecomposition1 {
 	public static int centroid;
 
 	public static int[] dis = new int[MAXN];
-	public static int[] arr = new int[MAXV];
-	public static int[] que = new int[MAXV];
-	public static boolean[] pre = new boolean[MAXV];
+	public static int[] arr = new int[MAXN];
+	public static int[] que = new int[MAXN];
+	public static boolean[] check = new boolean[MAXV];
 	public static int cnta, cntq;
 
-	public static boolean[] ans = new boolean[MAXN];
+	public static boolean[] ans = new boolean[MAXM];
 
 	public static void addEdge(int u, int v, int w) {
 		nxt[++cntg] = head[u];
@@ -85,24 +86,24 @@ public static void calc(int u) {
 				for (int i = 1; i <= m; i++) {
 					for (int j = 1; j <= cnta; j++) {
 						if (query[i] - arr[j] >= 0) {
-							ans[i] |= pre[query[i] - arr[j]];
+							ans[i] |= check[query[i] - arr[j]];
 						}
 					}
 				}
 				for (int i = 1; i <= cnta; i++) {
 					que[++cntq] = arr[i];
-					pre[arr[i]] = true;
+					check[arr[i]] = true;
 				}
 			}
 		}
 		for (int i = 1; i <= cntq; i++) {
-			pre[que[i]] = false;
+			check[que[i]] = false;
 		}
 	}
 
 	public static void compute(int u) {
 		vis[u] = true;
-		pre[0] = true;
+		check[0] = true;
 		calc(u);
 		for (int e = head[u]; e > 0; e = nxt[e]) {
 			int v = to[e];

src/class183/Code01_CentroidDecomposition2.java

@@ -10,9 +10,10 @@
 //using namespace std;
 //
 //const int MAXN = 10001;
+//const int MAXM = 101;
 //const int MAXV = 10000001;
 //int n, m, maxq, total;
-//int query[MAXN];
+//int query[MAXM];
 //
 //int head[MAXN];
 //int nxt[MAXN << 1];
@@ -26,12 +27,12 @@
 //int centroid;
 //
 //int dis[MAXN];
-//int arr[MAXV];
-//int que[MAXV];
-//bool pre[MAXV];
+//int arr[MAXN];
+//int que[MAXN];
+//bool check[MAXV];
 //int cnta, cntq;
 //
-//bool ans[MAXN];
+//bool ans[MAXM];
 //
 //void addEdge(int u, int v, int w) {
 //    nxt[++cntg] = head[u];
@@ -83,24 +84,24 @@
 //            for (int i = 1; i <= m; i++) {
 //                for (int j = 1; j <= cnta; j++) {
 //                    if (query[i] - arr[j] >= 0) {
-//                        ans[i] |= pre[query[i] - arr[j]];
+//                        ans[i] |= check[query[i] - arr[j]];
 //                    }
 //                }
 //            }
 //            for (int i = 1; i <= cnta; i++) {
 //                que[++cntq] = arr[i];
-//                pre[arr[i]] = true;
+//                check[arr[i]] = true;
 //            }
 //        }
 //    }
 //    for (int i = 1; i <= cntq; i++) {
-//        pre[que[i]] = false;
+//        check[que[i]] = false;
 //    }
 //}
 //
 //void compute(int u) {
 //    vis[u] = true;
-//    pre[0] = true;
+//    check[0] = true;
 //    calc(u);
 //    for (int e = head[u]; e > 0; e = nxt[e]) {
 //        int v = to[e];