From bb8b9f827d1dc5328a7d1d00bd200dfa9674c906 Mon Sep 17 00:00:00 2001
From: wisdompeak <guan.huifeng@gmail.com>
Date: Sat, 5 Nov 2022 23:09:54 -0700
Subject: [PATCH 1/3] Update 924.Minimize-Malware-Spread.cpp
---
 .../924.Minimize-Malware-Spread.cpp &#124; 70 ++++++++++++++++++-
 1 file changed, 69 insertions(+), 1 deletion(-)
diff --git a/Union_Find/924.Minimize-Malware-Spread/924.Minimize-Malware-Spread.cpp b/Union_Find/924.Minimize-Malware-Spread/924.Minimize-Malware-Spread.cpp
index 8b1378917..238725052 100644
--- a/Union_Find/924.Minimize-Malware-Spread/924.Minimize-Malware-Spread.cpp
+++ b/Union_Find/924.Minimize-Malware-Spread/924.Minimize-Malware-Spread.cpp
@@ -1 +1,69 @@
-
+class Solution {
+ unordered_map<int,int>Root;
+public:
+ int minMalwareSpread(vector<vector<int>>& graph, vector<int>& initial) 
+ {
+ int N = graph.size();
+ for (int i=0; i<n; i++) + Root[i] = i; + for (int i=0; i<n; i++) + for (int j=0; j<n; j++) + { + if (i==j) continue; + if (graph[i][j]==0) continue; + if (findRoot(i)!=findRoot(j)) + Union(i,j); + } + + unordered_map<int,vector<int>>Children;
+ for (int i=0; i<n; i++) + { + Root[i] = findRoot(i); + Children[Root[i]].push_back(i); + } + + set<int>Set(initial.begin(),initial.end());
+ 
+ int MaxGroup = 0; 
+ int result;
+ for (auto a:Children)
+ {
+ int count = 0;
+ int candidate;
+ for (auto b:a.second)
+ {
+ if (Set.find(b)!=Set.end())
+ {
+ count++;
+ candidate = b;
+ } 
+ if (count>1) break;
+ }
+ if (count==1 && (a.second.size()>MaxGroup &#124;&#124; a.second.size()==MaxGroup && candidate<result)) + { + MaxGroup = a.second.size(); + result = candidate; + } + } + + if (MaxGroup!=0) return result; + else return *Set.begin(); + } + + int findRoot(int x) + { + if (Root[x]!=x) + Root[x] = findRoot(Root[x]); + return Root[x]; + } + + void Union(int x, int y) + { + x = Root[x]; + y = Root[y]; + if (x<y) + Root[y] = x; + else + Root[x] = y; + } +}; From 9f52b0ed847690571c4b7e74ae853e54494557fe Mon Sep 17 00:00:00 2001 From: wisdompeak <guan.huifeng@gmail.com>
Date: Sun, 6 Nov 2022 00:20:34 -0700
Subject: [PATCH 2/3] Create 2463.Minimum-Total-Distance-Traveled.cpp
---
 .../2463.Minimum-Total-Distance-Traveled.cpp &#124; 44 +++++++++++++++++++
 1 file changed, 44 insertions(+)
 create mode 100644 Dynamic_Programming/2463.Minimum-Total-Distance-Traveled/2463.Minimum-Total-Distance-Traveled.cpp
diff --git a/Dynamic_Programming/2463.Minimum-Total-Distance-Traveled/2463.Minimum-Total-Distance-Traveled.cpp b/Dynamic_Programming/2463.Minimum-Total-Distance-Traveled/2463.Minimum-Total-Distance-Traveled.cpp
new file mode 100644
index 000000000..5670539fd
--- /dev/null
+++ b/Dynamic_Programming/2463.Minimum-Total-Distance-Traveled/2463.Minimum-Total-Distance-Traveled.cpp
@@ -0,0 +1,44 @@
+using LL = long long;
+class Solution {
+ LL dp[101][101];
+ LL dist[101][101][101];
+public:
+ long long minimumTotalDistance(vector<int>& robot, vector<vector<int>>& factory) 
+ {
+ int m = robot.size();
+ int n = factory.size();
+ 
+ sort(robot.begin(), robot.end());
+ sort(factory.begin(), factory.end());
+ 
+ for (int i=0; i<n; i++) + for (int j=0; j<m; j++) + { + LL sum = 0; + for (int k=j; k<m; k++) + { + sum += abs(factory[i][0]-robot[k]); + dist[i][j][k] = sum; + } + } + + dp[0][0] = 0; + for (int j=1; j<=m; j++) + { + if (j<=factory[0][1]) + dp[0][j] = dist[0][0][j-1]; + else + dp[0][j] = LLONG_MAX/2; + } + + for (int i=1; i<n; i++) + for (int j=1; j<=m; j++) + { + dp[i][j] = dp[i-1][j]; + for (int k=1; k<=min(j,factory[i][1]); k++) + dp[i][j] = min(dp[i][j], dp[i-1][j-k] + dist[i][j-k][j-1]); + } + + return dp[n-1][m]; + } +}; From 1d1436f477b1db730cc54f3b51bb0365189b95ed Mon Sep 17 00:00:00 2001 From: wisdompeak <guan.huifeng@gmail.com>
Date: Sun, 6 Nov 2022 00:21:22 -0700
Subject: [PATCH 3/3] Update Readme.md
---
 Readme.md &#124; 1 +
 1 file changed, 1 insertion(+)
diff --git a/Readme.md b/Readme.md
index 712df090b..00df457b6 100644
--- a/Readme.md
+++ b/Readme.md
@@ -738,6 +738,7 @@
 [1335.Minimum-Difficulty-of-a-Job-Schedule](https://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1335.Minimum-Difficulty-of-a-Job-Schedule) (M+) 
 [1478.Allocate-Mailboxes](https://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1478.Allocate-Mailboxes) (H) 
 [1977.Number-of-Ways-to-Separate-Numbers](https://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1977.Number-of-Ways-to-Separate-Numbers) (H) 
+[2463.Minimum-Total-Distance-Traveled](https://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/2463.Minimum-Total-Distance-Traveled) (M+) 
 * ``区间型 II`` 
 [131.Palindrome-Partitioning](https://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/131.Palindrome-Partitioning) (M+) 
 [312.Burst-Balloons](https://github.com/wisdompeak/LeetCode/tree/master/DFS/312.Burst-Balloons) (H-) 
</div><div class="naked_ctrl">
<form action="/index.cgi/contrast" method="get" name="gate">
<p><a href="http://altstyle.alfasado.net">AltStyle</a> によって変換されたページ <a href="https://patch-diff.githubusercontent.com/raw/AlgorithmAndLeetCode/wisdompeak_LeetCode/pull/79.patch">(-&gt;オリジナル)</a>
/ <label>アドレス: <input type="text" name="naked_post_url" value="https://patch-diff.githubusercontent.com/raw/AlgorithmAndLeetCode/wisdompeak_LeetCode/pull/79.patch" size="22" /></label> <label>モード: <select name="naked_post_mode">
<option value="default">デフォルト</option>
<option value="speech">音声ブラウザ</option>
<option value="ruby">ルビ付き</option>
<option value="contrast" selected="selected">配色反転</option>
<option value="larger-text">文字拡大</option>
<option value="mobile">モバイル</option>
</select>
<input type="submit" value="表示" />
</p>
</form>
</div>