deploy: fb0d7dd

Author: acbin

contest/index.html

@@ -80344,6 +80344,15 @@
     <nav class="md-nav" aria-label="往期竞赛">
       <ul class="md-nav__list">
 
+          <li class="md-nav__item">
+  <a href="#131-2024-05-25-2230-90-2467" class="md-nav__link">
+    <span class="md-ellipsis">
+      第 131 场双周赛(2024-05-25 22:30, 90 分钟) 参赛人数 2467
+    </span>
+  </a>
+  
+</li>
+        
           <li class="md-nav__item">
   <a href="#398-2024-05-19-1030-90-3606" class="md-nav__link">
     <span class="md-ellipsis">
@@ -84428,6 +84437,7 @@ <h2 id="_2">段位与荣誉勋章</h2>
 <h2 id="_3">赛后估分网站</h2>
 <p>如果你想在比赛结束后估算自己的积分变化，可以访问网站 <a href="https://lccn.lbao.site/">LeetCode Contest Rating Predictor</a>。</p>
 <h2 id="_4">往期竞赛</h2>
+<h4 id="131-2024-05-25-2230-90-2467">第 131 场双周赛(2024-05-25 22:30, 90 分钟) 参赛人数 2467</h4>
 <h4 id="398-2024-05-19-1030-90-3606">第 398 场周赛(2024-05-19 10:30, 90 分钟) 参赛人数 3606</h4>
 <ul>
 <li><a href="../lc/3151/">3151. 特殊数组 I</a></li>

en/contest/index.html

@@ -75744,6 +75744,15 @@
     <nav class="md-nav" aria-label="Past Contests">
       <ul class="md-nav__list">
 
+          <li class="md-nav__item">
+  <a href="#biweekly-contest-131" class="md-nav__link">
+    <span class="md-ellipsis">
+      Biweekly Contest 131
+    </span>
+  </a>
+  
+</li>
+        
           <li class="md-nav__item">
   <a href="#weekly-contest-398" class="md-nav__link">
     <span class="md-ellipsis">
@@ -79830,6 +79839,7 @@ <h2 id="contest-rating-badge">Contest Rating &amp; Badge</h2>
 <h2 id="rating-predictor">Rating Predictor</h2>
 <p>If you want to estimate your score changes after the contest ends, you can visit the website <a href="https://lccn.lbao.site/">LeetCode Contest Rating Predictor</a>.</p>
 <h2 id="past-contests">Past Contests</h2>
+<h4 id="biweekly-contest-131">Biweekly Contest 131</h4>
 <h4 id="weekly-contest-398">Weekly Contest 398</h4>
 <ul>
 <li><a href="../lc/3151/">3151. Special Array I</a></li>

en/lc/2567/index.html

@@ -75826,39 +75826,48 @@ <h1 id="2567-minimum-score-by-changing-two-elements"><a href="https://leetcode.c
 <h2 id="description">Description</h2>
 <!-- description:start -->
 
-<p>You are given a <strong>0-indexed</strong> integer array <code>nums</code>.</p>
+<p>You are given an integer array <code>nums</code>.</p>
 
 <ul>
-    <li>The <strong>low</strong> score of <code><font face="monospace">nums</font></code> is the minimum value of <code>|nums[i]&nbsp;- nums[j]|</code> over all <code>0 &lt;= i &lt; j &lt; nums.length</code>.</li>
-    <li>The <strong>high</strong> score of&nbsp;<code><font face="monospace">nums</font></code> is the maximum value of <code>|nums[i]&nbsp;- nums[j]|</code> over all <code>0 &lt;= i &lt; j &lt; nums.length</code>.</li>
-    <li>The <strong>score</strong> of <code>nums</code> is the sum of the <strong>high</strong> and <strong>low</strong> scores of nums.</li>
+    <li>The <strong>low</strong> score of <code>nums</code> is the <strong>minimum</strong> absolute difference between any two integers.</li>
+    <li>The <strong>high</strong> score of <code>nums</code> is the <strong>maximum</strong> absolute difference between any two integers.</li>
+    <li>The <strong>score</strong> of <code>nums</code> is the sum of the <strong>high</strong> and <strong>low</strong> scores.</li>
 </ul>
 
-<p>To minimize the score of <code>nums</code>, we can change the value of <strong>at most two</strong> elements of <code>nums</code>.</p>
-
-<p>Return <em>the <strong>minimum</strong> possible <strong>score</strong> after changing&nbsp;the value of <strong>at most two</strong> elements o</em>f <code>nums</code>.</p>
-
-<p>Note that <code>|x|</code> denotes the absolute value of <code>x</code>.</p>
+<p>Return the <strong>minimum score</strong> after <strong>changing two elements</strong> of <code>nums</code>.</p>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>
 
