Time: 147 ms (47.47%), Space: 200.7 MB (15.82%) - LeetHub

Shrutigupta03 · Shrutigupta03 · commit 38b3f62d0678 · 2024-12-21T21:56:15.000+05:30
diff --git a/2872-maximum-number-of-k-divisible-components/2872-maximum-number-of-k-divisible-components.cpp b/2872-maximum-number-of-k-divisible-components/2872-maximum-number-of-k-divisible-components.cpp
@@ -0,0 +1,28 @@
+class Solution {
+public:
+    long long dfs(int &ans, vector<int>&values, int node, int prevNode, unordered_map<int,list<int>>&adj, int &k){
+        
+        long long sum=values[node];
+        for(auto it:adj[node]){
+            if(it==prevNode) continue;
+            sum += dfs(ans,values,it,node,adj,k);
+        }
+        if(sum%k==0){
+            ans++;
+            return 0;
+        }
+        else return (long long)sum;
+    }
+    int maxKDivisibleComponents(int n, vector<vector<int>>& edges, vector<int>& values, int k) {
+        unordered_map<int,list<int>>adj(n);
+        for(int i=0;i<edges.size();i++){
+            int u=edges[i][0];
+            int v = edges[i][1];
+            adj[u].push_back(v);
+            adj[v].push_back(u);
+        }
+        int cnt=0;
+        dfs(cnt,values,0,-1,adj,k);
+        return cnt;
+    }
+};
