From f284d914873b8c62e9b37b82014aa337c46fea77 Mon Sep 17 00:00:00 2001 From: Yang Libin Date: 2023年9月17日 00:25:01 +0000 Subject: [PATCH 1/4] feat: add new lc problems --- .../README.md | 91 +++++++++++++++ .../README_EN.md | 81 +++++++++++++ .../README.md | 109 ++++++++++++++++++ .../README_EN.md | 101 ++++++++++++++++ .../README.md | 85 ++++++++++++++ .../README_EN.md | 75 ++++++++++++ .../README.md | 109 ++++++++++++++++++ .../README_EN.md | 99 ++++++++++++++++ .../images/image-20230826221104-3.png | Bin 0 -> 9641 bytes .../images/image-20230826225541-2.png | Bin 0 -> 7136 bytes solution/CONTEST_README.md | 7 ++ solution/CONTEST_README_EN.md | 7 ++ solution/README.md | 4 + solution/README_EN.md | 4 + solution/summary.md | 4 + solution/summary_en.md | 4 + 16 files changed, 780 insertions(+) create mode 100644 solution/2800-2899/2855.Minimum Right Shifts to Sort the Array/README.md create mode 100644 solution/2800-2899/2855.Minimum Right Shifts to Sort the Array/README_EN.md create mode 100644 solution/2800-2899/2856.Minimum Array Length After Pair Removals/README.md create mode 100644 solution/2800-2899/2856.Minimum Array Length After Pair Removals/README_EN.md create mode 100644 solution/2800-2899/2857.Count Pairs of Points With Distance k/README.md create mode 100644 solution/2800-2899/2857.Count Pairs of Points With Distance k/README_EN.md create mode 100644 solution/2800-2899/2858.Minimum Edge Reversals So Every Node Is Reachable/README.md create mode 100644 solution/2800-2899/2858.Minimum Edge Reversals So Every Node Is Reachable/README_EN.md create mode 100644 solution/2800-2899/2858.Minimum Edge Reversals So Every Node Is Reachable/images/image-20230826221104-3.png create mode 100644 solution/2800-2899/2858.Minimum Edge Reversals So Every Node Is Reachable/images/image-20230826225541-2.png diff --git a/solution/2800-2899/2855.Minimum Right Shifts to Sort the Array/README.md b/solution/2800-2899/2855.Minimum Right Shifts to Sort the Array/README.md new file mode 100644 index 0000000000000..913bc1b5560ef --- /dev/null +++ b/solution/2800-2899/2855.Minimum Right Shifts to Sort the Array/README.md @@ -0,0 +1,91 @@ +# [2855. 使数组成为递增数组的最少右移次数](https://leetcode.cn/problems/minimum-right-shifts-to-sort-the-array) + +[English Version](/solution/2800-2899/2855.Minimum%20Right%20Shifts%20to%20Sort%20the%20Array/README_EN.md) + +## 题目描述 + + + +

给你一个长度为 n 下标从 0 开始的数组 nums ,数组中的元素为 互不相同 的正整数。请你返回让 nums 成为递增数组的 最少右移 次数,如果无法得到递增数组,返回 -1 。

+ +

一次 右移 指的是同时对所有下标进行操作,将下标为 i 的元素移动到下标 (i + 1) % n 处。

+ + + +

示例 1:

+ +
+输入:nums = [3,4,5,1,2]
+输出:2
+解释:
+第一次右移后,nums = [2,3,4,5,1] 。
+第二次右移后,nums = [1,2,3,4,5] 。
+现在 nums 是递增数组了,所以答案为 2 。
+
+ +

示例 2:

+ +
+输入:nums = [1,3,5]
+输出:0
+解释:nums 已经是递增数组了,所以答案为 0 。
+ +

示例 3:

+ +
+输入:nums = [2,1,4]
+输出:-1
+解释:无法将数组变为递增数组。
+
+ + + +

提示:

+ + + +## 解法 + + + + + +### **Python3** + + + +```python + +``` + +### **Java** + + + +```java + +``` + +### **C++** + +```cpp + +``` + +### **Go** + +```go + +``` + +### **...** + +``` + +``` + + diff --git a/solution/2800-2899/2855.Minimum Right Shifts to Sort the Array/README_EN.md b/solution/2800-2899/2855.Minimum Right Shifts to Sort the Array/README_EN.md new file mode 100644 index 0000000000000..dfce2f97540c3 --- /dev/null +++ b/solution/2800-2899/2855.Minimum Right Shifts to Sort the Array/README_EN.md @@ -0,0 +1,81 @@ +# [2855. Minimum Right Shifts to Sort the Array](https://leetcode.com/problems/minimum-right-shifts-to-sort-the-array) + +[中文文档](/solution/2800-2899/2855.Minimum%20Right%20Shifts%20to%20Sort%20the%20Array/README.md) + +## Description + +

You are given a 0-indexed array nums of length n containing distinct positive integers. Return the minimum number of right shifts required to sort nums and -1 if this is not possible.

+ +

A right shift is defined as shifting the element at index i to index (i + 1) % n, for all indices.

+ + +

Example 1:

+ +
+Input: nums = [3,4,5,1,2]
+Output: 2
+Explanation: 
+After the first right shift, nums = [2,3,4,5,1].
+After the second right shift, nums = [1,2,3,4,5].
+Now nums is sorted; therefore the answer is 2.
+
+ +

Example 2:

+ +
+Input: nums = [1,3,5]
+Output: 0
+Explanation: nums is already sorted therefore, the answer is 0.
+ +

Example 3:

+ +
+Input: nums = [2,1,4]
+Output: -1
+Explanation: It's impossible to sort the array using right shifts.
+
+ + +

Constraints:

+ + + +## Solutions + + + +### **Python3** + +```python + +``` + +### **Java** + +```java + +``` + +### **C++** + +```cpp + +``` + +### **Go** + +```go + +``` + +### **...** + +``` + +``` + + diff --git a/solution/2800-2899/2856.Minimum Array Length After Pair Removals/README.md b/solution/2800-2899/2856.Minimum Array Length After Pair Removals/README.md new file mode 100644 index 0000000000000..047faeb8d1242 --- /dev/null +++ b/solution/2800-2899/2856.Minimum Array Length After Pair Removals/README.md @@ -0,0 +1,109 @@ +# [2856. 删除数对后的最小数组长度](https://leetcode.cn/problems/minimum-array-length-after-pair-removals) + +[English Version](/solution/2800-2899/2856.Minimum%20Array%20Length%20After%20Pair%20Removals/README_EN.md) + +## 题目描述 + + + +

给你一个下标从 0 开始的 非递减 整数数组 nums 。

+ +

你可以执行以下操作任意次:

+ + + +

请你返回一个整数,表示执行以上操作任意次后(可以执行 0 次),nums 数组的 最小 数组长度。

+ + + +

示例 1:

+ +
+输入:nums = [1,3,4,9]
+输出:0
+解释:一开始,nums = [1, 3, 4, 9] 。
+第一次操作,我们选择下标 0 和 1 ,满足 nums[0] < nums[1] <=> 1 < 3 。
+删除下标 0 和 1 处的元素,nums 变成 [4, 9] 。
+下一次操作,我们选择下标 0 和 1 ,满足 nums[0] < nums[1] <=> 4 < 9 。
+删除下标 0 和 1 处的元素,nums 变成空数组 [] 。
+所以,可以得到的最小数组长度为 0 。
+ +

示例 2:

+ +
+输入:nums = [2,3,6,9]
+输出:0
+解释:一开始,nums = [2, 3, 6, 9] 。
+第一次操作,我们选择下标 0 和 2 ,满足 nums[0] < nums[2] <=> 2 < 6 。
+删除下标 0 和 2 处的元素,nums 变成 [3, 9] 。
+下一次操作,我们选择下标 0 和 1 ,满足 nums[0] < nums[1] <=> 3 < 9 。
+删除下标 0 和 1 处的元素,nums 变成空数组 [] 。
+所以,可以得到的最小数组长度为 0 。
+
+ +

示例 3:

+ +
+输入:nums = [1,1,2]
+输出:1
+解释:一开始,nums = [1, 1, 2] 。
+第一次操作,我们选择下标 0 和 2 ,满足 nums[0] < nums[2] <=> 1 < 2 。
+删除下标 0 和 2 处的元素,nums 变成 [1] 。
+无法对数组再执行操作。
+所以,可以得到的最小数组长度为 1 。
+
+ + + +

提示:

+ + + +## 解法 + + + + + +### **Python3** + + + +```python + +``` + +### **Java** + + + +```java + +``` + +### **C++** + +```cpp + +``` + +### **Go** + +```go + +``` + +### **...** + +``` + +``` + + diff --git a/solution/2800-2899/2856.Minimum Array Length After Pair Removals/README_EN.md b/solution/2800-2899/2856.Minimum Array Length After Pair Removals/README_EN.md new file mode 100644 index 0000000000000..e0165b87aa7ab --- /dev/null +++ b/solution/2800-2899/2856.Minimum Array Length After Pair Removals/README_EN.md @@ -0,0 +1,101 @@ +# [2856. Minimum Array Length After Pair Removals](https://leetcode.com/problems/minimum-array-length-after-pair-removals) + +[中文文档](/solution/2800-2899/2856.Minimum%20Array%20Length%20After%20Pair%20Removals/README.md) + +## Description + +

You are given a 0-indexed sorted array of integers nums.

+ +

You can perform the following operation any number of times:

+ + + +

Return an integer that denotes the minimum length of nums after performing the operation any number of times (including zero).

+ +

Note that nums is sorted in non-decreasing order.

+ + +

Example 1:

+ +
+Input: nums = [1,3,4,9]
+Output: 0
+Explanation: Initially, nums = [1, 3, 4, 9].
+In the first operation, we can choose index 0 and 1 because nums[0] < nums[1] <=> 1 < 3.
+Remove indices 0 and 1, and nums becomes [4, 9].
+For the next operation, we can choose index 0 and 1 because nums[0] < nums[1] <=> 4 < 9.
+Remove indices 0 and 1, and nums becomes an empty array [].
+Hence, the minimum length achievable is 0.
+ +

Example 2:

+ +
+Input: nums = [2,3,6,9]
+Output: 0
+Explanation: Initially, nums = [2, 3, 6, 9]. 
+In the first operation, we can choose index 0 and 2 because nums[0] < nums[2] <=> 2 < 6. 
+Remove indices 0 and 2, and nums becomes [3, 9]. 
+For the next operation, we can choose index 0 and 1 because nums[0] < nums[1] <=> 3 < 9. 
+Remove indices 0 and 1, and nums becomes an empty array []. 
+Hence, the minimum length achievable is 0.
+
+ +

Example 3:

+ +
+Input: nums = [1,1,2]
+Output: 1
+Explanation: Initially, nums = [1, 1, 2].
+In an operation, we can choose index 0 and 2 because nums[0] < nums[2] <=> 1 < 2. 
+Remove indices 0 and 2, and nums becomes [1]. 
+It is no longer possible to perform an operation on the array. 
+Hence, the minimum achievable length is 1. 
+
+ + +

Constraints:

+ + + +## Solutions + + + +### **Python3** + +```python + +``` + +### **Java** + +```java + +``` + +### **C++** + +```cpp + +``` + +### **Go** + +```go + +``` + +### **...** + +``` + +``` + + diff --git a/solution/2800-2899/2857.Count Pairs of Points With Distance k/README.md b/solution/2800-2899/2857.Count Pairs of Points With Distance k/README.md new file mode 100644 index 0000000000000..be84e3e086170 --- /dev/null +++ b/solution/2800-2899/2857.Count Pairs of Points With Distance k/README.md @@ -0,0 +1,85 @@ +# [2857. 统计距离为 k 的点对](https://leetcode.cn/problems/count-pairs-of-points-with-distance-k) + +[English Version](/solution/2800-2899/2857.Count%20Pairs%20of%20Points%20With%20Distance%20k/README_EN.md) + +## 题目描述 + + + +

给你一个 二维 整数数组 coordinates 和一个整数 k ,其中 coordinates[i] = [xi, yi] 是第 i 个点在二维平面里的坐标。

+ +

我们定义两个点 (x1, y1) 和 (x2, y2) 的 距离 为 (x1 XOR x2) + (y1 XOR y2) ,XOR 指的是按位异或运算。

+ +

请你返回满足i < j且点i和点j之间距离为k 的点对数目。

+ + + +

示例 1:

+ +
+输入:coordinates = [[1,2],[4,2],[1,3],[5,2]], k = 5
+输出:2
+解释:以下点对距离为 k :
+- (0, 1):(1 XOR 4) + (2 XOR 2) = 5 。
+- (2, 3):(1 XOR 5) + (3 XOR 2) = 5 。
+
+ +

示例 2:

+ +
+输入:coordinates = [[1,3],[1,3],[1,3],[1,3],[1,3]], k = 0
+输出:10
+解释:任何两个点之间的距离都为 0 ,所以总共有 10 组点对。
+
+ + + +

提示:

+ + + +## 解法 + + + + + +### **Python3** + + + +```python + +``` + +### **Java** + + + +```java + +``` + +### **C++** + +```cpp + +``` + +### **Go** + +```go + +``` + +### **...** + +``` + +``` + + diff --git a/solution/2800-2899/2857.Count Pairs of Points With Distance k/README_EN.md b/solution/2800-2899/2857.Count Pairs of Points With Distance k/README_EN.md new file mode 100644 index 0000000000000..b16d0642ec05f --- /dev/null +++ b/solution/2800-2899/2857.Count Pairs of Points With Distance k/README_EN.md @@ -0,0 +1,75 @@ +# [2857. Count Pairs of Points With Distance k](https://leetcode.com/problems/count-pairs-of-points-with-distance-k) + +[中文文档](/solution/2800-2899/2857.Count%20Pairs%20of%20Points%20With%20Distance%20k/README.md) + +## Description + +

You are given a 2D integer array coordinates and an integer k, where coordinates[i] = [xi, yi] are the coordinates of the ith point in a 2D plane.

+ +

We define the distance between two points (x1, y1) and (x2, y2) as (x1 XOR x2) + (y1 XOR y2) where XOR is the bitwise XOR operation.

+ +

Return the number of pairs (i, j) such that i < j and the distance between points i and j is equal to k.

+ + +

Example 1:

+ +
+Input: coordinates = [[1,2],[4,2],[1,3],[5,2]], k = 5
+Output: 2
+Explanation: We can choose the following pairs:
+- (0,1): Because we have (1 XOR 4) + (2 XOR 2) = 5.
+- (2,3): Because we have (1 XOR 5) + (3 XOR 2) = 5.
+
+ +

Example 2:

+ +
+Input: coordinates = [[1,3],[1,3],[1,3],[1,3],[1,3]], k = 0
+Output: 10
+Explanation: Any two chosen pairs will have a distance of 0. There are 10 ways to choose two pairs.
+
+ + +

Constraints:

+ + + +## Solutions + + + +### **Python3** + +```python + +``` + +### **Java** + +```java + +``` + +### **C++** + +```cpp + +``` + +### **Go** + +```go + +``` + +### **...** + +``` + +``` + + diff --git a/solution/2800-2899/2858.Minimum Edge Reversals So Every Node Is Reachable/README.md b/solution/2800-2899/2858.Minimum Edge Reversals So Every Node Is Reachable/README.md new file mode 100644 index 0000000000000..42644e5e50e3c --- /dev/null +++ b/solution/2800-2899/2858.Minimum Edge Reversals So Every Node Is Reachable/README.md @@ -0,0 +1,109 @@ +# [2858. 可以到达每一个节点的最少边反转次数](https://leetcode.cn/problems/minimum-edge-reversals-so-every-node-is-reachable) + +[English Version](/solution/2800-2899/2858.Minimum%20Edge%20Reversals%20So%20Every%20Node%20Is%20Reachable/README_EN.md) + +## 题目描述 + + + +

给你一个 n 个点的 简单有向图 (没有重复边的有向图),节点编号为 0 到 n - 1 。如果这些边是双向边,那么这个图形成一棵 树 。

+ +

给你一个整数 n 和一个 二维 整数数组 edges ,其中 edges[i] = [ui, vi] 表示从节点 ui 到节点 vi 有一条 有向边 。

+ +

边反转 指的是将一条边的方向反转,也就是说一条从节点 ui 到节点 vi 的边会变为一条从节点 vi 到节点 ui 的边。

+ +

对于范围 [0, n - 1] 中的每一个节点 i ,你的任务是分别 独立 计算 最少 需要多少次 边反转 ,从节点 i 出发经过 一系列有向边 ,可以到达所有的节点。

+ +

请你返回一个长度为 n 的整数数组answer,其中answer[i]表示从节点 i 出发,可以到达所有节点的 最少边反转 次数。

+ + + +

示例 1:

+ + + +
+输入:n = 4, edges = [[2,0],[2,1],[1,3]]
+输出:[1,1,0,2]
+解释:上图表示了与输入对应的简单有向图。
+对于节点 0 :反转 [2,0] ,从节点 0 出发可以到达所有节点。
+所以 answer[0] = 1 。
+对于节点 1 :反转 [2,1] ,从节点 1 出发可以到达所有节点。
+所以 answer[1] = 1 。
+对于节点 2 :不需要反转就可以从节点 2 出发到达所有节点。
+所以 answer[2] = 0 。
+对于节点 3 :反转 [1,3] 和 [2,1] ,从节点 3 出发可以到达所有节点。
+所以 answer[3] = 2 。
+
+ +

示例 2:

+ + + +
+输入:n = 3, edges = [[1,2],[2,0]]
+输出:[2,0,1]
+解释:上图表示了与输入对应的简单有向图。
+对于节点 0 :反转 [2,0] 和 [1,2] ,从节点 0 出发可以到达所有节点。
+所以 answer[0] = 2 。
+对于节点 1 :不需要反转就可以从节点 2 出发到达所有节点。
+所以 answer[1] = 0 。
+对于节点 2 :反转 [1,2] ,从节点 2 出发可以到达所有节点。
+所以 answer[2] = 1 。
+
+ + + +

提示:

+ + + +## 解法 + + + + + +### **Python3** + + + +```python + +``` + +### **Java** + + + +```java + +``` + +### **C++** + +```cpp + +``` + +### **Go** + +```go + +``` + +### **...** + +``` + +``` + + diff --git a/solution/2800-2899/2858.Minimum Edge Reversals So Every Node Is Reachable/README_EN.md b/solution/2800-2899/2858.Minimum Edge Reversals So Every Node Is Reachable/README_EN.md new file mode 100644 index 0000000000000..19f46a22c2852 --- /dev/null +++ b/solution/2800-2899/2858.Minimum Edge Reversals So Every Node Is Reachable/README_EN.md @@ -0,0 +1,99 @@ +# [2858. Minimum Edge Reversals So Every Node Is Reachable](https://leetcode.com/problems/minimum-edge-reversals-so-every-node-is-reachable) + +[中文文档](/solution/2800-2899/2858.Minimum%20Edge%20Reversals%20So%20Every%20Node%20Is%20Reachable/README.md) + +## Description + +

There is a simple directed graph with n nodes labeled from 0 to n - 1. The graph would form a tree if its edges were bi-directional.

+ +

You are given an integer n and a 2D integer array edges, where edges[i] = [ui, vi] represents a directed edge going from node ui to node vi.

+ +

An edge reversal changes the direction of an edge, i.e., a directed edge going from node ui to node vi becomes a directed edge going from node vi to node ui.

+ +

For every node i in the range [0, n - 1], your task is to independently calculate the minimum number of edge reversals required so it is possible to reach any other node starting from node i through a sequence of directed edges.

+ +

Return an integer array answer, where answer[i] is the minimum number of edge reversals required so it is possible to reach any other node starting from node i through a sequence of directed edges.

+ + +

Example 1:

+ + + +
+Input: n = 4, edges = [[2,0],[2,1],[1,3]]
+Output: [1,1,0,2]
+Explanation: The image above shows the graph formed by the edges.
+For node 0: after reversing the edge [2,0], it is possible to reach any other node starting from node 0.
+So, answer[0] = 1.
+For node 1: after reversing the edge [2,1], it is possible to reach any other node starting from node 1.
+So, answer[1] = 1.
+For node 2: it is already possible to reach any other node starting from node 2.
+So, answer[2] = 0.
+For node 3: after reversing the edges [1,3] and [2,1], it is possible to reach any other node starting from node 3.
+So, answer[3] = 2.
+
+ +