-<pre>
-<strong>Input:</strong> nums = [1,4,3]
-<strong>Output:</strong> 0
-<strong>Explanation:</strong> Change value of nums[1] and nums[2] to 1 so that nums becomes [1,1,1]. Now, the value of |nums[i] - nums[j]| is always equal to 0, so we return 0 + 0 = 0.
-</pre>
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">nums = [1,4,7,8,5]</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">3</span></p>
+
+<p><strong>Explanation:</strong></p>
+
+<ul>
+    <li>Change <code>nums[0]</code> and <code>nums[1]</code> to be 6 so that <code>nums</code> becomes [6,6,7,8,5].</li>
+    <li>The low score is the minimum absolute difference: |6 - 6| = 0.</li>
+    <li>The high score is the maximum absolute difference: |8 - 5| = 3.</li>
+    <li>The sum of high and low score is 3.</li>
+</ul>
+</div>
 
 <p><strong class="example">Example 2:</strong></p>
 
-<pre>
-<strong>Input:</strong> nums = [1,4,7,8,5]
-<strong>Output:</strong> 3
-<strong>Explanation:</strong> Change nums[0] and nums[1] to be 6. Now nums becomes [6,6,7,8,5].
-Our low score is achieved when i = 0 and j = 1, in which case |nums[i] - nums[j]| = |6 - 6| = 0.
-Our high score is achieved when i = 3 and j = 4, in which case |nums[i] - nums[j]| = |8 - 5| = 3.
-The sum of our high and low score is 3, which we can prove to be minimal.
-</pre>
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">nums = [1,4,3]</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">0</span></p>
+
+<p><strong>Explanation:</strong></p>
+
+<ul>
+    <li>Change <code>nums[1]</code> and <code>nums[2]</code> to 1 so that <code>nums</code> becomes [1,1,1].</li>
+    <li>The sum of maximum absolute difference and minimum absolute difference is 0.</li>
+</ul>
+</div>
 
 <p>&nbsp;</p>
 <p><strong>Constraints:</strong></p>

en/lc/2612/index.html

@@ -75835,44 +75835,59 @@ <h1 id="2612-minimum-reverse-operations"><a href="https://leetcode.com/problems/
 <h2 id="description">Description</h2>
 <!-- description:start -->
 
-<p>You are given an integer <code>n</code> and an integer <code>p</code> in the range <code>[<font face="monospace">0</font>, n - 1]</code>. Representing a <strong>0-indexed</strong> array <code>arr</code>&nbsp;of length <code>n</code> where all positions are set to <code>0</code>&#39;s, except position <code>p</code> which is set to <code>1</code>.</p>
-
-<p>You are also given an integer array <code>banned</code> containing some positions from the array. For the <strong>i</strong><sup><strong>th</strong></sup> position in <code>banned</code>, <code>arr[banned[i]] = 0</code>, and <code>banned[i] != p</code>.</p>
-
-<p>You can perform <strong>multiple</strong> operations on <code>arr</code>. In an operation, you can choose a <strong>subarray</strong> with size <code>k</code> and <strong>reverse</strong> the subarray. However, the <code>1</code> in <code>arr</code> should never go to any of the positions in <code>banned</code>. In other words, after each operation <code>arr[banned[i]]</code> <strong>remains</strong> <code>0</code>.</p>
-
-<p><em>Return an array</em> <code>ans</code> <em>where</em><em> for each </em><code>i</code><em> from </em><code>[0, n - 1]</code>, <code>ans[i]</code> <em>is the <strong>minimum</strong> number of reverse operations needed to bring the</em> <code>1</code> <em>to position</em> <code>i</code><em> in arr</em>, <em>or</em> <code>-1</code> <em>if it is impossible</em>.</p>
+<p>You are given an integer <code>n</code> and an integer <code>p</code> representing an array <code>arr</code> of length <code>n</code> where all elements are set to 0&#39;s, except position <code>p</code> which is set to 1. You are also given an integer array <code>banned</code> containing restricted positions. Perform the following operation on <code>arr</code>:</p>
 
 <ul>
-    <li>A <strong>subarray</strong> is a contiguous <strong>non-empty</strong> sequence of elements within an array.</li>
-    <li>The values of <code>ans[i]</code> are independent for all <code>i</code>&#39;s.</li>
-    <li>The <strong>reverse </strong>of an array is an array containing the values in <strong>reverse order</strong>.</li>
+    <li>Reverse a <span data-keyword="subarray-nonempty"><strong>subarray</strong></span> with size <code>k</code> if the single 1 is not set to a position in <code>banned</code>.</li>
 </ul>
 
