[pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

Author: pre-commit-ci[bot]

solutions/advanced/spoj-cot.mdx

@@ -46,7 +46,8 @@ const int MAX_NODES_GRAPH = 1e5;
 
 struct PersistentSegmentTree {
 	static const int MAX_NODES_TREE = 2e6;
-	int left_child[MAX_NODES_TREE + 1], right_child[MAX_NODES_TREE + 1], node_value[MAX_NODES_TREE + 1];
+	int left_child[MAX_NODES_TREE + 1], right_child[MAX_NODES_TREE + 1],
+	    node_value[MAX_NODES_TREE + 1];
 	int nxt = 1;
 	/*
 	Updates the tree at a given position by incrementing the frequency of the specific
@@ -58,12 +59,15 @@ struct PersistentSegmentTree {
 		int new_node = ++nxt;  // Create a new node for the updated tree version
 
 		if (l == r) {
-			node_value[new_node] = node_value[v] + 1;  // At leaf, increment the value at position 'pos'
+			node_value[new_node] =
+			    node_value[v] + 1;  // At leaf, increment the value at position 'pos'
 			return new_node;
 		}
 
-		left_child[new_node] = left_child[v];  // Copy left child from the previous version
-		right_child[new_node] = right_child[v];  // Copy right child from the previous version
+		left_child[new_node] =
+		    left_child[v];  // Copy left child from the previous version
+		right_child[new_node] =
+		    right_child[v];  // Copy right child from the previous version
 		int m = (l + r) / 2;
 
 		// Update the left or right child based on the position
@@ -74,7 +78,8 @@ struct PersistentSegmentTree {
 		}
 
 		// Update the current node's value by combining the values of its children
-		node_value[new_node] = node_value[left_child[new_node]] + node_value[right_child[new_node]];
+		node_value[new_node] =
+		    node_value[left_child[new_node]] + node_value[right_child[new_node]];
 		return new_node;
 	}
 
@@ -86,12 +91,15 @@ struct PersistentSegmentTree {
 		int m = (l + r) / 2;
 
 		// Calculate the number of elements in the left child of the current range
-		int leftSubtreeCount = node_value[left_child[a]] + node_value[left_child[b]] - node_value[left_child[anc]] - node_value[left_child[pr]];
+		int leftSubtreeCount = node_value[left_child[a]] + node_value[left_child[b]] -
+		                       node_value[left_child[anc]] - node_value[left_child[pr]];
 
 		if (leftSubtreeCount >= k) {
-			return query(left_child[a], left_child[b], left_child[anc], left_child[pr], l, m, k);
+			return query(left_child[a], left_child[b], left_child[anc], left_child[pr],
+			             l, m, k);
 		} else {
-			return query(right_child[a], right_child[b], right_child[anc], right_child[pr], m + 1, r, k - leftSubtreeCount);
+			return query(right_child[a], right_child[b], right_child[anc],
+			             right_child[pr], m + 1, r, k - leftSubtreeCount);
 		}
 	}
 };
@@ -100,7 +108,8 @@ PersistentSegmentTree pst;
 
 struct Graph {
 	int LOG;
-	int roots[MAX_NODES_GRAPH + 1], tin[MAX_NODES_GRAPH + 1], tout[MAX_NODES_GRAPH + 1], val[MAX_NODES_GRAPH + 1];
+	int roots[MAX_NODES_GRAPH + 1], tin[MAX_NODES_GRAPH + 1], tout[MAX_NODES_GRAPH + 1],
+	    val[MAX_NODES_GRAPH + 1];
 	vector<vector<int>> up;
 	vector<int> graph[MAX_NODES_GRAPH + 1];