| | | 1 | | // -------------------------------------------------------------------------------- |
| | | 2 | | // Copyright (C) 2025 Eugene Eremeev (also known as Yevhenii Yeriemeieiv). |
| | | 3 | | // All Rights Reserved. |
| | | 4 | | // -------------------------------------------------------------------------------- |
| | | 5 | | // This software is the confidential and proprietary information of Eugene Eremeev |
| | | 6 | | // (also known as Yevhenii Yeriemeieiv) ("Confidential Information"). You shall not |
| | | 7 | | // disclose such Confidential Information and shall use it only in accordance with |
| | | 8 | | // the terms of the license agreement you entered into with Eugene Eremeev (also |
| | | 9 | | // known as Yevhenii Yeriemeieiv). |
| | | 10 | | // -------------------------------------------------------------------------------- |
| | | 11 | | |
| | | 12 | | namespace LeetCode.Algorithms.MaximumNumberOfKDivisibleComponents; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class MaximumNumberOfKDivisibleComponentsDepthFirstSearch : IMaximumNumberOfKDivisibleComponents |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(n + m) |
| | | 19 | | /// Space complexity - O(n + m) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="n"></param> |
| | | 22 | | /// <param name="edges"></param> |
| | | 23 | | /// <param name="values"></param> |
| | | 24 | | /// <param name="k"></param> |
| | | 25 | | /// <returns></returns> |
| | | 26 | | public int MaxKDivisibleComponents(int n, int[][] edges, int[] values, int k) |
| | 2 | 27 | | { |
| | 2 | 28 | | var graph = new List<int>[n]; |
| | | 29 | | |
| | 28 | 30 | | for (var i = 0; i < n; i++) |
| | 12 | 31 | | { |
| | 12 | 32 | | graph[i] = []; |
| | 12 | 33 | | } |
| | | 34 | | |
| | 26 | 35 | | foreach (var edge in edges) |
| | 10 | 36 | | { |
| | 10 | 37 | | graph[edge[0]].Add(edge[1]); |
| | 10 | 38 | | graph[edge[1]].Add(edge[0]); |
| | 10 | 39 | | } |
| | | 40 | | |
| | 2 | 41 | | var visited = new bool[n]; |
| | 2 | 42 | | var components = 0; |
| | | 43 | | |
| | 2 | 44 | | var totalSumMod = MaxKDivisibleComponents(0, graph, visited, values, k, ref components); |
| | | 45 | | |
| | 2 | 46 | | if (totalSumMod == 0) |
| | 2 | 47 | | { |
| | 2 | 48 | | components++; |
| | 2 | 49 | | } |
| | | 50 | | |
| | 2 | 51 | | return components; |
| | 2 | 52 | | } |
| | | 53 | | |
| | | 54 | | private static int MaxKDivisibleComponents(int node, List<int>[] graph, bool[] visited, int[] values, int k, |
| | | 55 | | ref int components) |
| | 12 | 56 | | { |
| | 12 | 57 | | visited[node] = true; |
| | | 58 | | |
| | 12 | 59 | | var subtreeSumMod = values[node] % k; |
| | | 60 | | |
| | 76 | 61 | | foreach (var neighbor in graph[node].Where(neighbor => !visited[neighbor])) |
| | 10 | 62 | | { |
| | 10 | 63 | | var childSumMod = MaxKDivisibleComponents(neighbor, graph, visited, values, k, ref components); |
| | | 64 | | |
| | 10 | 65 | | if (childSumMod == 0) |
| | 3 | 66 | | { |
| | 3 | 67 | | components++; |
| | 3 | 68 | | } |
| | | 69 | | else |
| | 7 | 70 | | { |
| | 7 | 71 | | subtreeSumMod = (subtreeSumMod + childSumMod) % k; |
| | 7 | 72 | | } |
| | 10 | 73 | | } |
| | | 74 | | |
| | 12 | 75 | | return subtreeSumMod; |
| | 12 | 76 | | } |
| | | 77 | | } |