+<p>Return an integer array <code>answer</code> with <code>n</code> results where the <code>i<sup>th</sup></code> result is<em> </em>the <strong>minimum</strong> number of operations needed to bring the single 1 to position <code>i</code> in <code>arr</code>, or -1 if it is impossible.</p>
+
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>
 
-<pre>
-<strong>Input:</strong> n = 4, p = 0, banned = [1,2], k = 4
-<strong>Output:</strong> [0,-1,-1,1]
-<strong>Explanation:</strong> In this case k = 4 so there is only one possible reverse operation we can perform, which is reversing the whole array. Initially, 1<strong> </strong>is placed at position 0 so the amount of operations we need for position 0 is 0. We can never place a 1 on the banned positions, so the answer for positions 1 and 2 is -1. Finally, with one reverse operation we can bring the 1 to index 3, so the answer for position 3 is 1. 
-</pre>
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">n = 4, p = 0, banned = [1,2], k = 4</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">[0,-1,-1,1]</span></p>
+
+<p><strong>Explanation:</strong></p>
+
+<ul>
+    <li>Initially 1 is placed at position 0 so the number of operations we need for position 0 is 0.</li>
+    <li>We can never place 1 on the banned positions, so the answer for positions 1 and 2 is -1.</li>
+    <li>Perform the operation of size 4 to reverse the whole array.</li>
+    <li>After a single operation 1 is at position 3 so the answer for position 3 is 1.</li>
+</ul>
+</div>
 
 <p><strong class="example">Example 2:</strong></p>
 
-<pre>
-<strong>Input:</strong> n = 5, p = 0, banned = [2,4], k = 3
-<strong>Output:</strong> [0,-1,-1,-1,-1]
-<strong>Explanation:</strong> In this case the 1 is initially at position 0, so the answer for that position is 0. We can perform reverse operations of size 3. The 1 is currently located at position 0, so we need to reverse the subarray [0, 2] for it to leave that position, but reversing that subarray makes position 2 have a 1, which shouldn&#39;t happen. So, we can&#39;t move the 1 from position 0, making the result for all the other positions -1. 
-</pre>
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">n = 5, p = 0, banned = [2,4], k = 3</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">[0,-1,-1,-1,-1]</span></p>
+
+<p><strong>Explanation:</strong></p>
+
+<ul>
+    <li>Initially 1 is placed at position 0 so the number of operations we need for position 0 is 0.</li>
+    <li>We cannot perform the operation on the subarray positions <code>[0, 2]</code> because position 2 is in banned.</li>
+    <li>Because 1 cannot be set at position 2, it is impossible to set 1 at other positions in more operations.</li>
+</ul>
+</div>
 
 <p><strong class="example">Example 3:</strong></p>
 
-<pre>
-<strong>Input:</strong> n = 4, p = 2, banned = [0,1,3], k = 1
-<strong>Output:</strong> [-1,-1,0,-1]
-<strong>Explanation:</strong> In this case we can only perform reverse operations of size 1.<strong>&nbsp;</strong>So the 1 never changes its position.
-</pre>
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">n = 4, p = 2, banned = [0,1,3], k = 1</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">[-1,-1,0,-1]</span></p>
+
+<p><strong>Explanation:</strong></p>
+
+<p>Perform operations of size 1 and 1 never changes its position.</p>
+</div>
 
 <p>&nbsp;</p>
 <p><strong>Constraints:</strong></p>

en/lc/2660/index.html

@@ -75820,58 +75820,83 @@ <h1 id="2660-determine-the-winner-of-a-bowling-game"><a href="https://leetcode.c
 <h2 id="description">Description</h2>
 <!-- description:start -->
 
-<p>You are given two <strong>0-indexed</strong> integer arrays <code><font face="monospace">player1</font></code> and <code>player2</code>, that represent the number of pins that player 1 and player 2 hit in a bowling game, respectively.</p>
+<p>You are given two <strong>0-indexed</strong> integer arrays <code><font face="monospace">player1</font></code> and <code>player2</code>, representing the number of pins that player 1 and player 2 hit in a bowling game, respectively.</p>
 
-<p>The bowling game consists of <code>n</code> turns, and the number of pins in each turn is exactly <code>10</code>.</p>
+<p>The bowling game consists of <code>n</code> turns, and the number of pins in each turn is exactly 10.</p>
 
