add weekly-contest 381

Author: Navy.Tian

weekly-contest/381/p1_100191.py

@@ -0,0 +1,23 @@
+from collections import Counter
+
+
+class Solution:
+ def minimumPushes(self, word: str) -> int:
+ counter = Counter(word)
+ times = 1
+ numbers = 0
+ ans = 0
+ while len(counter):
+ char, count = counter.most_common(1)[0]
+ ans += count * times
+ numbers += 1
+ if numbers == 8:
+ times += 1
+ numbers = 0
+ counter.pop(char)
+ return ans
+
+
+if __name__ == "__main__":
+ assert Solution().minimumPushes(word="abcde") == 5
+ assert Solution().minimumPushes(word="xycdefghij") == 12

weekly-contest/381/p2_100188.py

@@ -0,0 +1,43 @@
+from collections import Counter
+from typing import List
+
+
+class Solution:
+ def countOfPairs(self, n: int, x: int, y: int) -> List[int]:
+ distances = [[n * 2 + 1 for _ in range(n)] for _ in range(n)]
+ for i in range(n):
+ if i + 1 < n:
+ distances[i][i + 1] = 1
+ if i - 1 >= 0:
+ distances[i][i - 1] = 1
+ if x != y:
+ distances[x - 1][y - 1] = 1
+ distances[y - 1][x - 1] = 1
+ for i in range(len(distances)):
+ for j in range(len(distances)):
+ for k in range(len(distances[j])):
+ if i != j != k and distances[i][j] > distances[i][k] + distances[k][j]:
+ distances[i][j] = distances[i][k] + distances[k][j]
+ for i in range(len(distances)):
+ for j in range(len(distances)):
+ for k in range(len(distances[j])):
+ if i != j != k and distances[i][j] > distances[i][k] + distances[k][j]:
+ distances[i][j] = distances[i][k] + distances[k][j]
+ # TODO, timeout
+ counter = Counter()
+ for i in range(n):
+ for j in range(n):
+ if i != j:
+ counter[distances[i][j]] += 1
+ ans = []
+ for i in range(n):
+ ans.append(counter[i + 1])
+ return ans
+
+
+if __name__ == "__main__":
+ assert Solution().countOfPairs(n=3, x=1, y=3) == [6, 0, 0]
+ assert Solution().countOfPairs(n=4, x=1, y=1) == [6, 4, 2, 0]
+ assert Solution().countOfPairs(n=5, x=2, y=4) == [10, 8, 2, 0, 0]
+ assert Solution().countOfPairs(n=6, x=2, y=6) == [12, 14, 4, 0, 0, 0]
+ assert Solution().countOfPairs(n=1, x=1, y=1) == [0]

weekly-contest/381/p3_100192.py

@@ -0,0 +1,24 @@
+from collections import Counter
+
+
+class Solution:
+ def minimumPushes(self, word: str) -> int:
+ counter = Counter(word)
+ times = 1
+ numbers = 0
+ ans = 0
+ while len(counter):
+ char, count = counter.most_common(1)[0]
+ ans += count * times
+ numbers += 1
+ if numbers == 8:
+ times += 1
+ numbers = 0
+ counter.pop(char)
+ return ans
+
+
+if __name__ == "__main__":
+ assert Solution().minimumPushes(word="abcde") == 5
+ assert Solution().minimumPushes(word="xycdefghij") == 12
+ assert Solution().minimumPushes(word="aabbccddeeffgghhiiiiii") == 24

weekly-contest/381/p4_100213.py

@@ -0,0 +1,33 @@
+from typing import List
+
+
+class Solution:
+ def countOfPairs(self, n: int, x: int, y: int) -> List[int]:
+ # TODO
+ # distances = {}
+ # for i in range(1, n + 1):
+ # for j in range(i + 1, n + 1):
+ # distances[(i, j)] = j - i
+ # distances[(j, i)] = j - i
+ # if x != y:
+ # for i in range(y, n + 1):
+ # distances[(x, i)] = 1 + (i - y)
+ # distances[(i, x)] = 1 + (i - y)
+ # for i in range(x, 0, -1):
+ # distances[(y, i)] = 1 + (x - i)
+ # distances[(i, y)] = 1 + (x - i)
+ # print("[/Users/hj.tian/github/leetcode/weekly-contest/381/p2_100188.py:10] distances: ", distances)
+ # ans = []
+ # for i in range(1, n + 1):
+ # count = sum(1 if value == i else 0 for value in distances.values())
+ # ans.append(count)
+ # print("[/Users/hj.tian/github/leetcode/weekly-contest/381/p2_100188.py:18] ans: ", ans)
+ # return ans
+
+
+if __name__ == "__main__":
+ assert Solution().countOfPairs(n=3, x=1, y=3) == [6, 0, 0]
+ assert Solution().countOfPairs(n=4, x=1, y=1) == [6, 4, 2, 0]
+ assert Solution().countOfPairs(n=5, x=2, y=4) == [10, 8, 2, 0, 0]
+ assert Solution().countOfPairs(n=6, x=2, y=6) == [12, 14, 4, 0, 0, 0]
+ assert Solution().countOfPairs(n=1, x=1, y=1) == [0]