Example 2:

+ + + +
+Input: n = 3, edges = [[1,2],[2,0]]
+Output: [2,0,1]
+Explanation: The image above shows the graph formed by the edges.
+For node 0: after reversing the edges [2,0] and [1,2], it is possible to reach any other node starting from node 0.
+So, answer[0] = 2.
+For node 1: it is already possible to reach any other node starting from node 1.
+So, answer[1] = 0.
+For node 2: after reversing the edge [1, 2], it is possible to reach any other node starting from node 2.
+So, answer[2] = 1.
+
+ + +

Constraints:

+ + + +## Solutions + + + +### **Python3** + +```python + +``` + +### **Java** + +```java + +``` + +### **C++** + +```cpp + +``` + +### **Go** + +```go + +``` + +### **...** + +``` + +``` + + diff --git a/solution/2800-2899/2858.Minimum Edge Reversals So Every Node Is Reachable/images/image-20230826221104-3.png b/solution/2800-2899/2858.Minimum Edge Reversals So Every Node Is Reachable/images/image-20230826221104-3.png new file mode 100644 index 0000000000000000000000000000000000000000..ad91bddf13147c1b5d9d31ca7b58761d92ba0bb1 GIT binary patch literal 9641 zcmch7hdb5r`~DHx5fLGy%(9b}QAR?>u~$YMJC5uvS(%YgRvD2QviCg7-en#uA%tw| z`<&0`dtkju;ckdht&keo^?tve_w(g(ec#xpg{hdf1ytl51ojne`gjbk0)zze|k2ai zgipD(R0jBqz*SCJhZz3&5nDyT|F5_y8n|gYTf2E$JVhaFoSdJa_*^ZYqEJq*w5ドル%_ z_{}o#OZ;{^250ドルCQ5J4?&Q7d4c27|7O1ドル`_{a_iZuqf-`r@`{U3RYo3;ajZ2!jeKl zl7fO=c=%oj1S>*W;hv6H+Qv+vzDH4YJ|8MLR0d=l+Op4rzV z@kf+j?%#b_dW&1zvXmr*h4J&xbNTGj!jEp$%*>|RNV+)JNqFLY|spn3;%_4VZw*dHViU<;aoyffrN1>*(`J3k`^F~PO zXJQ9rP9E;v@@Zsts!nB7B54omc?x0hoOTIc^Oa1e;N#=_^xY9zUCK@R%j1ry^K8*^ z6Fl|A`tlM!2LV2R)X`bMv&2ano@LUKSk_27(=2N?MWm*l-eqB*TlD0=kNilQb;vzy?L`>adY;M+sC^H;Uc+lu zJ*6w4_K06!YxDV=KI<`}7frnqfbwh=%h}3jqbjelott*5k~u#imh<#h$htzbl`u03 zB%?;hlh)iMzisU29OUNaaxA6HZD|~;kbY$*hbuj<&)hyn??i;le9vy$l1cp`a&jjh zr(XT_i(JCG%;1{6B^rG(RrE>QLDPY>-^tWm*CWrFP<=e1+xa84d5`mgh)raz?w2db zG!P{#N-6*Rj|SqNvni5(u|?%SioAcT_IDeZK=iSvVUiGJkA}<NfxAh&5Uv~oo zWtjs{U6xi>lurFCUl8`^Xh{iTxj7*ca{BsoKL#>c_A1=$Ek0cKQHX!sf}*PI8G2x? zS$Y5~o3Hez*KAZx4UUXlQk{sP4#rDX9Ob0RdUP97ドルXM`3#{jElmzGkp`2V4DYTVO1 z-OcK$#NWJ804L9Q$P@0*)h0{`x2 zx~!yo#?}|d`!khbgn!Ub!rRR9FmtflSnOy%Hm_C8n_cxhX~;HY zVqNXnzZBi`dD=KJr(jYSLUO7>91@$vD?MF?HQYJB{I zBR`q30=65*5uwQAQ1Nqd)D_z5d{K;V>iw{yF1-aOH2^*-BC|E zSv~JkIWLi{?{Dlqq^T*hUvoi3ドルX`;th?D>OU#)->6yet$yP?YFJ?brGl4ドルah2iNy3 z1{U{x%3D`Lp#_#?&&^`lNt{qXKWN-H}~*C0)5&}?oC#!yQ6txgxz&NVrjm!v6mpJ==FGpSD;!;9fyk*^c z@yU}Xk8N$a17yj+ibF0`d2X4;r>5S7wK``TeHC$gfT|>~Gcc1(SKljllZs`QzH#H` z&F4>ECnrZeC!*{+;*x&@xta?ZqF`#8fnfF6oW3Hpx#tu5#Y)AX2A~-uT z#r5^;*Wiuu@$pDpb{4CkJ?ygBFwZ>60enqH(p8?pbvE{6)g&Y)-A#!fzIYEnJEP znoqSpS5-wOBqU%_`x=4A+S}V07R;VhViQ#Ihtg6F8ag^M#N&<0o0iqv2m33t*wp>} zA~q`(vzwdEr1rmAwoONO2&yZjDnk z0p+qgdp8PMK%J+a-Ufx|vNkZ{?Y-}{Bw5L_ikRn0k7ZrufI4SAs zzV4FFw(9AfLo+BQEt}WyJ*pGQZohyiC@4Um9=iORZDa)W{kgv09(AdU|(HPljB7GXJCC87Itmv9XY#U{FJYl+;f5b+5IL zd74^US?&kit@P+CMX+VE%e*Zgwe!#iGoFhr&+xflwN=HZMU0xoMcAolJoiWey;Cp$m zUuBr!gC*FwdG!?1(D0+n0C$G)fx2r_-P2{#BwoYd>q@cjii*g?DOs#*KIRt}cTPDs z5ドルd5`_NEBoLu^xI17(r~%qW`YN@0`gut_T~FZ!E$MJ<2npj~>4JYJD9_)jTH*HEGRVWe7%`+%Z6gS$ng2IXL!Z+4}=yt>M_KC6puFMj-85ym?c=_;x4$*{--(Qh zg8nY(JS$aPpI8MzXI}AraB7MS!7U(w*&UFLo18R?@x339yOlw;)72{Hx!ATgIX8EA zq3OpuhK4UPGMIl&RZ~Kz6ZbzBxy)x2q8N4gyuOm=+Xu&M`jLgj#?_>VYXSlqaEaYa zdUSgv7ドル&2-a#u-lS3T5mas8_ygEDq$A?)yI<(o9~pmmm=z0ly9(x^^qulsv1qz=mu zvwS6{jRo!#56*L486Jc{A@%jcp%!q>$e{LV?)amxk`P;9JdlIy`|7ドル$b=q%lc;5MQxgPfe)c7`LeHI65ドルqbr87Ge`LqAaZ7=fL^I7 zAHPY>MdTeQIg+_Bp;vIr!IqYw6ftLjwHr5XbmV0Q6u2jIs{?S~!~yuzr%wqGLY7_R zL*wI|VPRoThcn~jdbpHA8W?a}8LIo)+(K-%=B79lZYRBd{l2<7`sy&kw)7_?jbbzb z^>namGC$s70c*=pw$kD-UGrRAe}6wVpgJ-u+Gp-RB)c8RYe@O|*)5NKEYIO_sUYwquVpm}63V@2E zD|t_=dp34lO!&+f7&$@*x)PCKB*bPngLo<|6|ujy>}-`RpNsU)Cj zRdKrwxhR)}LTYMWq!y7(=U-6OHB1U+SEdSoJE>Ya5tWpblt>{-Xc7rIgA$yET>rdD zVTV1A(`6+cPMGu7Sb(LCmRYh&kv zxcT|5Ymg5*6XHooD)n7lwl4_iHkvx?Bxl7p73n#Ajrk$|{^XueO4(C%uSc)-t!XFEwTB9}>7Twwk9pbgQiRI`ZE%Un_|f|&`}nM^$x@I$ zqDjR>7D><-^_&fcr=^ zYTYi%30RN%OFo-udbBe7*Eb=*eAU($?Cx)LAsJ|{h4P^qw0MMko6=n3!M=FC+#xaeUyoR8*iean4 zdv|bbEEMpxxL)y!%0_u*Zm!}h+Vh}1IbXr8jflAz@cHpzu`=|9ドルJElthlc%02iWy^ zopIuO8pV4yHa6Ycwp-rc9Yy`tjpyW0D2@Q!7RSOSYb%MxXP-w^w6@-RkPrgld!Lnc z4%e7kRaCeuzpH{!8*8GJJsyht{Ug=+@j}N7dV2c10Rb|9k0+WJ>gUd!di{sj_khn* z9q?RcYV91NGxK}K^7nVRxW_MgXrA;=i8S_%Lk7G_5mQG;1A(#4XB*BnyZv`u_J0{R z{QG;tedC6ln%V`K%^_>a#Z(w7u@OIJr@A?oqz|U?5x8#U zCV92#aDl7=#0*unjUc^TtYUqt!Do83i=dQLH0@12^M8NOQY77PP_W1pNuo3o3m`^p zJ;EUUL3NB{x8vVM|Dd9*wArFZ+gU@0Ez~P+gC{2f61G@5VJfev7&<^I+qEuU4@3t3Jz6PqL*62o-2QK?R4}|>Jc!C+ zR9IPAv4r*Ih)tUOB)t5Vc07ToR;k;E;N`U~KaE+Zvzn=M|5oWhx3jY|I6K=9#Y9qh z@+5wCPymS8a!>MqZcITz7#DZC3t+(H(mXoe%Xv~OMVJ;T?YsZ3puoQO~R>vej#z1Tf4fC0|H;*x6r?_Yk5=p~g3 zNlqTe933?zGT#1Ua=d+mIlO*6`!U}>YuApA&(+mYkbXj*n zWu=JNC8XSTNIE=RjJxiXS6O*GM;0KBs`}DR!fAKCVxwFm(#d&rbU{~7@asgChn(8o zTTecp@SpBiH`7we9KM5MS%9q|E0K>LT^-J3eBzu!Y*OH!e&v=m_Vj3%4YRwm^YYcJ z=Kz;bi;0#M-#;U;*?D z3~jIubi<^j462wu`^qq;-6kd=wic=!tcivq{z2o@gzwiok@k23dt%uz(4!nd!ushb z$j3U*Hb{JQxGT-9@oiYm2+Of{8>EJkT70;+j!ptLYU~H}XaTI|--_HjJ^c z@g<`fei(83=xdyo$q%%+j==j@*h%xugc4aou=rv_?`ln7{qa_#qu#%fqlbwclag<_ z+65Ls-IFY!v5=Wz>sZbkKGP&HKJ%-cgy5XTzrfLjp_dN1YAxQ4rfkYuy(jVvF$c&eE5|)7^nGt1r|= z24&X@ga;Lj%8iP@HToW;WD2GBeKIPxV7ZN?IS(QJ?Ine-HL>iE024_(y?^v5P;ot^ z(UkRK%{<4)r`zks|1b~oe<|lrgb(ytj?hi6r8qmh+1>4gCxA9Pc*=YZS=3d>MYo9( zVYvP`w$=PWZDDF6Sxs4+THZ*foBZ5{M`6i#MsKwg!FxrI>XQz}xEE_?oGb+CsXYqw z>gpspi12x6(Uvpx#igZjQ!#tkIOoinG`vSc43Or6vw`FIU=&Z)@4 z?OMS_H#fJCGs>B7-{=o^sd6Llva-HSO|@hg0uh_nxrpQu`f}0f1<}iidggvxsle@d z_=uL63p~~V2ZfRQvwEaAU zLxd-mOPLy4zFchFv>!*-pKQC9kD*GRRi(nh!y(ND!C&(OeTS@k@39H=Gk@~hwGBJm z#Z-OSSDYKR332!ez4R_?&>|*IX^f>3_q1c}!YOWk2vYfA4jKR;D#x zo~Tch^$)kU5E2}Nl&T}RD~(O4y-7vYNm+e?JuA91==%SD2#6hU(jJe)74q;m8*WgTZxdBx#L8YP1MM>5x25N(^ASS zm5}iYr@YhYp0h8i=K>fdBqZpWneVHsQ#jSFa;8bR65`OfW{RY`zHwq5)lHTAUW!k{ zsmws`@|3SsMg;z5Zn9|`%fCYm5`(k!kTrN~su*%Y{Pq}bH9N^**IE;U2CwaWOQR%i zqXsXR2i>zJW(TUn)5)ql-Hk+tm+i2i9u5V9m8JCqCjKzmMCq=Rsr0& zZkN1~H;KMxVE(wv5+Z)Ct+jz2wmt1SFu$|hL$XCi)oHlnd4rsz=jk_Tl}oh;SrhBD z@S^q_K+|P`lW@2Ng$|b}LA&NEl7+Q-sL*oJjoTG7PH`tkz>vS83xUQ4loS@KP6wQ9 zv>pIHceXw!TAYQgH7AmYvxNXRreJ)kSEx&H?paM5aJ{%%%Y!|TnKwK(COK48Ri9@T z78lcUsi#G#21alTY2CnvT+C`}l5sqwkGVhZCYkLtwc$agoX}R~Ec^zfRTP~-q)mqR zeefcP5!b}T^hYNq$PAORH!o3fsDC|g!g}$dySuxEye<1rsk(zujbe@(0hf7y81kxk zG^2*E9P!ZHoWOXgnE*(k|7tx)(bS(?TXB1F8VW8sN3Q63aLImsD_ac9yu}bB$Pfd@ zT`Py~b;eHaNa26ドルr?5WsFe+KkgUo-YMBpg5Yy}+Lfhc9?*gKMW3* zv-|;L$f~EVPBiWR`4a&Y5G(Pur$^D(*Vkm=p2A}C4xU)shDQ|Camw>PbHRw%*w~Og zS1&IE9M6CX#Yz+w6ewtDXteb!E39elGn#JNo1w}21_`zAt|6kq*1 zq%_WW*w{G#dknQF5O}1@Yu3aB)yi-X%YDn%l%K~~S5Gese56N@9@U)fPt6~kls)bw z?ah>B38%O^jJw&h>oqhuVykcJeZKjyQy`c&1hnwbdS> z1$oZ-(+x=NlEYjC{d15l1%g(rm!!rONv(wD;Rbsgq);e$Yq_e)FEcaalvw;}aLE8u zipou9zHU^Tl37lL&)9{FsRf{ z7^0Qg3@}4+{@L5J7|K#K_-u>(?Jb%0ursLV-2CO;0f;vk88LQ3%~{;r>)gmRA#C{r zP&+t34IDS~v*SHbsvS-KCxSNpOd_{$pU=#T>Zp11ドルvV@7pmEkWP%oFG+;NwuNVsw$ zu%jQfTVnzuw9ezlW|{Uj`yD-n&Wu3(=ueNzR*LJ&m4(#Ck&KhGY!5YPMy*d+lswd5 zv6BEBc99T3y;E?iQ(4W;%Tv+;DJxdQFCaj-v9VE*`5I*i)&PO5v55(ed1T8}^Y&zc zGEC|F5h1oazP{IHUrCxba%Jy`=avxGHW4h)q1jn}sKn=ZTDrO%K0ZG8{hhufaIoFe z*3@JLQmn8-MsN<6;8@tki}lfogcfojbigkn<0%zdp?8!9?a;xdkmkfxh4wldfyle# z>r`0ドルFhk1lwz)M3j!joky2Op9EY;}xeGX-<4hz*c;dn}xb?etepkoy&!l+0dd-?jk zPQr*9aH_p!A1`@y2ドル#@d-Ma?G;~@l7d&wnCeJC+?;lY|T*+6FFD#upW0co6#7k%^{ zh6YUHXhZ^gXhR-1Da_fhyGLD)?N-9AkIM+A0OtVhTDL&2!`#+OirH`fyNzYlGFluM zHs+KZ#a(ucIDCde--VXlw`#B(|2 z(X2CX8LE+BqIf^D+C_^#fByVq7|6745uSS{Wb;Xkk-|!SKG`5L!`sORN3ab zyBdb4v?%&y@^i%IGg>;jsMuHvwvdbP*jFoK{5YAHRvN;k*6rI?{v6gHV@Yq!UIt{~>R@-yuJ zoHxbOnY1*f{IkeaH%Tw44D8ns1)#7%XFa>OkB@zTwuYo9#~GBx!^wj^+*trEA|)SXR5_e76xIrN|M3aVteHyVhWS(VMtVd5C_Hwa-GWiHp)J1zm!3%`)9XCl~ z(h{C|y2N$Z@7eU+u)_L%QxkJ0Xxxr7B-uFFK@n5$|Fi{VhiLlpvJYeK;XE`Pl$AE_ zGeF8}YH9|Zog8F?rEzw4Mpco`<^c@u|$}MXCceaI_ zqh$E3@t8DtQAK89k5)2q-dNLqWvQY&OKdqAek`@z#<0*z~w1Bx|8hGaZ=g%K( zjMyyh;bC_2yW^4utC(1Mb1JRkJ!NI(ZWqI(D^IUPzaoe9z@zK)uc_axBlDbb*Y74Etukzmg@zN4dm#Gzn_uu?QKFS&!9Zmeqp>^THg#xm*O6~^bFSyLn zBBNGB!VGI6MBo+fctdvQ+M2y-hBX`x;Yj@7g9MvkK5A>f`t;IOGQHs71ccPhcq=OS zg*148bTk}t;J$e?>SWnoUjF$S=dBj~Y)SqBIFlf*BHm~Ub}mdI@BK&An`2_H3T0we zcHe*a!1;^)J{&3O@Rieidr3ig0Ss1{a=ZA1k&2P1v$(Uc}_V& zZeQsEL3n#>&oFP7FFMf;4wAs(8Nfx7JK?S7L7*pUP!h4&2inlWzyfee6^xT2Y%{+e zgr~&Qwz%E0>IUYPqRB@(1RO|!bcC;-m)aNcW3^&2i_hTjhdQ%~Y#k$yYtF>_e`b=@ tJi^Zpai9iPKQoie|33$&loiz#O61Ig{|9MI=bHck literal 0 HcmV?d00001 diff --git a/solution/2800-2899/2858.Minimum Edge Reversals So Every Node Is Reachable/images/image-20230826225541-2.png b/solution/2800-2899/2858.Minimum Edge Reversals So Every Node Is Reachable/images/image-20230826225541-2.png new file mode 100644 index 0000000000000000000000000000000000000000..2251e91420f1465ee6840d3ef91e376024d630f0 GIT binary patch literal 7136 zcmZvBcQl-D)a^tVgCRo@-Drs&-(7dz?~iNEGQ9K5d7rY+-us+4QcYEXl$eef0)db!DavXvmr}dE2_0V*-^6)lwvxHbXIXhZ%xtqILS~|JgID70|Z;=Fp zxNWs`J!IT0O+9R#ose3#j+Wpe1TvUASdQcqLJpPt1wAJI zl|h`eqU`5xBs=SbIf5c#qol?k@{1vn-PFtsuL8xEGjJVZp%;#XK_Joy1aTM=hL<({T5Nj-0a9HbHPitIdMVs>Zck?W=ijdpgWwpI)w zi&A3#Dp45v+p^nOwH#|PFAU3a8o(qYBNJ~~w|(BW#KW2Z1FsPON{K^jFi&=+Z&sCW zv$H?@GpJL#{_G$MMYCvjJ=MB_iPuT)v2fX4l%Crm#Jk3xq|{+n9&YX0X-1y*7>d;* zCLtk7-yz4pR%Z}vs+eMq&@cphFp&K)ePRFnQt@_@B0I$sX5$pg4;ptFBm;E!&tD=< z?Chd4I4$l%S$^N6j-ITvj`!$}coVrFJGWuHlvNF~Dd!Ln+b z@d&ImUxSNTg)i-sZ;38SKggP-4s2b@&~*H(Zrm4xdWuL{M2x(>(P{xvT8y+}Z>EHA z#Y(j<%4&_k#%zpne?s8bg;m$>WKBUTDuOwPrsZP!K?Yr%U-7(#LM(&rx~{BWt-PW( zSQ!R`=`{jdTRd;v_$H5YvfP|--fx5J;OOXQD$Q0nsT&%N4QUaDxh zgX3fS?1*ouOmYoF`3LFE{>R+&J~&c`nJ=WzN{u?1|Lzhpht`JaEh5l}X`24(v?CHZp%Ak{WW*uV^D8}dC`9hrM#`sd7@PdE@cggu{ z+E9zzl9i!FRmzK2LQ2`ee@`v{HK=he_GgLLy5gWr{+s0m-3k^|{jeT491d6OyMMd+ za?81W&B+(N2Y**-IbMzRjAgGIMb z{%TGz(}TucJg?2k7ZXPQj$ATq6_i&K6_QVHie}4F#r-bK37^>L3?sS4BP<+2$m9bf zKJ7JzGpiIUu=w9hOsmyHd-nDB)BQ~gkc`_2SQTGeUvIOPI@e>6@ImbF?_bSLHA^fk zE^yPFlvyRPzem|&;i=Wt9LDQ2{G6TNw`$%?-tBx4L=FxRFGNt-Zm|AXZ=)WaS8akA z<{pr9s`lh+5snp8i89d(da0{d%|)q4bwaaqsu(ktea!`vnqeiv5te|jpxm!;nwnh3 zsUr2=H>-`g9qPD7mbuqN{LqD+^qa%0=Erw)nLCp^!NP%F#wbnc)aMbs$ARI znaJ8(-uDeh>P1N_dIBb65c5#n_XjND;(`E-^h8iuo0*hHK;T0IIJiPzaYnt^d|pBJ zWMxweix1oW=v)L~DzkDLycdu9P@e%S`uWj;L;%_C@C#y`nKA1~5;5fy^P!BOjyIXHf zcwQNBM+8U?*b`uvb?HXZB`yy}e75UW(}Vh51nA^Y)Hr?Q6!_MYBzB^lzXye`=SPl^ zuV;rFydom6l=JbF679w*#z^1H)Hvgw2A|!`4)~)4vg$`{?oFNI--!~6R4r~|NjLho%G@+wBdMUg-JRvpnek#Wg zpM5s4UDLHY{Xtl*DZWU@A}CART307JH-&_FczfgKycY})ecavMVfc8v=a;o!TXX@E zIce=2e4+ek{bahAVdz{ZFsHc&Z~AqMroeNr&G{z!3KR~&z=|~a<6stq$leyfb1zwy zp~bX4Jp3G5AyMGfiexvGmq9@0{dbzeF}p(w%miOaZ&om4;svlQKFi;e!@-B&m-(!$ ztmyo978j8LlFa=%QVYX`GUO#4;L8i=^T)fp?KiI1dY5~=r!(B&KMkOvp$W<3m8);! zz|q6(Fub38B5rjI%J~#s-Q9Z~H=n+1Xz(9noDaUhF_Y#*Eb~@hHrW z{0eZCDXuFf{gR0Oav-W^MqPaIbv*ohRq7uR#AmPbR>HvQ-eGAlBlF2u!ZKH!yib#n z!)$H&l7=u19F4&L(cjMp>k$IVYY`O0v^tOz0f^N>OX4zIAJ8W+qzPdwX$xtaxo>gMVwX!E3AS z#}9aa_QU8GFRqQms*J+=0s3419+s+OwaUDAj5K8sCccl409mzv;*8dA+yOpBua-G4NFE#> zE`cfU`beZ?78-D0-6h_VHVl0&k5k``DK8mFr#9Ad4;LrpqzA)0o^}gsH-(_$u+=o7 zRYf|VZWPt3DtejNKK3+h4xqj9@BrcG=jU>H=IPTkpOX1B5Ym{;uf|Gc9jcWoMt^a! zD&_18qBvEP;N!i`$Y?(}s9IiS!vnF11z}fWTC+1A6!krB*wLb9sOMzA&d zK#%K3=P@PsqP62B&p0KRZu~iw_`dAc+pn_S2@qK_%VngDz`uh3vRmEKouA|-1OU!l z+}y0Gz1q+J)X?>s+i^fyY|q9@gTj>a^QID8s6aL<1f#+pt30@76r7uty2hcqk%lvd z5vG^oNPE4G5EF0r(XzZ7CoMo%Z3&mmxsjlVAC>2#^Ph<#z5o0vee0jm`ed+ff}7j^ zMv=F4G>dnQ%=Nq0Q!eB=qcoc4`nSvDD}iuVF3*pzgL5A@15&Z2L0zoN zqdFcNhQD}x?z%NCcoHDl5Fty}LCd23L{-%cz&kK7 z@Z{GWDcfTg2n0}B_x4-^OD~^u4O=f@*dlGN(-?5{I>6>>H5+ zXKF7Xl8;*VuCxttrc@OLe0W>$-Q$z1l zlq@SivxxUL!}sNixptNa6GT05U?QIDlp+1ZXlcY%>b>c;{N*Ov5Fta>iuAyGZGyRg zWeP!aRjTcGTII{6SkhvS=^92q8#Vw6z!-2pBTZ3N=T0s6+|WUxP$php)L`3d{1r!+ zMA$rXds82nTUkNDsf^8xi$xBs%7`8ドル=W(6@o8}BQ<{dvzxpd!i)g}{cr1tm(%v+9` z@_Kkr8o#wq17iv81k6x=>!HuT%i|hDm7w>s>K&V#sDgq5KwXpjqzLD0b^cHaZyQcwOHzLI-twXu< zj+h))0VH8BLx5DgH{iY!2(KFvVlf5Qu{ z62x}2HA9#)5D|Ur0k{F!HpVFFH40T!^b7x*897#R&Zss7ドルQqtZY*Yr!!u8TtL@fMm`2mw{_nK$&q%FomNdG%I_ys#lu1DH`9p=cR`rWKX20kfH-TC zJMTHYRpXy5T6i&0tnYUV}hb5Qrs;74HQoWxD{S&b8-~eMNfE)TI8Gy!eCAb+Jx~_fRzWnOC`b)( zo)KB%-am))RX!WhCt1>F2s>XH@wPTRU@zum@`So*b1^8c=sAX$Uz=vOfW?n?t9xz0 zZGG(Wu@6i&bOX~XsKL}*@dHZQf%G7*sRG#BX~sDSMLP%WXPoRtNWFfNAta3m9lsGf z{oSvD@X?BzHAdCB$GM|9@Ep|HAgf(Zc1<%s1l&Ipj`PmUh;hG_#;d08?ZEM$^A4PvgBz>%-}VkBTlwGEgC`@ouCX)ZPLMN z>0H*4(hDIeiS-0g>&RJ@D+FvGaM4dCPuc4m8b~i^+uG2cGGVhZx3s)Ps*jNngO;E< z?YWQ7&b~iueu?Xj!-4vVw8@xKj*^%lT0t%=gujif@QBIdxk?aMcPyh!aIjQ;eLbC@ zl(4d5Cvwxp=|S|f^vq1z;NX8nI~(ikKjn$Ed12zZ`5LXorOm`ZDQpDnj$Ni-B4KYc zGdsdb>DQYFHV)n1hZfO7`&36%+;k9=4Oh+dAFQ12JJ-~FSh)j)-47~s`fzr%YoPQOLme!(ar zL$NW>aC;*13JSEZ$l8%rY14f7GWv9S=f;4YF$MDYRALW5mRZVa4<;vru0%ser#}ko zW0FSj2np#J27l=9Mpi|F>$J4k-`NgtIHME`M;dQ$|NEF_LzhMHd6q%1&R6591e1bT zmXlrPs1>Ch7M=U91LsN*f;CQ1lX2g%AMrvyEG@HT4Y!jUK>tRP}>xKx(a^tjYEy1cx+KBsqgceiNi+0JB8 zi}CSfuG+U*<8b}heaj5uf}!cla2q=&zn>1)UtQORrXr^=^BMG$c*_R?Z(T%6CB`)WCivW3gE6 zxM!S{Z_3MgIT*+9ドル$Ily+WA38m4MuMSWgYvj2=`7W~pujtz4Cl+0ptD(l+IOENjQ- z$sS^J2j%W{nG|s7MtJVXM5(O$C|6iXV(+qtie*jdh}S)6ZWy@7#%H}WDviVOZnN^Y zcUNr`{93$$ce7(E!#fg ztXhU83x^+ed?oe-mqAj%dG~f9;=0MnBJ7Q%0#00dyG%Gr{43rM*=SA>{{{B7`;O!u zQNS-Y=2nmZa|K>CkX1CD+dUw_(IjJwzaj7x#mPK--%wYDLN-j18Ze1 ziMRcNIRGk89^JXSh`C|r@b30ドルNXA{u+2Z z7Xf&4YWKAIrSAPQ>_cAIlMhsUeO29J{zs_sQscO1M!p338bl)_BTr%!?!%%x%@hW- zs;uVpE6c|+Mctv0l)1Reuh(yU-8sg6Prk2fVBp~QdeoOD^!D)j3u_N~A7Er9jwa2o zs%ub>PmBhpb7V9F7j<1%ghg*bd=d5ドル*rsbhquepunvxuemo@ni002b^a14i*peys` z`9XHzkzV6o7kxq1;>6i?%O0rKJu1i}tX5I84tJ{S@wVY?lm9KroPoi;DzVGAr>`It z)R;kb{eMHkBT)Ofde4*TiDs*=c!&)l%fCl2xSoH3K<0f{v)1jetdd_7fvgq#95zrp zwwE|i{f!GL+R;K;JSj_DY^_K=ZERpy*4Jmx?66u22+_%L%fA>#aj&bQ_6hDoe;e{c zteFncS&4HX3FvFg&CQ7fo(X{B_e#RHx1A);H!H*A3agpE-I?EPGS9zPGi#%*BZuGU+xg^u}(B`8D0i z8vfnQHC`j;lZB#=9+Ox`__odM^@maZ)jHWht_=nPj?$^o2n=$SB1|iGL0B z)wj*TL6^fem-R^Y?j;6#(+sfAb14(CyGGCg&mIUCG`lok5+Zq)q4lFfZ7+U(cJY7esUvuZi z7!lXm#*kk~;u%$>?D)ZXsxk)$Q``pA!p^bx1&5LoP$R`A!p1_4yCVasfK6ovW4jH$ z=wr1sUbep5w*Cw?6UuP(SrHNx%x9+{nj6q2l`j0p1{$?;>Xh*ui9H{-lW?Hd($&@V zxNgNUAi!W>$?j{@c3gnSfhh;CF)Okc zk078$hb!%658+2gk3DapkW=rm;CsR>p4w}>O;&8&YBHF-q4WOzdr#|dtAM)0N>9M^ zoyz%%6fyD}f7K)NK7P=^hL5KahrLWx&R>VVJBwIf@hmpruCc?;{zzTeS>@m(>lm(; zqlm-@y8kRNN56pRr5ab=C?R)G#jF}zgpEMd-&}wwB?7-uTxsvwRTAX2?vR<2@6q8sodmee0c(i&eib^~<6q$w zDPU%QDho%?U{mdW?VpBcL_;ys;9-hoY6wDopC;5%zA44=ch{@>7kIN9+zMvOkDdM-LK7Control+F(or Command+F on the | 2852 | [Sum of Remoteness of All Cells](/solution/2800-2899/2852.Sum%20of%20Remoteness%20of%20All%20Cells/README_EN.md) | | Medium | 🔒 | | 2853 | [Highest Salaries Difference](/solution/2800-2899/2853.Highest%20Salaries%20Difference/README_EN.md) | | Easy | 🔒 | | 2854 | [Rolling Average Steps](/solution/2800-2899/2854.Rolling%20Average%20Steps/README_EN.md) | | Medium | 🔒 | +| 2855 | [Minimum Right Shifts to Sort the Array](/solution/2800-2899/2855.Minimum%20Right%20Shifts%20to%20Sort%20the%20Array/README_EN.md) | | Easy | Biweekly Contest 113 | +| 2856 | [Minimum Array Length After Pair Removals](/solution/2800-2899/2856.Minimum%20Array%20Length%20After%20Pair%20Removals/README_EN.md) | | Medium | Biweekly Contest 113 | +| 2857 | [Count Pairs of Points With Distance k](/solution/2800-2899/2857.Count%20Pairs%20of%20Points%20With%20Distance%20k/README_EN.md) | | Medium | Biweekly Contest 113 | +| 2858 | [Minimum Edge Reversals So Every Node Is Reachable](/solution/2800-2899/2858.Minimum%20Edge%20Reversals%20So%20Every%20Node%20Is%20Reachable/README_EN.md) | | Hard | Biweekly Contest 113 | ## Copyright diff --git a/solution/summary.md b/solution/summary.md index 18d838387b24b..7bdedad7ca7b6 100644 --- a/solution/summary.md +++ b/solution/summary.md @@ -2910,3 +2910,7 @@ - [2852.Sum of Remoteness of All Cells](/solution/2800-2899/2852.Sum%20of%20Remoteness%20of%20All%20Cells/README.md) - [2853.Highest Salaries Difference](/solution/2800-2899/2853.Highest%20Salaries%20Difference/README.md) - [2854.Rolling Average Steps](/solution/2800-2899/2854.Rolling%20Average%20Steps/README.md) + - [2855.使数组成为递增数组的最少右移次数](/solution/2800-2899/2855.Minimum%20Right%20Shifts%20to%20Sort%20the%20Array/README.md) + - [2856.删除数对后的最小数组长度](/solution/2800-2899/2856.Minimum%20Array%20Length%20After%20Pair%20Removals/README.md) + - [2857.统计距离为 k 的点对](/solution/2800-2899/2857.Count%20Pairs%20of%20Points%20With%20Distance%20k/README.md) + - [2858.可以到达每一个节点的最少边反转次数](/solution/2800-2899/2858.Minimum%20Edge%20Reversals%20So%20Every%20Node%20Is%20Reachable/README.md) diff --git a/solution/summary_en.md b/solution/summary_en.md index ada48850ef5e3..b854fc88ccc12 100644 --- a/solution/summary_en.md +++ b/solution/summary_en.md @@ -2910,3 +2910,7 @@ - [2852.Sum of Remoteness of All Cells](/solution/2800-2899/2852.Sum%20of%20Remoteness%20of%20All%20Cells/README_EN.md) - [2853.Highest Salaries Difference](/solution/2800-2899/2853.Highest%20Salaries%20Difference/README_EN.md) - [2854.Rolling Average Steps](/solution/2800-2899/2854.Rolling%20Average%20Steps/README_EN.md) + - [2855.Minimum Right Shifts to Sort the Array](/solution/2800-2899/2855.Minimum%20Right%20Shifts%20to%20Sort%20the%20Array/README_EN.md) + - [2856.Minimum Array Length After Pair Removals](/solution/2800-2899/2856.Minimum%20Array%20Length%20After%20Pair%20Removals/README_EN.md) + - [2857.Count Pairs of Points With Distance k](/solution/2800-2899/2857.Count%20Pairs%20of%20Points%20With%20Distance%20k/README_EN.md) + - [2858.Minimum Edge Reversals So Every Node Is Reachable](/solution/2800-2899/2858.Minimum%20Edge%20Reversals%20So%20Every%20Node%20Is%20Reachable/README_EN.md) From 907340b87df9fcc3fed4a47320b1e38245b8468f Mon Sep 17 00:00:00 2001 From: yanglbme Date: 2023年9月17日 09:51:40 +0800 Subject: [PATCH 2/4] feat: add solutions to lc problems: No.2855~2858 * No.2855.Minimum Right Shifts to Sort the Array * No.2856.Minimum Array Length After Pair Removals * No.2857.Count Pairs of Points With Distance k --- .../README.md | 79 +++++++++- .../README_EN.md | 73 ++++++++- .../Solution.cpp | 15 ++ .../Solution.go | 15 ++ .../Solution.java | 14 ++ .../Solution.py | 10 ++ .../Solution.ts | 12 ++ .../README.md | 144 +++++++++++++++++- .../README_EN.md | 138 ++++++++++++++++- .../Solution.cpp | 30 ++++ .../Solution.go | 35 +++++ .../Solution.java | 27 ++++ .../Solution.py | 16 ++ .../Solution.ts | 23 +++ .../README.md | 107 ++++++++++++- .../README_EN.md | 99 +++++++++++- .../Solution.cpp | 20 +++ .../Solution.java | 16 ++ .../Solution.py | 11 ++ .../Solution.ts | 14 ++ .../Soution.go | 13 ++ 21 files changed, 895 insertions(+), 16 deletions(-) create mode 100644 solution/2800-2899/2855.Minimum Right Shifts to Sort the Array/Solution.cpp create mode 100644 solution/2800-2899/2855.Minimum Right Shifts to Sort the Array/Solution.go create mode 100644 solution/2800-2899/2855.Minimum Right Shifts to Sort the Array/Solution.java create mode 100644 solution/2800-2899/2855.Minimum Right Shifts to Sort the Array/Solution.py create mode 100644 solution/2800-2899/2855.Minimum Right Shifts to Sort the Array/Solution.ts create mode 100644 solution/2800-2899/2856.Minimum Array Length After Pair Removals/Solution.cpp create mode 100644 solution/2800-2899/2856.Minimum Array Length After Pair Removals/Solution.go create mode 100644 solution/2800-2899/2856.Minimum Array Length After Pair Removals/Solution.java create mode 100644 solution/2800-2899/2856.Minimum Array Length After Pair Removals/Solution.py create mode 100644 solution/2800-2899/2856.Minimum Array Length After Pair Removals/Solution.ts create mode 100644 solution/2800-2899/2857.Count Pairs of Points With Distance k/Solution.cpp create mode 100644 solution/2800-2899/2857.Count Pairs of Points With Distance k/Solution.java create mode 100644 solution/2800-2899/2857.Count Pairs of Points With Distance k/Solution.py create mode 100644 solution/2800-2899/2857.Count Pairs of Points With Distance k/Solution.ts create mode 100644 solution/2800-2899/2857.Count Pairs of Points With Distance k/Soution.go diff --git a/solution/2800-2899/2855.Minimum Right Shifts to Sort the Array/README.md b/solution/2800-2899/2855.Minimum Right Shifts to Sort the Array/README.md index 913bc1b5560ef..bf4714be0714a 100644 --- a/solution/2800-2899/2855.Minimum Right Shifts to Sort the Array/README.md +++ b/solution/2800-2899/2855.Minimum Right Shifts to Sort the Array/README.md @@ -52,6 +52,12 @@ +**方法一:直接遍历** + +我们先用一个指针 $i$ 从左到右遍历数组 $nums,ドル找出一段连续的递增序列,直到 $i$ 到达数组末尾或者 $nums[i - 1] \gt nums[i]$。接下来我们用另一个指针 $k$ 从 $i + 1$ 开始遍历数组 $nums,ドル找出一段连续的递增序列,直到 $k$ 到达数组末尾或者 $nums[k - 1] \gt nums[k]$ 且 $nums[k] \gt nums[0]$。如果 $k$ 到达数组末尾,说明数组已经是递增的,返回 $n - i$;否则返回 $-1$。 + +时间复杂度 $O(n),ドル空间复杂度 $O(1)$。其中 $n$ 是数组 $nums$ 的长度。 + ### **Python3** @@ -59,7 +65,16 @@ ```python - +class Solution: + def minimumRightShifts(self, nums: List[int]) -> int: + n = len(nums) + i = 1 + while i < n and nums[i - 1] < nums[i]: + i += 1 + k = i + 1 + while k < n and nums[k - 1] < nums[k] < nums[0]: + k += 1 + return -1 if k < n else n - i ``` ### **Java** @@ -67,19 +82,77 @@ ```java - +class Solution { + public int minimumRightShifts(List nums) { + int n = nums.size(); + int i = 1; + while (i < n && nums.get(i - 1) < nums.get(i)) { + ++i; + } + int k = i + 1; + while (k < n && nums.get(k - 1) < nums.get(k) && nums.get(k) < nums.get(0)) { + ++k; + } + return k < n ? -1 : n - i; + } +} ``` ### **C++** ```cpp - +class Solution { +public: + int minimumRightShifts(vector& nums) { + int n = nums.size(); + int i = 1; + while (i < n && nums[i - 1] < nums[i]) { + ++i; + } + int k = i + 1; + while (k < n && nums[k - 1] < nums[k] && nums[k] < nums[0]) { + ++k; + } + return k < n ? -1 : n - i; + } +}; ``` ### **Go** ```go +func minimumRightShifts(nums []int) int { + n := len(nums) + i := 1 + for i < n && nums[i-1] < nums[i] { + i++ + } + k := i + 1 + for k < n && nums[k-1] < nums[k] && nums[k] < nums[0] { + k++ + } + if k < n { + return -1 + } + return n - i +} +``` +### **TypeScript** + +```ts +function minimumRightShifts(nums: number[]): number { + const n = nums.length; + let i = 1; + while (i < n && nums[i - 1] < nums[i]) { + ++i; + } + let k = i + 1; + while (k < n && nums[k - 1] < nums[k] && nums[k] < nums[0]) { + ++k; + } + return k < n ? -1 : n - i; +} ``` ### **...** diff --git a/solution/2800-2899/2855.Minimum Right Shifts to Sort the Array/README_EN.md b/solution/2800-2899/2855.Minimum Right Shifts to Sort the Array/README_EN.md index dfce2f97540c3..7da9bb2f57725 100644 --- a/solution/2800-2899/2855.Minimum Right Shifts to Sort the Array/README_EN.md +++ b/solution/2800-2899/2855.Minimum Right Shifts to Sort the Array/README_EN.md @@ -51,25 +51,92 @@ Now nums is sorted; therefore the answer is 2. ### **Python3** ```python - +class Solution: + def minimumRightShifts(self, nums: List[int]) -> int: + n = len(nums) + i = 1 + while i < n and nums[i - 1] < nums[i]: + i += 1 + k = i + 1 + while k < n and nums[k - 1] < nums[k] < nums[0]: + k += 1 + return -1 if k < n else n - i ``` ### **Java** ```java - +class Solution { + public int minimumRightShifts(List nums) { + int n = nums.size(); + int i = 1; + while (i < n && nums.get(i - 1) < nums.get(i)) { + ++i; + } + int k = i + 1; + while (k < n && nums.get(k - 1) < nums.get(k) && nums.get(k) < nums.get(0)) { + ++k; + } + return k < n ? -1 : n - i; + } +} ``` ### **C++** ```cpp - +class Solution { +public: + int minimumRightShifts(vector& nums) { + int n = nums.size(); + int i = 1; + while (i < n && nums[i - 1] < nums[i]) { + ++i; + } + int k = i + 1; + while (k < n && nums[k - 1] < nums[k] && nums[k] < nums[0]) { + ++k; + } + return k < n ? -1 : n - i; + } +}; ``` ### **Go** ```go +func minimumRightShifts(nums []int) int { + n := len(nums) + i := 1 + for i < n && nums[i-1] < nums[i] { + i++ + } + k := i + 1 + for k < n && nums[k-1] < nums[k] && nums[k] < nums[0] { + k++ + } + if k < n { + return -1 + } + return n - i +} +``` +### **TypeScript** + +```ts +function minimumRightShifts(nums: number[]): number { + const n = nums.length; + let i = 1; + while (i < n && nums[i - 1] < nums[i]) { + ++i; + } + let k = i + 1; + while (k < n && nums[k - 1] < nums[k] && nums[k] < nums[0]) { + ++k; + } + return k < n ? -1 : n - i; +} ``` ### **...** diff --git a/solution/2800-2899/2855.Minimum Right Shifts to Sort the Array/Solution.cpp b/solution/2800-2899/2855.Minimum Right Shifts to Sort the Array/Solution.cpp new file mode 100644 index 0000000000000..4fd4630b66930 --- /dev/null +++ b/solution/2800-2899/2855.Minimum Right Shifts to Sort the Array/Solution.cpp @@ -0,0 +1,15 @@ +class Solution { +public: + int minimumRightShifts(vector& nums) { + int n = nums.size(); + int i = 1; + while (i < n && nums[i - 1] < nums[i]) { + ++i; + } + int k = i + 1; + while (k < n && nums[k - 1] < nums[k] && nums[k] < nums[0]) { + ++k; + } + return k < n ? -1 : n - i; + } +}; \ No newline at end of file diff --git a/solution/2800-2899/2855.Minimum Right Shifts to Sort the Array/Solution.go b/solution/2800-2899/2855.Minimum Right Shifts to Sort the Array/Solution.go new file mode 100644 index 0000000000000..7495b38ee5fab --- /dev/null +++ b/solution/2800-2899/2855.Minimum Right Shifts to Sort the Array/Solution.go @@ -0,0 +1,15 @@ +func minimumRightShifts(nums []int) int { + n := len(nums) + i := 1 + for i < n && nums[i-1] < nums[i] { + i++ + } + k := i + 1 + for k < n && nums[k-1] < nums[k] && nums[k] < nums[0] { + k++ + } + if k < n { + return -1 + } + return n - i +} \ No newline at end of file diff --git a/solution/2800-2899/2855.Minimum Right Shifts to Sort the Array/Solution.java b/solution/2800-2899/2855.Minimum Right Shifts to Sort the Array/Solution.java new file mode 100644 index 0000000000000..c26bde526d312 --- /dev/null +++ b/solution/2800-2899/2855.Minimum Right Shifts to Sort the Array/Solution.java @@ -0,0 +1,14 @@ +class Solution { + public int minimumRightShifts(List nums) { + int n = nums.size(); + int i = 1; + while (i < n && nums.get(i - 1) < nums.get(i)) { + ++i; + } + int k = i + 1; + while (k < n && nums.get(k - 1) < nums.get(k) && nums.get(k) < nums.get(0)) { + ++k; + } + return k < n ? -1 : n - i; + } +} \ No newline at end of file diff --git a/solution/2800-2899/2855.Minimum Right Shifts to Sort the Array/Solution.py b/solution/2800-2899/2855.Minimum Right Shifts to Sort the Array/Solution.py new file mode 100644 index 0000000000000..eb0c6b19d492c --- /dev/null +++ b/solution/2800-2899/2855.Minimum Right Shifts to Sort the Array/Solution.py @@ -0,0 +1,10 @@ +class Solution: + def minimumRightShifts(self, nums: List[int]) -> int: + n = len(nums) + i = 1 + while i < n and nums[i - 1] < nums[i]: + i += 1 + k = i + 1 + while k < n and nums[k - 1] < nums[k] < nums[0]: + k += 1 + return -1 if k < n else n - i diff --git a/solution/2800-2899/2855.Minimum Right Shifts to Sort the Array/Solution.ts b/solution/2800-2899/2855.Minimum Right Shifts to Sort the Array/Solution.ts new file mode 100644 index 0000000000000..ad1f149738f63 --- /dev/null +++ b/solution/2800-2899/2855.Minimum Right Shifts to Sort the Array/Solution.ts @@ -0,0 +1,12 @@ +function minimumRightShifts(nums: number[]): number { + const n = nums.length; + let i = 1; + while (i < n && nums[i - 1] < nums[i]) { + ++i; + } + let k = i + 1; + while (k < n && nums[k - 1] < nums[k] && nums[k] < nums[0]) { + ++k; + } + return k < n ? -1 : n - i; +} diff --git a/solution/2800-2899/2856.Minimum Array Length After Pair Removals/README.md b/solution/2800-2899/2856.Minimum Array Length After Pair Removals/README.md index 047faeb8d1242..0d0575725fbad 100644 --- a/solution/2800-2899/2856.Minimum Array Length After Pair Removals/README.md +++ b/solution/2800-2899/2856.Minimum Array Length After Pair Removals/README.md @@ -70,6 +70,12 @@ +**方法一:贪心 + 优先队列(大根堆)** + +我们用一个哈希表 $cnt$ 统计数组 $nums$ 中每个元素的出现次数,然后将 $cnt$ 中的每个值加入一个优先队列(大根堆) $pq$ 中。每次从 $pq$ 中取出两个元素 $x$ 和 $y,ドル将它们的值减一,如果减一后的值仍大于 0ドル,ドル则将减一后的值重新加入 $pq$。每次从 $pq$ 中取出两个元素,表示将数组中的两个数对删除,因此数组的长度减少 2ドル$。当 $pq$ 的大小小于 2ドル$ 时,停止删除操作。 + +时间复杂度 $O(n \times \log n),ドル空间复杂度 $O(n)$。其中 $n$ 是数组 $nums$ 的长度。 + ### **Python3** @@ -77,7 +83,22 @@ ```python - +class Solution: + def minLengthAfterRemovals(self, nums: List[int]) -> int: + cnt = Counter(nums) + pq = [-x for x in cnt.values()] + heapify(pq) + ans = len(nums) + while len(pq)> 1: + x, y = -heappop(pq), -heappop(pq) + x -= 1 + y -= 1 + if x> 0: + heappush(pq, -x) + if y> 0: + heappush(pq, -y) + ans -= 2 + return ans ``` ### **Java** @@ -85,19 +106,136 @@ ```java - +class Solution { + public int minLengthAfterRemovals(List nums) { + Map cnt = new HashMap(); + for (int x : nums) { + cnt.merge(x, 1, Integer::sum); + } + PriorityQueue pq = new PriorityQueue(Comparator.reverseOrder()); + for (int x : cnt.values()) { + pq.offer(x); + } + int ans = nums.size(); + while (pq.size()> 1) { + int x = pq.poll(); + int y = pq.poll(); + x--; + y--; + if (x> 0) { + pq.offer(x); + } + if (y> 0) { + pq.offer(y); + } + ans -= 2; + } + return ans; + } +} ``` ### **C++** ```cpp - +class Solution { +public: + int minLengthAfterRemovals(vector& nums) { + unordered_map cnt; + for (int x : nums) { + ++cnt[x]; + } + priority_queue pq; + for (auto& [_, v] : cnt) { + pq.push(v); + } + int ans = nums.size(); + while (pq.size()> 1) { + int x = pq.top(); + pq.pop(); + int y = pq.top(); + pq.pop(); + x--; + y--; + if (x> 0) { + pq.push(x); + } + if (y> 0) { + pq.push(y); + } + ans -= 2; + } + return ans; + } +}; ``` ### **Go** ```go +func minLengthAfterRemovals(nums []int) int { + cnt := map[int]int{} + for _, x := range nums { + cnt[x]++ + } + h := &hp{} + for _, x := range cnt { + h.push(x) + } + ans := len(nums) + for h.Len()> 1 { + x, y := h.pop(), h.pop() + if x> 1 { + h.push(x - 1) + } + if y> 1 { + h.push(y - 1) + } + ans -= 2 + } + return ans +} + +type hp struct{ sort.IntSlice } + +func (h hp) Less(i, j int) bool { return h.IntSlice[i]> h.IntSlice[j] } +func (h *hp) Push(v any) { h.IntSlice = append(h.IntSlice, v.(int)) } +func (h *hp) Pop() any { + a := h.IntSlice + v := a[len(a)-1] + h.IntSlice = a[:len(a)-1] + return v +} +func (h *hp) push(v int) { heap.Push(h, v) } +func (h *hp) pop() int { return heap.Pop(h).(int) } +``` +### **TypeScript** + +```ts +function minLengthAfterRemovals(nums: number[]): number { + const cnt: Map = new Map(); + for (const x of nums) { + cnt.set(x, (cnt.get(x) ?? 0) + 1); + } + const pq = new MaxPriorityQueue(); + for (const [_, v] of cnt) { + pq.enqueue(v); + } + let ans = nums.length; + while (pq.size()> 1) { + let x = pq.dequeue().element; + let y = pq.dequeue().element; + if (--x> 0) { + pq.enqueue(x); + } + if (--y> 0) { + pq.enqueue(y); + } + ans -= 2; + } + return ans; +} ``` ### **...** diff --git a/solution/2800-2899/2856.Minimum Array Length After Pair Removals/README_EN.md b/solution/2800-2899/2856.Minimum Array Length After Pair Removals/README_EN.md index e0165b87aa7ab..a1f5e0d862a83 100644 --- a/solution/2800-2899/2856.Minimum Array Length After Pair Removals/README_EN.md +++ b/solution/2800-2899/2856.Minimum Array Length After Pair Removals/README_EN.md @@ -71,25 +71,157 @@ Hence, the minimum achievable length is 1. ### **Python3** ```python - +class Solution: + def minLengthAfterRemovals(self, nums: List[int]) -> int: + cnt = Counter(nums) + pq = [-x for x in cnt.values()] + heapify(pq) + ans = len(nums) + while len(pq)> 1: + x, y = -heappop(pq), -heappop(pq) + x -= 1 + y -= 1 + if x> 0: + heappush(pq, -x) + if y> 0: + heappush(pq, -y) + ans -= 2 + return ans ``` ### **Java** ```java - +class Solution { + public int minLengthAfterRemovals(List nums) { + Map cnt = new HashMap(); + for (int x : nums) { + cnt.merge(x, 1, Integer::sum); + } + PriorityQueue pq = new PriorityQueue(Comparator.reverseOrder()); + for (int x : cnt.values()) { + pq.offer(x); + } + int ans = nums.size(); + while (pq.size()> 1) { + int x = pq.poll(); + int y = pq.poll(); + x--; + y--; + if (x> 0) { + pq.offer(x); + } + if (y> 0) { + pq.offer(y); + } + ans -= 2; + } + return ans; + } +} ``` ### **C++** ```cpp - +class Solution { +public: + int minLengthAfterRemovals(vector& nums) { + unordered_map cnt; + for (int x : nums) { + ++cnt[x]; + } + priority_queue pq; + for (auto& [_, v] : cnt) { + pq.push(v); + } + int ans = nums.size(); + while (pq.size()> 1) { + int x = pq.top(); + pq.pop(); + int y = pq.top(); + pq.pop(); + x--; + y--; + if (x> 0) { + pq.push(x); + } + if (y> 0) { + pq.push(y); + } + ans -= 2; + } + return ans; + } +}; ``` ### **Go** ```go +func minLengthAfterRemovals(nums []int) int { + cnt := map[int]int{} + for _, x := range nums { + cnt[x]++ + } + h := &hp{} + for _, x := range cnt { + h.push(x) + } + ans := len(nums) + for h.Len()> 1 { + x, y := h.pop(), h.pop() + if x> 1 { + h.push(x - 1) + } + if y> 1 { + h.push(y - 1) + } + ans -= 2 + } + return ans +} + +type hp struct{ sort.IntSlice } + +func (h hp) Less(i, j int) bool { return h.IntSlice[i]> h.IntSlice[j] } +func (h *hp) Push(v any) { h.IntSlice = append(h.IntSlice, v.(int)) } +func (h *hp) Pop() any { + a := h.IntSlice + v := a[len(a)-1] + h.IntSlice = a[:len(a)-1] + return v +} +func (h *hp) push(v int) { heap.Push(h, v) } +func (h *hp) pop() int { return heap.Pop(h).(int) } +``` +### **TypeScript** + +```ts +function minLengthAfterRemovals(nums: number[]): number { + const cnt: Map = new Map(); + for (const x of nums) { + cnt.set(x, (cnt.get(x) ?? 0) + 1); + } + const pq = new MaxPriorityQueue(); + for (const [_, v] of cnt) { + pq.enqueue(v); + } + let ans = nums.length; + while (pq.size()> 1) { + let x = pq.dequeue().element; + let y = pq.dequeue().element; + if (--x> 0) { + pq.enqueue(x); + } + if (--y> 0) { + pq.enqueue(y); + } + ans -= 2; + } + return ans; +} ``` ### **...** diff --git a/solution/2800-2899/2856.Minimum Array Length After Pair Removals/Solution.cpp b/solution/2800-2899/2856.Minimum Array Length After Pair Removals/Solution.cpp new file mode 100644 index 0000000000000..e53c90dbbffde --- /dev/null +++ b/solution/2800-2899/2856.Minimum Array Length After Pair Removals/Solution.cpp @@ -0,0 +1,30 @@ +class Solution { +public: + int minLengthAfterRemovals(vector& nums) { + unordered_map cnt; + for (int x : nums) { + ++cnt[x]; + } + priority_queue pq; + for (auto& [_, v] : cnt) { + pq.push(v); + } + int ans = nums.size(); + while (pq.size()> 1) { + int x = pq.top(); + pq.pop(); + int y = pq.top(); + pq.pop(); + x--; + y--; + if (x> 0) { + pq.push(x); + } + if (y> 0) { + pq.push(y); + } + ans -= 2; + } + return ans; + } +}; \ No newline at end of file diff --git a/solution/2800-2899/2856.Minimum Array Length After Pair Removals/Solution.go b/solution/2800-2899/2856.Minimum Array Length After Pair Removals/Solution.go new file mode 100644 index 0000000000000..18b5eff60a84f --- /dev/null +++ b/solution/2800-2899/2856.Minimum Array Length After Pair Removals/Solution.go @@ -0,0 +1,35 @@ +func minLengthAfterRemovals(nums []int) int { + cnt := map[int]int{} + for _, x := range nums { + cnt[x]++ + } + h := &hp{} + for _, x := range cnt { + h.push(x) + } + ans := len(nums) + for h.Len()> 1 { + x, y := h.pop(), h.pop() + if x> 1 { + h.push(x - 1) + } + if y> 1 { + h.push(y - 1) + } + ans -= 2 + } + return ans +} + +type hp struct{ sort.IntSlice } + +func (h hp) Less(i, j int) bool { return h.IntSlice[i]> h.IntSlice[j] } +func (h *hp) Push(v any) { h.IntSlice = append(h.IntSlice, v.(int)) } +func (h *hp) Pop() any { + a := h.IntSlice + v := a[len(a)-1] + h.IntSlice = a[:len(a)-1] + return v +} +func (h *hp) push(v int) { heap.Push(h, v) } +func (h *hp) pop() int { return heap.Pop(h).(int) } \ No newline at end of file diff --git a/solution/2800-2899/2856.Minimum Array Length After Pair Removals/Solution.java b/solution/2800-2899/2856.Minimum Array Length After Pair Removals/Solution.java new file mode 100644 index 0000000000000..1e6385cf6aa0b --- /dev/null +++ b/solution/2800-2899/2856.Minimum Array Length After Pair Removals/Solution.java @@ -0,0 +1,27 @@ +class Solution { + public int minLengthAfterRemovals(List nums) { + Map cnt = new HashMap(); + for (int x : nums) { + cnt.merge(x, 1, Integer::sum); + } + PriorityQueue pq = new PriorityQueue(Comparator.reverseOrder()); + for (int x : cnt.values()) { + pq.offer(x); + } + int ans = nums.size(); + while (pq.size()> 1) { + int x = pq.poll(); + int y = pq.poll(); + x--; + y--; + if (x> 0) { + pq.offer(x); + } + if (y> 0) { + pq.offer(y); + } + ans -= 2; + } + return ans; + } +} \ No newline at end of file diff --git a/solution/2800-2899/2856.Minimum Array Length After Pair Removals/Solution.py b/solution/2800-2899/2856.Minimum Array Length After Pair Removals/Solution.py new file mode 100644 index 0000000000000..5c9b4dc8b5037 --- /dev/null +++ b/solution/2800-2899/2856.Minimum Array Length After Pair Removals/Solution.py @@ -0,0 +1,16 @@ +class Solution: + def minLengthAfterRemovals(self, nums: List[int]) -> int: + cnt = Counter(nums) + pq = [-x for x in cnt.values()] + heapify(pq) + ans = len(nums) + while len(pq)> 1: + x, y = -heappop(pq), -heappop(pq) + x -= 1 + y -= 1 + if x> 0: + heappush(pq, -x) + if y> 0: + heappush(pq, -y) + ans -= 2 + return ans diff --git a/solution/2800-2899/2856.Minimum Array Length After Pair Removals/Solution.ts b/solution/2800-2899/2856.Minimum Array Length After Pair Removals/Solution.ts new file mode 100644 index 0000000000000..02d365ead29b2 --- /dev/null +++ b/solution/2800-2899/2856.Minimum Array Length After Pair Removals/Solution.ts @@ -0,0 +1,23 @@ +function minLengthAfterRemovals(nums: number[]): number { + const cnt: Map = new Map(); + for (const x of nums) { + cnt.set(x, (cnt.get(x) ?? 0) + 1); + } + const pq = new MaxPriorityQueue(); + for (const [_, v] of cnt) { + pq.enqueue(v); + } + let ans = nums.length; + while (pq.size()> 1) { + let x = pq.dequeue().element; + let y = pq.dequeue().element; + if (--x> 0) { + pq.enqueue(x); + } + if (--y> 0) { + pq.enqueue(y); + } + ans -= 2; + } + return ans; +} diff --git a/solution/2800-2899/2857.Count Pairs of Points With Distance k/README.md b/solution/2800-2899/2857.Count Pairs of Points With Distance k/README.md index be84e3e086170..5398f942ea5d0 100644 --- a/solution/2800-2899/2857.Count Pairs of Points With Distance k/README.md +++ b/solution/2800-2899/2857.Count Pairs of Points With Distance k/README.md @@ -46,6 +46,14 @@ +**方法一:哈希表 + 枚举** + +我们可以用一个哈希表 $cnt$ 统计数组 $coordinates$ 中每个点出现的次数。 + +接下来,我们枚举数组 $coordinates$ 中的每个点 $(x_2, y_2),ドル由于 $k$ 的取值范围为 $[0, 100],ドル而 $x_1 \oplus x_2$ 或 $y_1 \oplus y_2$ 的结果一定大于等于 0ドル,ドル因此我们可以在 $[0,..k]$ 范围内枚举 $x_1 \oplus x_2$ 的结果 $a,ドル那么 $y_1 \oplus y_2$ 的结果就是 $b = k - a$。这样一来,我们就可以计算出 $x_1$ 和 $y_1$ 的值,将 $(x_1, y_1)$ 出现的次数累加到答案中。 + +时间复杂度 $O(n \times k),ドル空间复杂度 $O(n)$。其中 $n$ 是数组 $coordinates$ 的长度。 + ### **Python3** @@ -53,7 +61,17 @@ ```python - +class Solution: + def countPairs(self, coordinates: List[List[int]], k: int) -> int: + cnt = Counter() + ans = 0 + for x2, y2 in coordinates: + for a in range(k + 1): + b = k - a + x1, y1 = a ^ x2, b ^ y2 + ans += cnt[(x1, y1)] + cnt[(x2, y2)] += 1 + return ans ``` ### **Java** @@ -61,19 +79,104 @@ ```java - +class Solution { + public int countPairs(List> coordinates, int k) { + Map, Integer> cnt = new HashMap(); + int ans = 0; + for (var c : coordinates) { + int x2 = c.get(0), y2 = c.get(1); + for (int a = 0; a <= k; ++a) { + int b = k - a; + int x1 = a ^ x2, y1 = b ^ y2; + ans += cnt.getOrDefault(List.of(x1, y1), 0); + } + cnt.merge(c, 1, Integer::sum); + } + return ans; + } +} ``` ### **C++** ```cpp +class Solution { +public: + int countPairs(vector>& coordinates, int k) { + map, int> cnt; + int ans = 0; + for (auto& c : coordinates) { + int x2 = c[0], y2 = c[1]; + for (int a = 0; a <= k; ++a) { + int b = k - a; + int x1 = a ^ x2, y1 = b ^ y2; + ans += cnt[{x1, y1}]; + } + ++cnt[{x2, y2}]; + } + return ans; + } +}; +``` +```cpp +class Solution { +public: + int countPairs(vector>& coordinates, int k) { + unordered_map cnt; + auto f = [](int x, int y) { + return x * 1000000L + y; + }; + int ans = 0; + for (auto& c : coordinates) { + int x2 = c[0], y2 = c[1]; + for (int a = 0; a <= k; ++a) { + int b = k - a; + int x1 = a ^ x2, y1 = b ^ y2; + ans += cnt[f(x1, y1)]; + } + ++cnt[f(x2, y2)]; + } + return ans; + } +}; ``` ### **Go** ```go +func countPairs(coordinates [][]int, k int) (ans int) { + cnt := map[[2]int]int{} + for _, c := range coordinates { + x2, y2 := c[0], c[1] + for a := 0; a <= k; a++ { + b := k - a + x1, y1 := a^x2, b^y2 + ans += cnt[[2]int{x1, y1}] + } + cnt[[2]int{x2, y2}]++ + } + return +} +``` +### **TypeScript** + +```ts +function countPairs(coordinates: number[][], k: number): number { + const cnt: Map = new Map(); + const f = (x: number, y: number): number => x * 1000000 + y; + let ans = 0; + for (const [x2, y2] of coordinates) { + for (let a = 0; a <= k; ++a) { + const b = k - a; + const [x1, y1] = [a ^ x2, b ^ y2]; + ans += cnt.get(f(x1, y1)) ?? 0; + } + cnt.set(f(x2, y2), (cnt.get(f(x2, y2)) ?? 0) + 1); + } + return ans; +} ``` ### **...** diff --git a/solution/2800-2899/2857.Count Pairs of Points With Distance k/README_EN.md b/solution/2800-2899/2857.Count Pairs of Points With Distance k/README_EN.md index b16d0642ec05f..0fa47fac77eb3 100644 --- a/solution/2800-2899/2857.Count Pairs of Points With Distance k/README_EN.md +++ b/solution/2800-2899/2857.Count Pairs of Points With Distance k/README_EN.md @@ -45,25 +45,120 @@ ### **Python3** ```python - +class Solution: + def countPairs(self, coordinates: List[List[int]], k: int) -> int: + cnt = Counter() + ans = 0 + for x2, y2 in coordinates: + for a in range(k + 1): + b = k - a + x1, y1 = a ^ x2, b ^ y2 + ans += cnt[(x1, y1)] + cnt[(x2, y2)] += 1 + return ans ``` ### **Java** ```java - +class Solution { + public int countPairs(List> coordinates, int k) { + Map, Integer> cnt = new HashMap(); + int ans = 0; + for (var c : coordinates) { + int x2 = c.get(0), y2 = c.get(1); + for (int a = 0; a <= k; ++a) { + int b = k - a; + int x1 = a ^ x2, y1 = b ^ y2; + ans += cnt.getOrDefault(List.of(x1, y1), 0); + } + cnt.merge(c, 1, Integer::sum); + } + return ans; + } +} ``` ### **C++** ```cpp +class Solution { +public: + int countPairs(vector>& coordinates, int k) { + map, int> cnt; + int ans = 0; + for (auto& c : coordinates) { + int x2 = c[0], y2 = c[1]; + for (int a = 0; a <= k; ++a) { + int b = k - a; + int x1 = a ^ x2, y1 = b ^ y2; + ans += cnt[{x1, y1}]; + } + ++cnt[{x2, y2}]; + } + return ans; + } +}; +``` +```cpp +class Solution { +public: + int countPairs(vector>& coordinates, int k) { + unordered_map cnt; + auto f = [](int x, int y) { + return x * 1000000L + y; + }; + int ans = 0; + for (auto& c : coordinates) { + int x2 = c[0], y2 = c[1]; + for (int a = 0; a <= k; ++a) { + int b = k - a; + int x1 = a ^ x2, y1 = b ^ y2; + ans += cnt[f(x1, y1)]; + } + ++cnt[f(x2, y2)]; + } + return ans; + } +}; ``` ### **Go** ```go +func countPairs(coordinates [][]int, k int) (ans int) { + cnt := map[[2]int]int{} + for _, c := range coordinates { + x2, y2 := c[0], c[1] + for a := 0; a <= k; a++ { + b := k - a + x1, y1 := a^x2, b^y2 + ans += cnt[[2]int{x1, y1}] + } + cnt[[2]int{x2, y2}]++ + } + return +} +``` +### **TypeScript** + +```ts +function countPairs(coordinates: number[][], k: number): number { + const cnt: Map = new Map(); + const f = (x: number, y: number): number => x * 1000000 + y; + let ans = 0; + for (const [x2, y2] of coordinates) { + for (let a = 0; a <= k; ++a) { + const b = k - a; + const [x1, y1] = [a ^ x2, b ^ y2]; + ans += cnt.get(f(x1, y1)) ?? 0; + } + cnt.set(f(x2, y2), (cnt.get(f(x2, y2)) ?? 0) + 1); + } + return ans; +} ``` ### **...** diff --git a/solution/2800-2899/2857.Count Pairs of Points With Distance k/Solution.cpp b/solution/2800-2899/2857.Count Pairs of Points With Distance k/Solution.cpp new file mode 100644 index 0000000000000..0fee7d0432a81 --- /dev/null +++ b/solution/2800-2899/2857.Count Pairs of Points With Distance k/Solution.cpp @@ -0,0 +1,20 @@ +class Solution { +public: + int countPairs(vector>& coordinates, int k) { + unordered_map cnt; + auto f = [](int x, int y) { + return x * 1000000L + y; + }; + int ans = 0; + for (auto& c : coordinates) { + int x2 = c[0], y2 = c[1]; + for (int a = 0; a <= k; ++a) { + int b = k - a; + int x1 = a ^ x2, y1 = b ^ y2; + ans += cnt[f(x1, y1)]; + } + ++cnt[f(x2, y2)]; + } + return ans; + } +}; \ No newline at end of file diff --git a/solution/2800-2899/2857.Count Pairs of Points With Distance k/Solution.java b/solution/2800-2899/2857.Count Pairs of Points With Distance k/Solution.java new file mode 100644 index 0000000000000..8de215445c58d --- /dev/null +++ b/solution/2800-2899/2857.Count Pairs of Points With Distance k/Solution.java @@ -0,0 +1,16 @@ +class Solution { + public int countPairs(List> coordinates, int k) { + Map, Integer> cnt = new HashMap(); + int ans = 0; + for (var c : coordinates) { + int x2 = c.get(0), y2 = c.get(1); + for (int a = 0; a <= k; ++a) { + int b = k - a; + int x1 = a ^ x2, y1 = b ^ y2; + ans += cnt.getOrDefault(List.of(x1, y1), 0); + } + cnt.merge(c, 1, Integer::sum); + } + return ans; + } +} \ No newline at end of file diff --git a/solution/2800-2899/2857.Count Pairs of Points With Distance k/Solution.py b/solution/2800-2899/2857.Count Pairs of Points With Distance k/Solution.py new file mode 100644 index 0000000000000..5b114a5ace1b4 --- /dev/null +++ b/solution/2800-2899/2857.Count Pairs of Points With Distance k/Solution.py @@ -0,0 +1,11 @@ +class Solution: + def countPairs(self, coordinates: List[List[int]], k: int) -> int: + cnt = Counter() + ans = 0 + for x2, y2 in coordinates: + for a in range(k + 1): + b = k - a + x1, y1 = a ^ x2, b ^ y2 + ans += cnt[(x1, y1)] + cnt[(x2, y2)] += 1 + return ans diff --git a/solution/2800-2899/2857.Count Pairs of Points With Distance k/Solution.ts b/solution/2800-2899/2857.Count Pairs of Points With Distance k/Solution.ts new file mode 100644 index 0000000000000..714530cbf20f6 --- /dev/null +++ b/solution/2800-2899/2857.Count Pairs of Points With Distance k/Solution.ts @@ -0,0 +1,14 @@ +function countPairs(coordinates: number[][], k: number): number { + const cnt: Map = new Map(); + const f = (x: number, y: number): number => x * 1000000 + y; + let ans = 0; + for (const [x2, y2] of coordinates) { + for (let a = 0; a <= k; ++a) { + const b = k - a; + const [x1, y1] = [a ^ x2, b ^ y2]; + ans += cnt.get(f(x1, y1)) ?? 0; + } + cnt.set(f(x2, y2), (cnt.get(f(x2, y2)) ?? 0) + 1); + } + return ans; +} diff --git a/solution/2800-2899/2857.Count Pairs of Points With Distance k/Soution.go b/solution/2800-2899/2857.Count Pairs of Points With Distance k/Soution.go new file mode 100644 index 0000000000000..0cb2171551372 --- /dev/null +++ b/solution/2800-2899/2857.Count Pairs of Points With Distance k/Soution.go @@ -0,0 +1,13 @@ +func countPairs(coordinates [][]int, k int) (ans int) { + cnt := map[[2]int]int{} + for _, c := range coordinates { + x2, y2 := c[0], c[1] + for a := 0; a <= k; a++ { + b := k - a + x1, y1 := a^x2, b^y2 + ans += cnt[[2]int{x1, y1}] + } + cnt[[2]int{x2, y2}]++ + } + return +} \ No newline at end of file From c5b6ae9c067780feb505bcc5a388fcacc65b9b78 Mon Sep 17 00:00:00 2001 From: yanglbme Date: 2023年9月17日 10:23:49 +0800 Subject: [PATCH 3/4] feat: add solutions to lc problem: No.2858 No.2858.Minimum Edge Reversals So Every Node Is Reachable --- .../README.md | 165 +++++++++++++++++- .../README_EN.md | 161 ++++++++++++++++- .../Solution.cpp | 31 ++++ .../Solution.go | 34 ++++ .../Solution.java | 38 ++++ .../Solution.py | 24 +++ .../Solution.ts | 27 +++ 7 files changed, 474 insertions(+), 6 deletions(-) create mode 100644 solution/2800-2899/2858.Minimum Edge Reversals So Every Node Is Reachable/Solution.cpp create mode 100644 solution/2800-2899/2858.Minimum Edge Reversals So Every Node Is Reachable/Solution.go create mode 100644 solution/2800-2899/2858.Minimum Edge Reversals So Every Node Is Reachable/Solution.java create mode 100644 solution/2800-2899/2858.Minimum Edge Reversals So Every Node Is Reachable/Solution.py create mode 100644 solution/2800-2899/2858.Minimum Edge Reversals So Every Node Is Reachable/Solution.ts diff --git a/solution/2800-2899/2858.Minimum Edge Reversals So Every Node Is Reachable/README.md b/solution/2800-2899/2858.Minimum Edge Reversals So Every Node Is Reachable/README.md index 42644e5e50e3c..35fb9ffbe7b4f 100644 --- a/solution/2800-2899/2858.Minimum Edge Reversals So Every Node Is Reachable/README.md +++ b/solution/2800-2899/2858.Minimum Edge Reversals So Every Node Is Reachable/README.md @@ -70,6 +70,10 @@ +**方法一:树形 DP** + +时间复杂度 $O(n),ドル空间复杂度 $O(n)$。 + ### **Python3** @@ -77,7 +81,30 @@ ```python - +class Solution: + def minEdgeReversals(self, n: int, edges: List[List[int]]) -> List[int]: + ans = [0] * n + g = [[] for _ in range(n)] + for x, y in edges: + g[x].append((y, 1)) + g[y].append((x, -1)) + + def dfs(i: int, fa: int): + for j, k in g[i]: + if j != fa: + ans[0] += int(k < 0) + dfs(j, i) + + dfs(0, -1) + + def dfs2(i: int, fa: int): + for j, k in g[i]: + if j != fa: + ans[j] = ans[i] + k + dfs2(j, i) + + dfs2(0, -1) + return ans ``` ### **Java** @@ -85,19 +112,151 @@ ```java - +class Solution { + private List[] g; + private int[] ans; + + public int[] minEdgeReversals(int n, int[][] edges) { + ans = new int[n]; + g = new List[n]; + Arrays.setAll(g, i -> new ArrayList()); + for (var e : edges) { + int x = e[0], y = e[1]; + g[x].add(new int[] {y, 1}); + g[y].add(new int[] {x, -1}); + } + dfs(0, -1); + dfs2(0, -1); + return ans; + } + + private void dfs(int i, int fa) { + for (var ne : g[i]) { + int j = ne[0], k = ne[1]; + if (j != fa) { + ans[0] += k < 0 ? 1 : 0; + dfs(j, i); + } + } + } + + private void dfs2(int i, int fa) { + for (var ne : g[i]) { + int j = ne[0], k = ne[1]; + if (j != fa) { + ans[j] = ans[i] + k; + dfs2(j, i); + } + } + } +} ``` ### **C++** ```cpp - +class Solution { +public: + vector minEdgeReversals(int n, vector>& edges) { + vector> g[n]; + vector ans(n); + for (auto& e : edges) { + int x = e[0], y = e[1]; + g[x].emplace_back(y, 1); + g[y].emplace_back(x, -1); + } + function dfs = [&](int i, int fa) { + for (auto& [j, k] : g[i]) { + if (j != fa) { + ans[0] += k < 0; + dfs(j, i); + } + } + }; + function dfs2 = [&](int i, int fa) { + for (auto& [j, k] : g[i]) { + if (j != fa) { + ans[j] = ans[i] + k; + dfs2(j, i); + } + } + }; + dfs(0, -1); + dfs2(0, -1); + return ans; + } +}; ``` ### **Go** ```go +func minEdgeReversals(n int, edges [][]int) []int { + g := make([][][2]int, n) + for _, e := range edges { + x, y := e[0], e[1] + g[x] = append(g[x], [2]int{y, 1}) + g[y] = append(g[y], [2]int{x, -1}) + } + ans := make([]int, n) + var dfs func(int, int) + var dfs2 func(int, int) + dfs = func(i, fa int) { + for _, ne := range g[i] { + j, k := ne[0], ne[1] + if j != fa { + if k < 0 { + ans[0]++ + } + dfs(j, i) + } + } + } + dfs2 = func(i, fa int) { + for _, ne := range g[i] { + j, k := ne[0], ne[1] + if j != fa { + ans[j] = ans[i] + k + dfs2(j, i) + } + } + } + dfs(0, -1) + dfs2(0, -1) + return ans +} +``` +### **TypeScript** + +```ts +function minEdgeReversals(n: number, edges: number[][]): number[] { + const g: number[][][] = Array.from({ length: n }, () => []); + for (const [x, y] of edges) { + g[x].push([y, 1]); + g[y].push([x, -1]); + } + const ans: number[] = Array(n).fill(0); + const dfs = (i: number, fa: number) => { + for (const [j, k] of g[i]) { + if (j !== fa) { + ans[0] += k < 0 ? 1 : 0; + dfs(j, i); + } + } + }; + const dfs2 = (i: number, fa: number) => { + for (const [j, k] of g[i]) { + if (j !== fa) { + ans[j] = ans[i] + k; + dfs2(j, i); + } + } + }; + dfs(0, -1); + dfs2(0, -1); + return ans; +} ``` ### **...** diff --git a/solution/2800-2899/2858.Minimum Edge Reversals So Every Node Is Reachable/README_EN.md b/solution/2800-2899/2858.Minimum Edge Reversals So Every Node Is Reachable/README_EN.md index 19f46a22c2852..99a0dd9310d54 100644 --- a/solution/2800-2899/2858.Minimum Edge Reversals So Every Node Is Reachable/README_EN.md +++ b/solution/2800-2899/2858.Minimum Edge Reversals So Every Node Is Reachable/README_EN.md @@ -69,25 +69,180 @@ So, answer[2] = 1. ### **Python3** ```python - +class Solution: + def minEdgeReversals(self, n: int, edges: List[List[int]]) -> List[int]: + ans = [0] * n + g = [[] for _ in range(n)] + for x, y in edges: + g[x].append((y, 1)) + g[y].append((x, -1)) + + def dfs(i: int, fa: int): + for j, k in g[i]: + if j != fa: + ans[0] += int(k < 0) + dfs(j, i) + + dfs(0, -1) + + def dfs2(i: int, fa: int): + for j, k in g[i]: + if j != fa: + ans[j] = ans[i] + k + dfs2(j, i) + + dfs2(0, -1) + return ans ``` ### **Java** ```java - +class Solution { + private List[] g; + private int[] ans; + + public int[] minEdgeReversals(int n, int[][] edges) { + ans = new int[n]; + g = new List[n]; + Arrays.setAll(g, i -> new ArrayList()); + for (var e : edges) { + int x = e[0], y = e[1]; + g[x].add(new int[] {y, 1}); + g[y].add(new int[] {x, -1}); + } + dfs(0, -1); + dfs2(0, -1); + return ans; + } + + private void dfs(int i, int fa) { + for (var ne : g[i]) { + int j = ne[0], k = ne[1]; + if (j != fa) { + ans[0] += k < 0 ? 1 : 0; + dfs(j, i); + } + } + } + + private void dfs2(int i, int fa) { + for (var ne : g[i]) { + int j = ne[0], k = ne[1]; + if (j != fa) { + ans[j] = ans[i] + k; + dfs2(j, i); + } + } + } +} ``` ### **C++** ```cpp - +class Solution { +public: + vector minEdgeReversals(int n, vector>& edges) { + vector> g[n]; + vector ans(n); + for (auto& e : edges) { + int x = e[0], y = e[1]; + g[x].emplace_back(y, 1); + g[y].emplace_back(x, -1); + } + function dfs = [&](int i, int fa) { + for (auto& [j, k] : g[i]) { + if (j != fa) { + ans[0] += k < 0; + dfs(j, i); + } + } + }; + function dfs2 = [&](int i, int fa) { + for (auto& [j, k] : g[i]) { + if (j != fa) { + ans[j] = ans[i] + k; + dfs2(j, i); + } + } + }; + dfs(0, -1); + dfs2(0, -1); + return ans; + } +}; ``` ### **Go** ```go +func minEdgeReversals(n int, edges [][]int) []int { + g := make([][][2]int, n) + for _, e := range edges { + x, y := e[0], e[1] + g[x] = append(g[x], [2]int{y, 1}) + g[y] = append(g[y], [2]int{x, -1}) + } + ans := make([]int, n) + var dfs func(int, int) + var dfs2 func(int, int) + dfs = func(i, fa int) { + for _, ne := range g[i] { + j, k := ne[0], ne[1] + if j != fa { + if k < 0 { + ans[0]++ + } + dfs(j, i) + } + } + } + dfs2 = func(i, fa int) { + for _, ne := range g[i] { + j, k := ne[0], ne[1] + if j != fa { + ans[j] = ans[i] + k + dfs2(j, i) + } + } + } + dfs(0, -1) + dfs2(0, -1) + return ans +} +``` +### **TypeScript** + +```ts +function minEdgeReversals(n: number, edges: number[][]): number[] { + const g: number[][][] = Array.from({ length: n }, () => []); + for (const [x, y] of edges) { + g[x].push([y, 1]); + g[y].push([x, -1]); + } + const ans: number[] = Array(n).fill(0); + const dfs = (i: number, fa: number) => { + for (const [j, k] of g[i]) { + if (j !== fa) { + ans[0] += k < 0 ? 1 : 0; + dfs(j, i); + } + } + }; + const dfs2 = (i: number, fa: number) => { + for (const [j, k] of g[i]) { + if (j !== fa) { + ans[j] = ans[i] + k; + dfs2(j, i); + } + } + }; + dfs(0, -1); + dfs2(0, -1); + return ans; +} ``` ### **...** diff --git a/solution/2800-2899/2858.Minimum Edge Reversals So Every Node Is Reachable/Solution.cpp b/solution/2800-2899/2858.Minimum Edge Reversals So Every Node Is Reachable/Solution.cpp new file mode 100644 index 0000000000000..4ce382baef59a --- /dev/null +++ b/solution/2800-2899/2858.Minimum Edge Reversals So Every Node Is Reachable/Solution.cpp @@ -0,0 +1,31 @@ +class Solution { +public: + vector minEdgeReversals(int n, vector>& edges) { + vector> g[n]; + vector ans(n); + for (auto& e : edges) { + int x = e[0], y = e[1]; + g[x].emplace_back(y, 1); + g[y].emplace_back(x, -1); + } + function dfs = [&](int i, int fa) { + for (auto& [j, k] : g[i]) { + if (j != fa) { + ans[0] += k < 0; + dfs(j, i); + } + } + }; + function dfs2 = [&](int i, int fa) { + for (auto& [j, k] : g[i]) { + if (j != fa) { + ans[j] = ans[i] + k; + dfs2(j, i); + } + } + }; + dfs(0, -1); + dfs2(0, -1); + return ans; + } +}; \ No newline at end of file diff --git a/solution/2800-2899/2858.Minimum Edge Reversals So Every Node Is Reachable/Solution.go b/solution/2800-2899/2858.Minimum Edge Reversals So Every Node Is Reachable/Solution.go new file mode 100644 index 0000000000000..b9fa738f376f1 --- /dev/null +++ b/solution/2800-2899/2858.Minimum Edge Reversals So Every Node Is Reachable/Solution.go @@ -0,0 +1,34 @@ +func minEdgeReversals(n int, edges [][]int) []int { + g := make([][][2]int, n) + for _, e := range edges { + x, y := e[0], e[1] + g[x] = append(g[x], [2]int{y, 1}) + g[y] = append(g[y], [2]int{x, -1}) + } + ans := make([]int, n) + var dfs func(int, int) + var dfs2 func(int, int) + dfs = func(i, fa int) { + for _, ne := range g[i] { + j, k := ne[0], ne[1] + if j != fa { + if k < 0 { + ans[0]++ + } + dfs(j, i) + } + } + } + dfs2 = func(i, fa int) { + for _, ne := range g[i] { + j, k := ne[0], ne[1] + if j != fa { + ans[j] = ans[i] + k + dfs2(j, i) + } + } + } + dfs(0, -1) + dfs2(0, -1) + return ans +} \ No newline at end of file diff --git a/solution/2800-2899/2858.Minimum Edge Reversals So Every Node Is Reachable/Solution.java b/solution/2800-2899/2858.Minimum Edge Reversals So Every Node Is Reachable/Solution.java new file mode 100644 index 0000000000000..5c4ba99ce072a --- /dev/null +++ b/solution/2800-2899/2858.Minimum Edge Reversals So Every Node Is Reachable/Solution.java @@ -0,0 +1,38 @@ +class Solution { + private List[] g; + private int[] ans; + + public int[] minEdgeReversals(int n, int[][] edges) { + ans = new int[n]; + g = new List[n]; + Arrays.setAll(g, i -> new ArrayList()); + for (var e : edges) { + int x = e[0], y = e[1]; + g[x].add(new int[] {y, 1}); + g[y].add(new int[] {x, -1}); + } + dfs(0, -1); + dfs2(0, -1); + return ans; + } + + private void dfs(int i, int fa) { + for (var ne : g[i]) { + int j = ne[0], k = ne[1]; + if (j != fa) { + ans[0] += k < 0 ? 1 : 0; + dfs(j, i); + } + } + } + + private void dfs2(int i, int fa) { + for (var ne : g[i]) { + int j = ne[0], k = ne[1]; + if (j != fa) { + ans[j] = ans[i] + k; + dfs2(j, i); + } + } + } +} \ No newline at end of file diff --git a/solution/2800-2899/2858.Minimum Edge Reversals So Every Node Is Reachable/Solution.py b/solution/2800-2899/2858.Minimum Edge Reversals So Every Node Is Reachable/Solution.py new file mode 100644 index 0000000000000..fe04256d8155c --- /dev/null +++ b/solution/2800-2899/2858.Minimum Edge Reversals So Every Node Is Reachable/Solution.py @@ -0,0 +1,24 @@ +class Solution: + def minEdgeReversals(self, n: int, edges: List[List[int]]) -> List[int]: + ans = [0] * n + g = [[] for _ in range(n)] + for x, y in edges: + g[x].append((y, 1)) + g[y].append((x, -1)) + + def dfs(i: int, fa: int): + for j, k in g[i]: + if j != fa: + ans[0] += int(k < 0) + dfs(j, i) + + dfs(0, -1) + + def dfs2(i: int, fa: int): + for j, k in g[i]: + if j != fa: + ans[j] = ans[i] + k + dfs2(j, i) + + dfs2(0, -1) + return ans diff --git a/solution/2800-2899/2858.Minimum Edge Reversals So Every Node Is Reachable/Solution.ts b/solution/2800-2899/2858.Minimum Edge Reversals So Every Node Is Reachable/Solution.ts new file mode 100644 index 0000000000000..b28dffa38dfc4 --- /dev/null +++ b/solution/2800-2899/2858.Minimum Edge Reversals So Every Node Is Reachable/Solution.ts @@ -0,0 +1,27 @@ +function minEdgeReversals(n: number, edges: number[][]): number[] { + const g: number[][][] = Array.from({ length: n }, () => []); + for (const [x, y] of edges) { + g[x].push([y, 1]); + g[y].push([x, -1]); + } + const ans: number[] = Array(n).fill(0); + const dfs = (i: number, fa: number) => { + for (const [j, k] of g[i]) { + if (j !== fa) { + ans[0] += k < 0 ? 1 : 0; + dfs(j, i); + } + } + }; + const dfs2 = (i: number, fa: number) => { + for (const [j, k] of g[i]) { + if (j !== fa) { + ans[j] = ans[i] + k; + dfs2(j, i); + } + } + }; + dfs(0, -1); + dfs2(0, -1); + return ans; +} From 4c35b7eb84e92e673faa326023e99c74aa2b0360 Mon Sep 17 00:00:00 2001 From: Doocs Bot Date: 2023年9月17日 10:26:38 +0800 Subject: [PATCH 4/4] Optimised images with calibre/image-actions --- .../images/image-20230826221104-3.png | Bin 9641 -> 6103 bytes .../images/image-20230826225541-2.png | Bin 7136 -> 5014 bytes 2 files changed, 0 insertions(+), 0 deletions(-) diff --git a/solution/2800-2899/2858.Minimum Edge Reversals So Every Node Is Reachable/images/image-20230826221104-3.png b/solution/2800-2899/2858.Minimum Edge Reversals So Every Node Is Reachable/images/image-20230826221104-3.png index ad91bddf13147c1b5d9d31ca7b58761d92ba0bb1..dd782e59f04a4b7e9b871752b04cb10ef46c64ef 100644 GIT binary patch literal 6103 zcmb7IXIN8Pvkr<9z|f>fFM`rNDovV{ASDpG6a%RAAP_)`Qp6xFh)5HpNt2!+0+LV- z3Q8}b83;`}29zq*Z{zvyk9+^!JWrCf_g*u5X4b4V^S-era9s!k4+97Ug6Qi(%|IX; zC1AV*J`4P6tz_~5fAlCl8$S?;k?rJ5Ge`+L1cA6>^`V*;L1b!nXpF@$@0ZXc?0N?7 zl{ePe`gMLHt@C^o`eiKd4%&Wmh@h=v;yPNzLCsnS$VdnF7bzO&VZhTwJ+EndZb_IcWQo>Zv zfWoIiAQnCl2z?r)fdYZROdt@E=Kov?0glkp{m--iUj0|_e_ahRPlX*|mzS5XQYe(7 zrY6b@g5M(NF=b%jUQ6-8;YQaL)qCO7LQ_8|4WkeJ{a?G2ie85u?d$L)y$R#|MuUz( z2unza#7W9eE&ccbeF#jwb9}gIELBkWnNz^A{dtwSHDE|-fxLo|l!tKLY-u@^0hq*5 zGg1UD&&uMIw!S-3>EOLyDJ*gJ&t!9G!_j2c4Zlu%U6056Hh`qO^X5X2nDfxch|BtU zv6aEcnNEt2x0aI3Z;R4_nUKmd+w^+AkEykzW%bR4;sdEke3{IEejicJsTvDXw`hTs zT^CnR)g@pun~v5mPjRLs|@y@1xjqY7!%x7|={N)tYvi|oJ` z6|oufnCnbEv{WevqKIT`dP^uMO<@~#?dvuzp(dlyggwr?x3lccrc_b>aV8c%(I}}! zBT}1mz}4D?SN@{(U?v{04zf+lrrO2GCBgOEd*?LO9Hiemhy{^6OGd=h2R~XFlBo8g zDEoEE)TO_^?wT>~)zB02lSo%3kl?h?8FyL(WwM=OLL!MH@F=3;8+FP#0o5_X47rYp zumfsQZS8PPP0eSrkcn58M+OkoTqMyw?9tAbf1NLq*DM8HdpA zR05C#Js+Q*?g1=h;S*AF<0e3nt6fg#zipqi@b^<1c@`+f1f7ggratcke7iltsywe2 zyX;b_JU%?0SCL%0Y@|rB82+w>Ix#V6Ob0Sn152_@y##5K(g&9cO+}y88UW)z+e@C0g0|wm7cLJniUPIUD;(M;aDB=o4aj#gVGd z>@$wc$}^8FhybMx?zX)bQldmI7QP`-jEA?k@%(O@^1$kVu3#-MH;@Nx z@w0L%8>SwjW~1wCQ!On=l>zRlDSX8^4iNEae0~Vs)xf~O(I0^Zxy|1hnE90Ma?03R z;HhQhI1EMaJcuZNquKwRP!i172scz?kq_B@GG6VP@cOFbt(k)|KT6A!n^!IfDaAxd zd5TUbtH!24_*s{bsrHfszkhtI{xIU-`iwquxxD@rpL3ドル-7X(<&7b2o>LgbW{mGAqH zrSgTYdZy+?Jl>eo-`pY@XZ|@_f3kD@DGE}}Z}?CJ$l9dFqn+{Fe5cQz6PL&r%3obs zxfU843ZGg2z^@W8b|C%;KU6Cx6Ym=pfy07j6ドル`#JiowQ-0)QkeXuWB-VoYw!+ej>w zmsy|b=mnmlRl}+1J=xe=TXVZuUIo~!X9B2X=d%zVC$T(nS&i9&7cSVjq8-CwFZ(5@ zD^wgZO&*U6aHwTu44=-(>Qg`HKF59SGiK&(n!WF&E=hOP-O4Ar@b$y^(v7*4D_jp1 zO-1*=UQ9?Y&`sD7IgR$X)qK3~G2UgQW!(_q`RxEEGz@*XV$ZhNI3!-OG1GDRjWo0n z`I&I<(^Y>J#Y_@%{ z2JH@F1ReE-_s^iAd%r1xQ?=%{8mRthUlOtV=|u0Fn^W)pR37Y5uUEVDNXEc3+3JDN z%L(25bLgk(#jN^ML%T~x<4*!+ld#c*bb}!%Y))CKKlwS!cl{mt) zm7V*fhNEr%43FMjvPMtmPMQ`L#TW_R)j?tArtkl~#WcW^IYLG+K|N5@PjCo+*sL7q z$;o+3C7LWY9BtW9L{^L3U=NfYc(N_e4`bn*1JBnjpDuHN^7ECUR^oMCi<@i44ww9i6sq`p0|?c zwiY$lksckvP9OLkqFC{aJiBT=cy7B1%w$F!jprKFrs%g~NyAOgPIQ(PCV4f!WLmlY zHwg5swY*mfPoL!s!=n%?mC6;5 z!^s{rO-@b@_0{X3Ab`t&zRU;%l~)z^P4)dR&9&c~L%F!H^ZE!HmaYvTO+9*qwe=;eA*25(@$j z4*dT1p0l6XL=}{mjht?cN99>vONCpC<@nuvlo(ccws4}&(!rp78si0kuewth;qrd3 z38iI41wKXjrqQ$+b#6>V=W~=GVsw4-Geyo2ZIYEk*u)NX-1C{`8V@6<^gpykm36yq z4T0-A+NbQQUE`U9{ribmuiil!o z^qj>ixr9`ihDqR9doJz2N^snNOX)!3+B@MSLITMZvY zdtk?4eW>5?p%3$>?IEz98Dzz=K>3DxN za@-3)b2hkX@y!$Ujcr6jsrwtTr_*fVUX3Q}Xp(Xj(!p}N#dG{aE0suKt($!8G56&y zr=iW_Ct*D89OpwI8O5A5*+lk^57v81ObdPpE;Tndw^Etaf8WjHIYpEgemdc1O>Z+p zu6mv!vhh9PCi!N+GS_{e^@to_Z9ドルt}Rx@&7MMUJ{ic%j`(fwVAZFQaDwHC6>a@GiN zG`~Xyqcq|b`toO2kVyeEYG}WAA$z{T)4HWx7ysst8!eH3Gzu-E9DAiV@7j<2g_k;& zcuqUJB*uDRW3g?7OD!4>m|N5ka(9m_Y^on@{L~c;bs|Ai7=h#Tk52uoN(D~h{B%!# z+X%|{eh@|I?~Z>-7jiAu{9v#9dY^TkyBfSYU8=HikWcNg+=f4b@W?h<8^v94{<9r6 z*HV}3?}C0kuRjvzMXu>k-RjrgnL7ZylO2&q@Sd|7Y8SzaSQO3fdx%#-1XR(#~vBw0|tu4Xe|jD zY(l7#O?wNOsx~iG5F{;rtz;KL1&8qsX=vOu23#MW!b`TZBlwCLUzlTfgHTpcG2c64 zD=qhYe0$)IHW;2qFo4O`H#AVksvLD^K8Rm|r$nf}FqGZ6ycqmPsA z)NC+7TPVl29!q~{rs@ zeQGGhBKG5>pcznS6>_*NY2Ez{lMl4G4@UTw!gG7>=>!8j^Gqt(;NH81JszSkUU@>x zp+On5UxdYtM`S4(Ic#pAX+$LmKY41s&EX_N&k2bOKSOV~Cf>dA$E-6(CeM(A^%bWtRnM@SHsE4Aer_ZhHu z^1;LlN~m1yRcAX052R^VDtq8FH-pf|g>!QTsJEQAIFOgOY3r5wX|=~Gpm>bBW3yZm z{ywY$=55D-v$$XvC#r)z|J!~^Nf$>m#K^!dT8{)8ドル!Iqaus=Ufze{~JvY|ip_^Gk) zqvLYgm+Uk0$SLJo^^5yCE~X6UR^08BxzL-`t{)-64S=C=gVT2(K* zBl1e(@wEQi!&aHv(M)aiQ64fc+$BNixJW5^Q8@oNmqW>5-@m^10CwE#&ARca;S7k_7B?I6Wp{XgOk>I? zl2_47Zga7(#ck8E>y^wxYb0Z%2jKHH5;Q(1Cnp2yrA~-6-ZHE209t>>sZ2%hoNv{x z%Y-RlTM7TZ%6g;YCF2|fekxxl?!hrXNC=Plh5d4d^cm<} z%JLOPz1;CLE)uah>Y?PujZUc#e1^M%|J)4^ZLE=_(?D?u6Y=mmNzUy2cLoL}qJosV zl(AC;OWP#>+0XQwKdSr4vtdUS2A}Hd>wi#z#qXS5S(!=Bo_j0#Y;Da;MJ{{Ta|LeJ zAul?lM4AFxt#L3sF$-7l70#L?q6W|uViL8#UJmKyv%@@mfSMF4=TEC0dpyx}VU2zSxiI}?T*nY0sb6jE483?vqQewH)ouRyqa@&zKNn^NK z@&tOSG(@?B8Hm}p7&r&hyn+ZuktGG4-cWNb;3XAm>(SYFgMUYmwnN|rd8Sue@)dP_*f&oL;iI6dsDB6T zR^64^)<6s(nm$)se3w(qb^p~texe1!{i6_yx*z}#rsr)A- z7R0B5`(dfUrrpc{ufWN%)|Vk4cRvgODe1p4dmQt?j&TEH;`VCc#oP5r%wDw@Js>(Q zk|e00ドルAM8}V+mmEv&13e_Bfg#0On${RX(9^*y_@sv|%{T5ZyOLBt*L=C+$fTiYIw| zoSLo@h~vKQVmPzf+Y3K9YHn7y*8u2<9pzfpboi16hq(6z*7j9z!?!qw)5apk9;err zzC5Fk0U&atg>83B$leAFdT~Za4RMErh?OZD3eiRnJ;I+nPLW(l(}-dgTx0LvS|&*y z^Rs2*FqEn@;Zu1c& z1S`p9;8+|M8?Og&JW$sOyielD#}s8YiyLkOQ(U!THuS>!uP_T^LBKoGa!Vae$Q;h% z^g-Jz!@cVgp-N=R@Yp;V>tl0$@w;vcDqbJzGhG{ zgk)J%26*_7nv6i1lZj-scS_P7c`-YmeB;sfm=RhUBF*PpkB~V3x|)GC2~4ドルwX+1gL zPV=%TsnBN=z|r~AdWik<yFH=16jztN9M2+nHc}w$_dUNKV^vUrgpCb=DTKDy zMsUmD-=9l1ez2B3(vNFcQ}*kTA00Dbu+-TNo+aKP|`mQs~pPbjt;zllK$FXB1=sJn})z;WQmn%_xJh zO+l`N@2~G>l8i!1;oY>C)sME!8|;g+Ew&4Tfhy(q3lDgKh8c?9sq?CZ$X_;0zYFxb zS45NmQisSZ^;8}Yl&pbU5AG#~9{&2`0=Ql^GGiT~jRFx^CxBy?N**^iR&zeyTNJ#* zU**)1qy^h7IjKD_!MIbqCADub(xA;uxsX*acRnjHm?;CS-yJx3Tc)VI z*4Efh#z_tb{ItaTdD3dW1|nVIqyf4is@ zj?j~hSpwLkiXZ#?`&n8fDl(+hztL<|b#(Q47=)VBoC8g{^sM=0_Gow9W0sc1DyRT>!FR_&sUMGBI1Kp0s6N uC-u~NfJcq;|6{ICNN%7-_%DyGA$ce$*-yG>lXV6I0zUdWa41geF8V*Ux@I*1 literal 9641 zcmch7hdb5r`~DHx5fLGy%(9b}QAR?>u~$YMJC5uvS(%YgRvD2QviCg7-en#uA%tw| z`<&0`dtkju;ckdht&keo^?tve_w(g(ec#xpg{hdf1ytl51ojne`gjbk0)zze|k2ai zgipD(R0jBqz*SCJhZz3&5nDyT|F5_y8n|gYTf2E$JVhaFoSdJa_*^ZYqEJq*w5ドル%_ z_{}o#OZ;{^250ドルCQ5J4?&Q7d4c27|7O1ドル`_{a_iZuqf-`r@`{U3RYo3;ajZ2!jeKl zl7fO=c=%oj1S>*W;hv6H+Qv+vzDH4YJ|8MLR0d=l+Op4rzV z@kf+j?%#b_dW&1zvXmr*h4J&xbNTGj!jEp$%*>|RNV+)JNqFLY|spn3;%_4VZw*dHViU<;aoyffrN1>*(`J3k`^F~PO zXJQ9rP9E;v@@Zsts!nB7B54omc?x0hoOTIc^Oa1e;N#=_^xY9zUCK@R%j1ry^K8*^ z6Fl|A`tlM!2LV2R)X`bMv&2ano@LUKSk_27(=2N?MWm*l-eqB*TlD0=kNilQb;vzy?L`>adY;M+sC^H;Uc+lu zJ*6w4_K06!YxDV=KI<`}7frnqfbwh=%h}3jqbjelott*5k~u#imh<#h$htzbl`u03 zB%?;hlh)iMzisU29OUNaaxA6HZD|~;kbY$*hbuj<&)hyn??i;le9vy$l1cp`a&jjh zr(XT_i(JCG%;1{6B^rG(RrE>QLDPY>-^tWm*CWrFP<=e1+xa84d5`mgh)raz?w2db zG!P{#N-6*Rj|SqNvni5(u|?%SioAcT_IDeZK=iSvVUiGJkA}<NfxAh&5Uv~oo zWtjs{U6xi>lurFCUl8`^Xh{iTxj7*ca{BsoKL#>c_A1=$Ek0cKQHX!sf}*PI8G2x? zS$Y5~o3Hez*KAZx4UUXlQk{sP4#rDX9Ob0RdUP97ドルXM`3#{jElmzGkp`2V4DYTVO1 z-OcK$#NWJ804L9Q$P@0*)h0{`x2 zx~!yo#?}|d`!khbgn!Ub!rRR9FmtflSnOy%Hm_C8n_cxhX~;HY zVqNXnzZBi`dD=KJr(jYSLUO7>91@$vD?MF?HQYJB{I zBR`q30=65*5uwQAQ1Nqd)D_z5d{K;V>iw{yF1-aOH2^*-BC|E zSv~JkIWLi{?{Dlqq^T*hUvoi3ドルX`;th?D>OU#)->6yet$yP?YFJ?brGl4ドルah2iNy3 z1{U{x%3D`Lp#_#?&&^`lNt{qXKWN-H}~*C0)5&}?oC#!yQ6txgxz&NVrjm!v6mpJ==FGpSD;!;9fyk*^c z@yU}Xk8N$a17yj+ibF0`d2X4;r>5S7wK``TeHC$gfT|>~Gcc1(SKljllZs`QzH#H` z&F4>ECnrZeC!*{+;*x&@xta?ZqF`#8fnfF6oW3Hpx#tu5#Y)AX2A~-uT z#r5^;*Wiuu@$pDpb{4CkJ?ygBFwZ>60enqH(p8?pbvE{6)g&Y)-A#!fzIYEnJEP znoqSpS5-wOBqU%_`x=4A+S}V07R;VhViQ#Ihtg6F8ag^M#N&<0o0iqv2m33t*wp>} zA~q`(vzwdEr1rmAwoONO2&yZjDnk z0p+qgdp8PMK%J+a-Ufx|vNkZ{?Y-}{Bw5L_ikRn0k7ZrufI4SAs zzV4FFw(9AfLo+BQEt}WyJ*pGQZohyiC@4Um9=iORZDa)W{kgv09(AdU|(HPljB7GXJCC87Itmv9XY#U{FJYl+;f5b+5IL zd74^US?&kit@P+CMX+VE%e*Zgwe!#iGoFhr&+xflwN=HZMU0xoMcAolJoiWey;Cp$m zUuBr!gC*FwdG!?1(D0+n0C$G)fx2r_-P2{#BwoYd>q@cjii*g?DOs#*KIRt}cTPDs z5ドルd5`_NEBoLu^xI17(r~%qW`YN@0`gut_T~FZ!E$MJ<2npj~>4JYJD9_)jTH*HEGRVWe7%`+%Z6gS$ng2IXL!Z+4}=yt>M_KC6puFMj-85ym?c=_;x4$*{--(Qh zg8nY(JS$aPpI8MzXI}AraB7MS!7U(w*&UFLo18R?@x339yOlw;)72{Hx!ATgIX8EA zq3OpuhK4UPGMIl&RZ~Kz6ZbzBxy)x2q8N4gyuOm=+Xu&M`jLgj#?_>VYXSlqaEaYa zdUSgv7ドル&2-a#u-lS3T5mas8_ygEDq$A?)yI<(o9~pmmm=z0ly9(x^^qulsv1qz=mu zvwS6{jRo!#56*L486Jc{A@%jcp%!q>$e{LV?)amxk`P;9JdlIy`|7ドル$b=q%lc;5MQxgPfe)c7`LeHI65ドルqbr87Ge`LqAaZ7=fL^I7 zAHPY>MdTeQIg+_Bp;vIr!IqYw6ftLjwHr5XbmV0Q6u2jIs{?S~!~yuzr%wqGLY7_R zL*wI|VPRoThcn~jdbpHA8W?a}8LIo)+(K-%=B79lZYRBd{l2<7`sy&kw)7_?jbbzb z^>namGC$s70c*=pw$kD-UGrRAe}6wVpgJ-u+Gp-RB)c8RYe@O|*)5NKEYIO_sUYwquVpm}63V@2E zD|t_=dp34lO!&+f7&$@*x)PCKB*bPngLo<|6|ujy>}-`RpNsU)Cj zRdKrwxhR)}LTYMWq!y7(=U-6OHB1U+SEdSoJE>Ya5tWpblt>{-Xc7rIgA$yET>rdD zVTV1A(`6+cPMGu7Sb(LCmRYh&kv zxcT|5Ymg5*6XHooD)n7lwl4_iHkvx?Bxl7p73n#Ajrk$|{^XueO4(C%uSc)-t!XFEwTB9}>7Twwk9pbgQiRI`ZE%Un_|f|&`}nM^$x@I$ zqDjR>7D><-^_&fcr=^ zYTYi%30RN%OFo-udbBe7*Eb=*eAU($?Cx)LAsJ|{h4P^qw0MMko6=n3!M=FC+#xaeUyoR8*iean4 zdv|bbEEMpxxL)y!%0_u*Zm!}h+Vh}1IbXr8jflAz@cHpzu`=|9ドルJElthlc%02iWy^ zopIuO8pV4yHa6Ycwp-rc9Yy`tjpyW0D2@Q!7RSOSYb%MxXP-w^w6@-RkPrgld!Lnc z4%e7kRaCeuzpH{!8*8GJJsyht{Ug=+@j}N7dV2c10Rb|9k0+WJ>gUd!di{sj_khn* z9q?RcYV91NGxK}K^7nVRxW_MgXrA;=i8S_%Lk7G_5mQG;1A(#4XB*BnyZv`u_J0{R z{QG;tedC6ln%V`K%^_>a#Z(w7u@OIJr@A?oqz|U?5x8#U zCV92#aDl7=#0*unjUc^TtYUqt!Do83i=dQLH0@12^M8NOQY77PP_W1pNuo3o3m`^p zJ;EUUL3NB{x8vVM|Dd9*wArFZ+gU@0Ez~P+gC{2f61G@5VJfev7&<^I+qEuU4@3t3Jz6PqL*62o-2QK?R4}|>Jc!C+ zR9IPAv4r*Ih)tUOB)t5Vc07ToR;k;E;N`U~KaE+Zvzn=M|5oWhx3jY|I6K=9#Y9qh z@+5wCPymS8a!>MqZcITz7#DZC3t+(H(mXoe%Xv~OMVJ;T?YsZ3puoQO~R>vej#z1Tf4fC0|H;*x6r?_Yk5=p~g3 zNlqTe933?zGT#1Ua=d+mIlO*6`!U}>YuApA&(+mYkbXj*n zWu=JNC8XSTNIE=RjJxiXS6O*GM;0KBs`}DR!fAKCVxwFm(#d&rbU{~7@asgChn(8o zTTecp@SpBiH`7we9KM5MS%9q|E0K>LT^-J3eBzu!Y*OH!e&v=m_Vj3%4YRwm^YYcJ z=Kz;bi;0#M-#;U;*?D z3~jIubi<^j462wu`^qq;-6kd=wic=!tcivq{z2o@gzwiok@k23dt%uz(4!nd!ushb z$j3U*Hb{JQxGT-9@oiYm2+Of{8>EJkT70;+j!ptLYU~H}XaTI|--_HjJ^c z@g<`fei(83=xdyo$q%%+j==j@*h%xugc4aou=rv_?`ln7{qa_#qu#%fqlbwclag<_ z+65Ls-IFY!v5=Wz>sZbkKGP&HKJ%-cgy5XTzrfLjp_dN1YAxQ4rfkYuy(jVvF$c&eE5|)7^nGt1r|= z24&X@ga;Lj%8iP@HToW;WD2GBeKIPxV7ZN?IS(QJ?Ine-HL>iE024_(y?^v5P;ot^ z(UkRK%{<4)r`zks|1b~oe<|lrgb(ytj?hi6r8qmh+1>4gCxA9Pc*=YZS=3d>MYo9( zVYvP`w$=PWZDDF6Sxs4+THZ*foBZ5{M`6i#MsKwg!FxrI>XQz}xEE_?oGb+CsXYqw z>gpspi12x6(Uvpx#igZjQ!#tkIOoinG`vSc43Or6vw`FIU=&Z)@4 z?OMS_H#fJCGs>B7-{=o^sd6Llva-HSO|@hg0uh_nxrpQu`f}0f1<}iidggvxsle@d z_=uL63p~~V2ZfRQvwEaAU zLxd-mOPLy4zFchFv>!*-pKQC9kD*GRRi(nh!y(ND!C&(OeTS@k@39H=Gk@~hwGBJm z#Z-OSSDYKR332!ez4R_?&>|*IX^f>3_q1c}!YOWk2vYfA4jKR;D#x zo~Tch^$)kU5E2}Nl&T}RD~(O4y-7vYNm+e?JuA91==%SD2#6hU(jJe)74q;m8*WgTZxdBx#L8YP1MM>5x25N(^ASS zm5}iYr@YhYp0h8i=K>fdBqZpWneVHsQ#jSFa;8bR65`OfW{RY`zHwq5)lHTAUW!k{ zsmws`@|3SsMg;z5Zn9|`%fCYm5`(k!kTrN~su*%Y{Pq}bH9N^**IE;U2CwaWOQR%i zqXsXR2i>zJW(TUn)5)ql-Hk+tm+i2i9u5V9m8JCqCjKzmMCq=Rsr0& zZkN1~H;KMxVE(wv5+Z)Ct+jz2wmt1SFu$|hL$XCi)oHlnd4rsz=jk_Tl}oh;SrhBD z@S^q_K+|P`lW@2Ng$|b}LA&NEl7+Q-sL*oJjoTG7PH`tkz>vS83xUQ4loS@KP6wQ9 zv>pIHceXw!TAYQgH7AmYvxNXRreJ)kSEx&H?paM5aJ{%%%Y!|TnKwK(COK48Ri9@T z78lcUsi#G#21alTY2CnvT+C`}l5sqwkGVhZCYkLtwc$agoX}R~Ec^zfRTP~-q)mqR zeefcP5!b}T^hYNq$PAORH!o3fsDC|g!g}$dySuxEye<1rsk(zujbe@(0hf7y81kxk zG^2*E9P!ZHoWOXgnE*(k|7tx)(bS(?TXB1F8VW8sN3Q63aLImsD_ac9yu}bB$Pfd@ zT`Py~b;eHaNa26ドルr?5WsFe+KkgUo-YMBpg5Yy}+Lfhc9?*gKMW3* zv-|;L$f~EVPBiWR`4a&Y5G(Pur$^D(*Vkm=p2A}C4xU)shDQ|Camw>PbHRw%*w~Og zS1&IE9M6CX#Yz+w6ewtDXteb!E39elGn#JNo1w}21_`zAt|6kq*1 zq%_WW*w{G#dknQF5O}1@Yu3aB)yi-X%YDn%l%K~~S5Gese56N@9@U)fPt6~kls)bw z?ah>B38%O^jJw&h>oqhuVykcJeZKjyQy`c&1hnwbdS> z1$oZ-(+x=NlEYjC{d15l1%g(rm!!rONv(wD;Rbsgq);e$Yq_e)FEcaalvw;}aLE8u zipou9zHU^Tl37lL&)9{FsRf{ z7^0Qg3@}4+{@L5J7|K#K_-u>(?Jb%0ursLV-2CO;0f;vk88LQ3%~{;r>)gmRA#C{r zP&+t34IDS~v*SHbsvS-KCxSNpOd_{$pU=#T>Zp11ドルvV@7pmEkWP%oFG+;NwuNVsw$ zu%jQfTVnzuw9ezlW|{Uj`yD-n&Wu3(=ueNzR*LJ&m4(#Ck&KhGY!5YPMy*d+lswd5 zv6BEBc99T3y;E?iQ(4W;%Tv+;DJxdQFCaj-v9VE*`5I*i)&PO5v55(ed1T8}^Y&zc zGEC|F5h1oazP{IHUrCxba%Jy`=avxGHW4h)q1jn}sKn=ZTDrO%K0ZG8{hhufaIoFe z*3@JLQmn8-MsN<6;8@tki}lfogcfojbigkn<0%zdp?8!9?a;xdkmkfxh4wldfyle# z>r`0ドルFhk1lwz)M3j!joky2Op9EY;}xeGX-<4hz*c;dn}xb?etepkoy&!l+0dd-?jk zPQr*9aH_p!A1`@y2ドル#@d-Ma?G;~@l7d&wnCeJC+?;lY|T*+6FFD#upW0co6#7k%^{ zh6YUHXhZ^gXhR-1Da_fhyGLD)?N-9AkIM+A0OtVhTDL&2!`#+OirH`fyNzYlGFluM zHs+KZ#a(ucIDCde--VXlw`#B(|2 z(X2CX8LE+BqIf^D+C_^#fByVq7|6745uSS{Wb;Xkk-|!SKG`5L!`sORN3ab zyBdb4v?%&y@^i%IGg>;jsMuHvwvdbP*jFoK{5YAHRvN;k*6rI?{v6gHV@Yq!UIt{~>R@-yuJ zoHxbOnY1*f{IkeaH%Tw44D8ns1)#7%XFa>OkB@zTwuYo9#~GBx!^wj^+*trEA|)SXR5_e76xIrN|M3aVteHyVhWS(VMtVd5C_Hwa-GWiHp)J1zm!3%`)9XCl~ z(h{C|y2N$Z@7eU+u)_L%QxkJ0Xxxr7B-uFFK@n5$|Fi{VhiLlpvJYeK;XE`Pl$AE_ zGeF8}YH9|Zog8F?rEzw4Mpco`<^c@u|$}MXCceaI_ zqh$E3@t8DtQAK89k5)2q-dNLqWvQY&OKdqAek`@z#<0*z~w1Bx|8hGaZ=g%K( zjMyyh;bC_2yW^4utC(1Mb1JRkJ!NI(ZWqI(D^IUPzaoe9z@zK)uc_axBlDbb*Y74Etukzmg@zN4dm#Gzn_uu?QKFS&!9Zmeqp>^THg#xm*O6~^bFSyLn zBBNGB!VGI6MBo+fctdvQ+M2y-hBX`x;Yj@7g9MvkK5A>f`t;IOGQHs71ccPhcq=OS zg*148bTk}t;J$e?>SWnoUjF$S=dBj~Y)SqBIFlf*BHm~Ub}mdI@BK&An`2_H3T0we zcHe*a!1;^)J{&3O@Rieidr3ig0Ss1{a=ZA1k&2P1v$(Uc}_V& zZeQsEL3n#>&oFP7FFMf;4wAs(8Nfx7JK?S7L7*pUP!h4&2inlWzyfee6^xT2Y%{+e zgr~&Qwz%E0>IUYPqRB@(1RO|!bcC;-m)aNcW3^&2i_hTjhdQ%~Y#k$yYtF>_e`b=@ tJi^Zpai9iPKQoie|33$&loiz#O61Ig{|9MI=bHck diff --git a/solution/2800-2899/2858.Minimum Edge Reversals So Every Node Is Reachable/images/image-20230826225541-2.png b/solution/2800-2899/2858.Minimum Edge Reversals So Every Node Is Reachable/images/image-20230826225541-2.png index 2251e91420f1465ee6840d3ef91e376024d630f0..49253a0c475af1ddfcab648248928bb3c5da4add 100644 GIT binary patch literal 5014 zcmZu#cRbbK|G)M{xMZcmRd!}k2)RhE?0qvr_A0lF=u+H-NMuJ=#I^S(EAF^%#^E ze47R;Ww5NhsvLQzR9JpMk^mL-^8%i{Xl_G_1mI{8XCp z$VZtkNPiA^Td~c$do6w&Xu^gHf$F7DZGEt?!iKf`TJ=}Im2r8URLKJ1-QqKrxCM1FJy0QZ2a>Dm(7av- zYb3etM<(byeszwpyxd~lt^s5xl6z%fm8vekot38jxqnx8d=xj37k%d?79q$qxr79e zJK$-=N9sp!xGTabq41$F>Mu#m;>{AWs6mH=Y<0j=xe21s9sj3{m+(}h@vjg_wtozy z6(LZ#Nu-o@ft5IH)q3@sPNR1?WPRzN@c0mMre0&dr`!Eny-FKRgGVPxwm~xH zwpfgB)9J}kf6O9EIj^1vh7h4KKh5+ypCHw;-|jJ1(G?XPol@yc5WoSg_Hh4x&r-MS zmEKrETb43H;5a0;R$+INO+dj|qo4PBH@^Ti4knh9&y%%KJz~>iG^-rA8@1g4Ly(n> zw2-T5`u+L5)1SkgpQ-L8Ut4TZDB1BE&#SgU2aekg^{bzfB`LuDv+Xx4n*-9me*IeH zcw1>|d9*dSH6=MYT(25iNdS?G-=mY6_1IV*{CJgO+j66uA=K6 z+Kt%BZcOJu)tEDoOjRc!o!gD6BkX_vWg!A2xUps^9`0K8-(Ow53c~z?{*9F@K8gW5 z9zJk~3BZVlLr-7deDk>F;`WMcIEZODgVc>724i_Pt6g#OeXZCe?~a}N`uc(Q#)x~} z^4ZT|lsA48mpvX>JV;e^QGY@&dlCv9=2=H_J(SpbJ^soL(Y9$^DTE2jdClNyZA~ zIygBAnRg1Y?hvU87|E#aShzbE33GOK?kzC>nAV;@&dJGHkzx3DH?!MFF$zj1Q5P-p zrpW!GPEb=k1BGAXq>ndy*u$na7St~eg~F>SbBjwR7dCm>%$>q1;5f6*A!Gd%9m)F3 zwUB?-!chGDxbG|1o~)6ol?~7H@m=4W^s`NzYH*8)x~;XvVet+-y_#|*T$RWT0`krXq8{f zVGM!=fKQ9r+Rl47Jz84vhWb9%ee=b1I%3N^%} zc|t&qX%fL}85Fih&eGEV= za^XWwyzy^7T5n8wQy^65Iw*8iK_Nw=XleR;fcQ$qjz zrrDov7Uj1-an7-L=es(KBVvE0u+%36MCa$F@;H~Z>DJb=?gxL_bFh8N&bgl38E`lE z3o?OR2d^MsB(RCgnMGP%9{%=Yi=euwL4|rc2+2pX^h!`5wSG6Xg^HuT}4VqzO zlB~qU;(N7;E%-v$_=+4o&@p`Azu(@{KGUertG%w=6G+PiP+THe)njmve129QXCg9O*|@8Rjx7IVIC1r&ftzGyE~ zpbFow=O3_c&=U-FWatiHX}EGw_-R)%QDK1Y8La(Q5jMygqp0M?RjEZT;<+exfrn7z zNSSUpJcoS`4ao0A&Lq398Cp@l@(n>&UHo`g=Y*TP7Nn+I4taUaGJ7OT`z+utmg7O* zyBDR*2{my71=LOKzVcE1HEMyp4E3Cg)rSKq2_LdeEjGK$s;c6PZF=fcA1MLq$M}l* zm=}MSviPd`7_~;yGR8GY32;W{A_3=BO1(*JG%$A7#Ph#=1&09Nj-erw1-&uwq`NHf zSU3GwHDa>rP>>(@209$qD!I`H`>QXq3$=OuNerxdD?iDg6#eK?tSt{e&fp3rkR>d8 zIZnPw4`|_dtt(Jk$j6ZkGLiT^f0nS!c#Bd~QJ=R$wjl6{gX|k^22~c>BZXaLn{Vf7 zPlaY#_@&iAuY){znEF$hJA?clmNBoba!~qsQFq2tW_+MtI74hd)nfFHCYcD@_sn5EV_h%XTm2LR3j`8sQ7WP z=p9}U2b4$ooG)pD9w_BvR8}>x`#yk$w0`#Q)&f&)SSHky;D92bg288^#=#IoW+V@ynn?x^n?Lak!1up#6_seD_z&O;?d?F8 znyxri+P`{ak%=t<@miehrozqwkw^sopj*dsq^f*ozwc5v1|x}z7m$zhbk<$u30ドル{f z1+n0_MKtRlu!H&FA%$;nj68^3SzTRnvwrTEQ6Hc~UsWBWQVS-F8f4r2-B-r{0^b4{ z{SjjTogdzT+Wa`9%-#NbuDfziNlvayiVud^=W_o#oe;qoJ?c84NB0-3gg8|W5M_2I zeJ!zWl&rJf=@5SJ-)`kMi5WYk`qvyJ zNT4(Z#MU?eMNf3bwvdf61I8=RU0Q3b-#B0ub+>c&s90Rqx|i z2CXolgxU!JxRh9K9*x$coy)lY=jeNTMCZd~DDsLW7*?byKpo_gICvQW+EnK)xK*v! zMMlAAuspIPyx=MSy!ws10GRF6pU~cQ+=nYKuEdi?{+SB3uAXO6Qx21qd5}d7p5H&6 zx*@Z=Arr5aWi4Vj!qY3oeHewUIa21qH&PaQ3L`D5Fl+ z02z`d8^g&7%Ui=spVVG39p~zhvQC_heUHYN{NFf+46IAg@X+ zB~+c9ot2(=5t*+pHQgE79Nyg?4Hf8`Z1mgej)ozisBI{#tR}y_?x3WHB74`;kzK#` zDT8xTHhW`AqtuRs{Uh~7V|!#OVA#j#Vj*_r`P-QSFYY*$I3iY>IpD6QsI|r9kiwSc z*davpkjn1Od3i5+DBPd>atN~awk6g?*MOD4FLPH}cDtBaJV2Z=-Om>Pt(^k_?I}AS zbtE~It>I>Xz3b|O-=C@#Xsh_G8HTz^o*|K0Cc;~qqFOP$x)t*?$OsO&IS0*=%F>dI z2Gs78CTdqRJHXQ1NInBA(Q47~_z z@5>JVuriBvLA^)*llP^TzJDe&U%JbO8Ueke8HzM7v}x8=a75>JJ>j}D6?EhYMtWZK zpzie);f$xUBMxUaFtlUA^beV&^83t?y!DSD69^>>WwNwVj9mFKuT`fz)BwI*<*`ta9f z?8(6*W5lO|vjVseU6&XL)4`|d^kX|Cw%&<}i9x6I{p?pV|EJXD z3a96D{L%V&ZK>Zl5S^6UO&Xm4mU0yeM?f)}VydUdmG#G)J(V<^o;n;}zztv@il80m z%S7NNm-CNQHoshI9-oJ_xDMtOIqk32PQSi@9qI3*g4z|=p%kwzzJ@af zR$CM%hle!`?8v{PVi&~u5|WNKT3h|byZM6CG-rMd7heTdVu$AHS2|3i4nfhGr*RWS zLXCCCA{7aNd+WXHfdu8fZ7)!hlE*3>bn!mge#xL>mDEeD*f5PqWW#%TCsi0_JGdMmwZ8Ab}S02 z3E_FYyA3KH7BaV?N;-z3;au#Uc7`S6rJYOjy*m zSUB2hrX@MS+Vuu$&zHnsFnro?!QomUC0NoC$OdaSvr5B!@F3|*5UWOK(Nt26%=qct zp0lwoFgOm*^>O!lN#s!Rq54#z%F}=RTSGOZ2_6dkxb#Sd!jo!X74Gt1dWVtUc$j* zE0&WpGNc6Awj=IyJ^g*z45^D}dU2<)^6pa!bnlz}`8dldyfg z`NB0;4GI@7X?vO>f}B4zzMkvW&^uD|gJ)kDb-+b*OK9hWhp^r16GuR4tl}L%dK5%` z=ZF?^Gsz3*(8T61?R{RA29L5C#i}y-&@P5JVvn?m>>Fv6I^!Re0ドルw_MD|_=+0yqPT zhVQgHEiZT@9~!0df2ドルnv2QEf=t|qhMDO@9#vG_bl;)>Yp*C#`|a$T>)U&{O?OC k$p5~h`hT|1?DzTh_q^|Oxz5vo7i|!2O+Aeg#Ql)}13%OxEC2ui literal 7136 zcmZvBcQl-D)a^tVgCRo@-Drs&-(7dz?~iNEGQ9K5d7rY+-us+4QcYEXl$eef0)db!DavXvmr}dE2_0V*-^6)lwvxHbXIXhZ%xtqILS~|JgID70|Z;=Fp zxNWs`J!IT0O+9R#ose3#j+Wpe1TvUASdQcqLJpPt1wAJI zl|h`eqU`5xBs=SbIf5c#qol?k@{1vn-PFtsuL8xEGjJVZp%;#XK_Joy1aTM=hL<({T5Nj-0a9HbHPitIdMVs>Zck?W=ijdpgWwpI)w zi&A3#Dp45v+p^nOwH#|PFAU3a8o(qYBNJ~~w|(BW#KW2Z1FsPON{K^jFi&=+Z&sCW zv$H?@GpJL#{_G$MMYCvjJ=MB_iPuT)v2fX4l%Crm#Jk3xq|{+n9&YX0X-1y*7>d;* zCLtk7-yz4pR%Z}vs+eMq&@cphFp&K)ePRFnQt@_@B0I$sX5$pg4;ptFBm;E!&tD=< z?Chd4I4$l%S$^N6j-ITvj`!$}coVrFJGWuHlvNF~Dd!Ln+b z@d&ImUxSNTg)i-sZ;38SKggP-4s2b@&~*H(Zrm4xdWuL{M2x(>(P{xvT8y+}Z>EHA z#Y(j<%4&_k#%zpne?s8bg;m$>WKBUTDuOwPrsZP!K?Yr%U-7(#LM(&rx~{BWt-PW( zSQ!R`=`{jdTRd;v_$H5YvfP|--fx5J;OOXQD$Q0nsT&%N4QUaDxh zgX3fS?1*ouOmYoF`3LFE{>R+&J~&c`nJ=WzN{u?1|Lzhpht`JaEh5l}X`24(v?CHZp%Ak{WW*uV^D8}dC`9hrM#`sd7@PdE@cggu{ z+E9zzl9i!FRmzK2LQ2`ee@`v{HK=he_GgLLy5gWr{+s0m-3k^|{jeT491d6OyMMd+ za?81W&B+(N2Y**-IbMzRjAgGIMb z{%TGz(}TucJg?2k7ZXPQj$ATq6_i&K6_QVHie}4F#r-bK37^>L3?sS4BP<+2$m9bf zKJ7JzGpiIUu=w9hOsmyHd-nDB)BQ~gkc`_2SQTGeUvIOPI@e>6@ImbF?_bSLHA^fk zE^yPFlvyRPzem|&;i=Wt9LDQ2{G6TNw`$%?-tBx4L=FxRFGNt-Zm|AXZ=)WaS8akA z<{pr9s`lh+5snp8i89d(da0{d%|)q4bwaaqsu(ktea!`vnqeiv5te|jpxm!;nwnh3 zsUr2=H>-`g9qPD7mbuqN{LqD+^qa%0=Erw)nLCp^!NP%F#wbnc)aMbs$ARI znaJ8(-uDeh>P1N_dIBb65c5#n_XjND;(`E-^h8iuo0*hHK;T0IIJiPzaYnt^d|pBJ zWMxweix1oW=v)L~DzkDLycdu9P@e%S`uWj;L;%_C@C#y`nKA1~5;5fy^P!BOjyIXHf zcwQNBM+8U?*b`uvb?HXZB`yy}e75UW(}Vh51nA^Y)Hr?Q6!_MYBzB^lzXye`=SPl^ zuV;rFydom6l=JbF679w*#z^1H)Hvgw2A|!`4)~)4vg$`{?oFNI--!~6R4r~|NjLho%G@+wBdMUg-JRvpnek#Wg zpM5s4UDLHY{Xtl*DZWU@A}CART307JH-&_FczfgKycY})ecavMVfc8v=a;o!TXX@E zIce=2e4+ek{bahAVdz{ZFsHc&Z~AqMroeNr&G{z!3KR~&z=|~a<6stq$leyfb1zwy zp~bX4Jp3G5AyMGfiexvGmq9@0{dbzeF}p(w%miOaZ&om4;svlQKFi;e!@-B&m-(!$ ztmyo978j8LlFa=%QVYX`GUO#4;L8i=^T)fp?KiI1dY5~=r!(B&KMkOvp$W<3m8);! zz|q6(Fub38B5rjI%J~#s-Q9Z~H=n+1Xz(9noDaUhF_Y#*Eb~@hHrW z{0eZCDXuFf{gR0Oav-W^MqPaIbv*ohRq7uR#AmPbR>HvQ-eGAlBlF2u!ZKH!yib#n z!)$H&l7=u19F4&L(cjMp>k$IVYY`O0v^tOz0f^N>OX4zIAJ8W+qzPdwX$xtaxo>gMVwX!E3AS z#}9aa_QU8GFRqQms*J+=0s3419+s+OwaUDAj5K8sCccl409mzv;*8dA+yOpBua-G4NFE#> zE`cfU`beZ?78-D0-6h_VHVl0&k5k``DK8mFr#9Ad4;LrpqzA)0o^}gsH-(_$u+=o7 zRYf|VZWPt3DtejNKK3+h4xqj9@BrcG=jU>H=IPTkpOX1B5Ym{;uf|Gc9jcWoMt^a! zD&_18qBvEP;N!i`$Y?(}s9IiS!vnF11z}fWTC+1A6!krB*wLb9sOMzA&d zK#%K3=P@PsqP62B&p0KRZu~iw_`dAc+pn_S2@qK_%VngDz`uh3vRmEKouA|-1OU!l z+}y0Gz1q+J)X?>s+i^fyY|q9@gTj>a^QID8s6aL<1f#+pt30@76r7uty2hcqk%lvd z5vG^oNPE4G5EF0r(XzZ7CoMo%Z3&mmxsjlVAC>2#^Ph<#z5o0vee0jm`ed+ff}7j^ zMv=F4G>dnQ%=Nq0Q!eB=qcoc4`nSvDD}iuVF3*pzgL5A@15&Z2L0zoN zqdFcNhQD}x?z%NCcoHDl5Fty}LCd23L{-%cz&kK7 z@Z{GWDcfTg2n0}B_x4-^OD~^u4O=f@*dlGN(-?5{I>6>>H5+ zXKF7Xl8;*VuCxttrc@OLe0W>$-Q$z1l zlq@SivxxUL!}sNixptNa6GT05U?QIDlp+1ZXlcY%>b>c;{N*Ov5Fta>iuAyGZGyRg zWeP!aRjTcGTII{6SkhvS=^92q8#Vw6z!-2pBTZ3N=T0s6+|WUxP$php)L`3d{1r!+ zMA$rXds82nTUkNDsf^8xi$xBs%7`8ドル=W(6@o8}BQ<{dvzxpd!i)g}{cr1tm(%v+9` z@_Kkr8o#wq17iv81k6x=>!HuT%i|hDm7w>s>K&V#sDgq5KwXpjqzLD0b^cHaZyQcwOHzLI-twXu< zj+h))0VH8BLx5DgH{iY!2(KFvVlf5Qu{ z62x}2HA9#)5D|Ur0k{F!HpVFFH40T!^b7x*897#R&Zss7ドルQqtZY*Yr!!u8TtL@fMm`2mw{_nK$&q%FomNdG%I_ys#lu1DH`9p=cR`rWKX20kfH-TC zJMTHYRpXy5T6i&0tnYUV}hb5Qrs;74HQoWxD{S&b8-~eMNfE)TI8Gy!eCAb+Jx~_fRzWnOC`b)( zo)KB%-am))RX!WhCt1>F2s>XH@wPTRU@zum@`So*b1^8c=sAX$Uz=vOfW?n?t9xz0 zZGG(Wu@6i&bOX~XsKL}*@dHZQf%G7*sRG#BX~sDSMLP%WXPoRtNWFfNAta3m9lsGf z{oSvD@X?BzHAdCB$GM|9@Ep|HAgf(Zc1<%s1l&Ipj`PmUh;hG_#;d08?ZEM$^A4PvgBz>%-}VkBTlwGEgC`@ouCX)ZPLMN z>0H*4(hDIeiS-0g>&RJ@D+FvGaM4dCPuc4m8b~i^+uG2cGGVhZx3s)Ps*jNngO;E< z?YWQ7&b~iueu?Xj!-4vVw8@xKj*^%lT0t%=gujif@QBIdxk?aMcPyh!aIjQ;eLbC@ zl(4d5Cvwxp=|S|f^vq1z;NX8nI~(ikKjn$Ed12zZ`5LXorOm`ZDQpDnj$Ni-B4KYc zGdsdb>DQYFHV)n1hZfO7`&36%+;k9=4Oh+dAFQ12JJ-~FSh)j)-47~s`fzr%YoPQOLme!(ar zL$NW>aC;*13JSEZ$l8%rY14f7GWv9S=f;4YF$MDYRALW5mRZVa4<;vru0%ser#}ko zW0FSj2np#J27l=9Mpi|F>$J4k-`NgtIHME`M;dQ$|NEF_LzhMHd6q%1&R6591e1bT zmXlrPs1>Ch7M=U91LsN*f;CQ1lX2g%AMrvyEG@HT4Y!jUK>tRP}>xKx(a^tjYEy1cx+KBsqgceiNi+0JB8 zi}CSfuG+U*<8b}heaj5uf}!cla2q=&zn>1)UtQORrXr^=^BMG$c*_R?Z(T%6CB`)WCivW3gE6 zxM!S{Z_3MgIT*+9ドル$Ily+WA38m4MuMSWgYvj2=`7W~pujtz4Cl+0ptD(l+IOENjQ- z$sS^J2j%W{nG|s7MtJVXM5(O$C|6iXV(+qtie*jdh}S)6ZWy@7#%H}WDviVOZnN^Y zcUNr`{93$$ce7(E!#fg ztXhU83x^+ed?oe-mqAj%dG~f9;=0MnBJ7Q%0#00dyG%Gr{43rM*=SA>{{{B7`;O!u zQNS-Y=2nmZa|K>CkX1CD+dUw_(IjJwzaj7x#mPK--%wYDLN-j18Ze1 ziMRcNIRGk89^JXSh`C|r@b30ドルNXA{u+2Z z7Xf&4YWKAIrSAPQ>_cAIlMhsUeO29J{zs_sQscO1M!p338bl)_BTr%!?!%%x%@hW- zs;uVpE6c|+Mctv0l)1Reuh(yU-8sg6Prk2fVBp~QdeoOD^!D)j3u_N~A7Er9jwa2o zs%ub>PmBhpb7V9F7j<1%ghg*bd=d5ドル*rsbhquepunvxuemo@ni002b^a14i*peys` z`9XHzkzV6o7kxq1;>6i?%O0rKJu1i}tX5I84tJ{S@wVY?lm9KroPoi;DzVGAr>`It z)R;kb{eMHkBT)Ofde4*TiDs*=c!&)l%fCl2xSoH3K<0f{v)1jetdd_7fvgq#95zrp zwwE|i{f!GL+R;K;JSj_DY^_K=ZERpy*4Jmx?66u22+_%L%fA>#aj&bQ_6hDoe;e{c zteFncS&4HX3FvFg&CQ7fo(X{B_e#RHx1A);H!H*A3agpE-I?EPGS9zPGi#%*BZuGU+xg^u}(B`8D0i z8vfnQHC`j;lZB#=9+Ox`__odM^@maZ)jHWht_=nPj?$^o2n=$SB1|iGL0B z)wj*TL6^fem-R^Y?j;6#(+sfAb14(CyGGCg&mIUCG`lok5+Zq)q4lFfZ7+U(cJY7esUvuZi z7!lXm#*kk~;u%$>?D)ZXsxk)$Q``pA!p^bx1&5LoP$R`A!p1_4yCVasfK6ovW4jH$ z=wr1sUbep5w*Cw?6UuP(SrHNx%x9+{nj6q2l`j0p1{$?;>Xh*ui9H{-lW?Hd($&@V zxNgNUAi!W>$?j{@c3gnSfhh;CF)Okc zk078$hb!%658+2gk3DapkW=rm;CsR>p4w}>O;&8&YBHF-q4WOzdr#|dtAM)0N>9M^ zoyz%%6fyD}f7K)NK7P=^hL5KahrLWx&R>VVJBwIf@hmpruCc?;{zzTeS>@m(>lm(; zqlm-@y8kRNN56pRr5ab=C?R)G#jF}zgpEMd-&}wwB?7-uTxsvwRTAX2?vR<2@6q8sodmee0c(i&eib^~<6q$w zDPU%QDho%?U{mdW?VpBcL_;ys;9-hoY6wDopC;5%zA44=ch{@>7kIN9+zMvOkDdM-LK7

AltStyle によって変換されたページ (->オリジナル) /