-<p>Assume a player hit <code>x<sub>i</sub></code> pins in the <code>i<sup>th</sup></code> turn. The value of the <code>i<sup>th</sup></code> turn for the player is:</p>
+<p>Assume a player hits <code>x<sub>i</sub></code> pins in the i<sup>th</sup> turn. The value of the i<sup>th</sup> turn for the player is:</p>
 
 <ul>
-    <li><code>2x<sub>i</sub></code> if the player hit <code>10</code> pins in any of the previous two turns.</li>
-    <li>Otherwise, It is <code>x<sub>i</sub></code>.</li>
+    <li><code>2x<sub>i</sub></code> if the player hits 10 pins <b>in either (i - 1)<sup>th</sup> or (i - 2)<sup>th</sup> turn</b>.</li>
+    <li>Otherwise, it is <code>x<sub>i</sub></code>.</li>
 </ul>
 
-<p>The score of the player is the sum of the values of their <code>n</code> turns.</p>
+<p>The <strong>score</strong> of the player is the sum of the values of their <code>n</code> turns.</p>
 
 <p>Return</p>
 
 <ul>
-    <li><code>1</code> <em>if the score of player 1 is more than the score of player 2,</em></li>
-    <li><code>2</code> <em>if the score of player 2 is more than the score of player 1, and</em></li>
-    <li><code>0</code> <em>in case of a draw.</em></li>
+    <li>1 if the score of player 1 is more than the score of player 2,</li>
+    <li>2 if the score of player 2 is more than the score of player 1, and</li>
+    <li>0 in case of a draw.</li>
 </ul>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>
 
-<pre>
-<strong>Input:</strong> player1 = [4,10,7,9], player2 = [6,5,2,3]
-<strong>Output:</strong> 1
-<strong>Explanation:</strong> The score of player1 is 4 + 10 + 2*7 + 2*9 = 46.
-The score of player2 is 6 + 5 + 2 + 3 = 16.
-Score of player1 is more than the score of player2, so, player1 is the winner, and the answer is 1.
-</pre>
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">player1 = [5,10,3,2], player2 = [6,5,7,3]</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">1</span></p>
+
+<p><strong>Explanation:</strong></p>
+
+<p>The score of player 1 is 5 + 10 + 2*3 + 2*2 = 25.</p>
+
+<p>The score of player 2 is 6 + 5 + 7 + 3 = 21.</p>
+</div>
 
 <p><strong class="example">Example 2:</strong></p>
 
-<pre>
-<strong>Input:</strong> player1 = [3,5,7,6], player2 = [8,10,10,2]
-<strong>Output:</strong> 2
-<strong>Explanation:</strong> The score of player1 is 3 + 5 + 7 + 6 = 21.
-The score of player2 is 8 + 10 + 2*10 + 2*2 = 42.
-Score of player2 is more than the score of player1, so, player2 is the winner, and the answer is 2.
-</pre>
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">player1 = [3,5,7,6], player2 = [8,10,10,2]</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">2</span></p>
+
+<p><strong>Explanation:</strong></p>
+
+<p>The score of player 1 is 3 + 5 + 7 + 6 = 21.</p>
+
+<p>The score of player 2 is 8 + 10 + 2*10 + 2*2 = 42.</p>
+</div>
 
 <p><strong class="example">Example 3:</strong></p>
 
-<pre>
-<strong>Input:</strong> player1 = [2,3], player2 = [4,1]
-<strong>Output:</strong> 0
-<strong>Explanation:</strong> The score of player1 is 2 + 3 = 5
-The score of player2 is 4 + 1 = 5
-The score of player1 equals to the score of player2, so, there is a draw, and the answer is 0.
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">player1 = [2,3], player2 = [4,1]</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">0</span></p>
 
-</pre>
+<p><strong>Explanation:</strong></p>
+
+<p>The score of player1 is 2 + 3 = 5.</p>
+
+<p>The score of player2 is 4 + 1 = 5.</p>
+</div>
+
+<p><strong class="example">Example 4:</strong></p>
+
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">player1 = [1,1,1,10,10,10,10], player2 = [10,10,10,10,1,1,1]</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">1</span></p>
+
+<p><strong>Explanation:</strong></p>
+
+<p>The score of player1 is 1 + 1 + 1 + 10 + 2*10 + 2*10 + 2*10 = 73.</p>
+
+<p>The score of player2 is 10 + 2*10 + 2*10 + 2*10 + 2*1 + 2*1 + 1 = 75.</p>
+</div>
 
 <p>&nbsp;</p>
 <p><strong>Constraints:</strong></p>