onlyblues

2023年2月11日

摘要： B. Jumbo Extra Cheese 2 Pak Chanek has $n$ two-dimensional slices of cheese. The $i$-th slice of cheese can be represented as a rectangle of dimension 阅读全文

posted @ 2023-02-11 22:06 onlyblues 阅读(60) 评论(0) 推荐(0)

D. Moving Dots

摘要： D. Moving Dots We play a game with $n$ dots on a number line. The initial coordinate of the $i$-th dot is $x_i$. These coordinates are distinct. Every 阅读全文

posted @ 2023-02-11 21:13 onlyblues 阅读(102) 评论(0) 推荐(0)

B. Sum of Two Numbers

摘要： B. Sum of Two Numbers The sum of digits of a non-negative integer $a$ is the result of summing up its digits together when written in the decimal syst 阅读全文

posted @ 2023-02-11 13:10 onlyblues 阅读(259) 评论(1) 推荐(1)

2023年2月10日

E. Sum Over Zero

摘要： E. Sum Over Zero You are given an array $a_1, a_2, \ldots, a_n$ of $n$ integers. Consider $S$ as a set of segments satisfying the following conditions 阅读全文

posted @ 2023-02-10 20:54 onlyblues 阅读(122) 评论(0) 推荐(1)

2023年2月9日

D. Lucky Permutation

摘要： D. Lucky Permutation You are given a permutation$^\dagger$ $p$ of length $n$. In one operation, you can choose two indices $1 \le i < j \le n$ and swa 阅读全文

posted @ 2023-02-09 19:13 onlyblues 阅读(91) 评论(0) 推荐(0)

2023年2月7日

E. Monsters (hard version)

摘要： E. Monsters (hard version) This is the hard version of the problem. In this version, you need to find the answer for every prefix of the monster array 阅读全文

posted @ 2023-02-07 22:00 onlyblues 阅读(201) 评论(0) 推荐(0)

2023年2月5日

Disconnect Path in a Binary Matrix by at Most One Flip

摘要： Disconnect Path in a Binary Matrix by at Most One Flip You are given a 0-indexed $m \times n$ binary matrix grid . You can move from a cell (row, col) 阅读全文

posted @ 2023-02-05 18:16 onlyblues 阅读(89) 评论(0) 推荐(0)

Maximize Win From Two Segments

摘要： Maximize Win From Two Segments There are some prizes on the X-axis. You are given an integer array prizePositions that is sorted in non-decreasing ord 阅读全文

posted @ 2023-02-05 16:08 onlyblues 阅读(37) 评论(0) 推荐(0)

2023年2月4日

G2. Teleporters (Hard Version)

摘要： G2. Teleporters (Hard Version) The only difference between the easy and hard versions are the locations you can teleport to. Consider the points $0,1, 阅读全文

posted @ 2023-02-04 21:56 onlyblues 阅读(201) 评论(0) 推荐(0)

E. Negatives and Positives

摘要： E. Negatives and Positives Given an array $a$ consisting of $n$ elements, find the maximum possible sum the array can have after performing the follow 阅读全文

posted @ 2023-02-04 15:56 onlyblues 阅读(88) 评论(0) 推荐(0)

公告