Codeforces Round 929 (Div. 3) A B C D E

A. Turtle Puzzle: Rearrange and Negate

time limit per test: 2 second memory limit per test: 256 megabytes input: standard input output: standard output

You are given an array $a$ of $n$ integers. You must perform the following two operations on the array (the first, then the second):

1. Arbitrarily rearrange the elements of the array or leave the order of its elements unchanged.
2. Choose at most one contiguous segment of elements and replace the signs of all elements in this segment with their opposites. Formally, you can choose a pair of indices $l,r$ such that $1\le l\le r\le n$ and assign $a_i=-a_i$ for all $l\le i\le r$ (negate elements). Note that you may choose not to select a pair of indices and leave all the signs of the elements unchanged.

What is the maximum sum of the array elements after performing these two operations (the first, then the second)?

Input

The first line of the input contains a single integer $t$ ($1\le t\le 1000$) — the number of test cases. The descriptions of the test cases follow.

The first line of each test case contains a single integer $n$ ($1\le n\le 50$) — the number of elements in array $a$.

The second line of each test case contains $n$ integers $a_1,a_2,\dots ,a_n$ ($-100\le a_i\le 100$) — elements of the array.

Output

For each test case, output the maximum sum of the array elements after sequentially performing the two given operations.

Example

input

8
3
-2 3 -3
1
0
2
0 1
1
-99
4
10 -2 -3 7
5
-1 -2 -3 -4 -5
6
-41 22 -69 73 -15 -50
12
1 2 3 4 5 6 7 8 9 10 11 12

output

8
0
1
99
22
15
270
78

Tutorial

输出所有元素的绝对值之和，即 ${\sum }_{i=0}^{i=n}|a_i|$

Solution

for _ in range(int(input())):
    input()
    a = list(map(int, input().split()))
    print(sum(abs(ai) for ai in a))

---

B. Turtle Math: Fast Three Task

time limit per test: 2 second memory limit per test: 256 megabytes input: standard input output: standard output

You are given an array $a_1,a_2,\dots ,a_n$.

In one move, you can perform either of the following two operations:

• Choose an element from the array and remove it from the array. As a result, the length of the array decreases by $1$;
• Choose an element from the array and increase its value by $1$.

You can perform any number of moves. If the current array becomes empty, then no more moves can be made.

Your task is to find the minimum number of moves required to make the sum of the elements of the array $a$ divisible by $3$. It is possible that you may need $0$ moves.

Note that the sum of the elements of an empty array (an array of length $0$) is equal to $0$.

Input

The first line of the input contains a single integer $t$ ($1\le t\le 10^4$) — the number of test cases.

The first line of each test case contains a single integer $n$ ($1\le n\le 10^5$).

The second line of each test case contains $n$ integers $a_1,a_2,\dots ,a_n$ ($1\le a_i\le 10^4$).

The sum of $n$ over all test cases does not exceed $2\cdot 10^5$.

Output

For each test case, output a single integer: the minimum number of moves.

Example

input

8
4
2 2 5 4
3
1 3 2
4
3 7 6 8
1
1
4
2 2 4 2
2
5 5
7
2 4 8 1 9 3 4
2
4 10

output

1
0
0
1
1
2
1
1

Note

In the first test case, initially the array $a=[2,2,5,4]$. One of the optimal ways to make moves is:

• remove the current $4$th element and get $a=[2,2,5]$;

As a result, the sum of the elements of the array $a$ will be divisible by $3$ (indeed, $a_1+a_2+a_3=2+2+5=9$).

In the second test case, initially, the sum of the array is $1+3+2=6$, which is divisible by $3$. Therefore, no moves are required. Hence, the answer is $0$.

In the fourth test case, initially, the sum of the array is $1$, which is not divisible by $3$. By removing its only element, you will get an empty array, so its sum is $0$. Hence, the answer is $1$.

Tutorial

• 如果对 3 取余等于 0，则需要 0 次操作
• 如果对 3 取余等于 2，则需要 1 次添加操作即可
• 如果对 3 取余等于 1：
  • 若数组中有一个元素对 3 取余等于 1，删除这个元素即可
  • 否则做两次添加操作

Solution

for _ in range(int(input())):
    n = int(input())
    a = list(map(int, input().split()))
    ans = (3 - sum(a) % 3) % 3
    for ai in a:
        if ai % 3 == 3 - ans:
            ans = min(ans, 1)
    print(ans)

---

C. Turtle Fingers: Count the Values of k

time limit per test: 5 second memory limit per test: 256 megabytes input: standard input output: standard output

You are given three positive integers $a$, $b$ and $l$ ($a,b,l>0$).

It can be shown that there always exists a way to choose non-negative (i.e. $\ge 0$) integers $k$, $x$, and $y$ such that $l=k\cdot a^x\cdot b^y$.

Your task is to find the number of distinct possible values of $k$ across all such ways.

Input

The first line contains the integer $t$ ($1\le t\le 10^4$) — the number of test cases.

The following $t$ lines contain three integers, $a$, $b$ and $l$ ($2\le a,b\le 100$, $1\le l\le 10^6$) — description of a test case.

Output

Output $t$ lines, with the $i$-th ($1\le i\le t$) line containing an integer, the answer to the $i$-th test case.

Example

input

11
2 5 20
2 5 21
4 6 48
2 3 72
3 5 75
2 2 1024
3 7 83349
100 100 1000000
7 3 2
2 6 6
17 3 632043

output

6
1
5
12
6
11
24
4
1
3
24

Note

In the first test case, $a=2,b=5,l=20$. The possible values of $k$ (and corresponding $x,y$) are as follows:

• Choose $k=1,x=2,y=1$. Then $k\cdot a^x\cdot b^y=1\cdot 2^2\cdot 5^1=20=l$.
• Choose $k=2,x=1,y=1$. Then $k\cdot a^x\cdot b^y=2\cdot 2^1\cdot 5^1=20=l$.
• Choose $k=4,x=0,y=1$. Then $k\cdot a^x\cdot b^y=4\cdot 2^0\cdot 5^1=20=l$.
• Choose $k=5,x=2,y=0$. Then $k\cdot a^x\cdot b^y=5\cdot 2^2\cdot 5^0=20=l$.
• Choose $k=10,x=1,y=0$. Then $k\cdot a^x\cdot b^y=10\cdot 2^1\cdot 5^0=20=l$.
• Choose $k=20,x=0,y=0$. Then $k\cdot a^x\cdot b^y=20\cdot 2^0\cdot 5^0=20=l$.

In the second test case, $a=2,b=5,l=21$. Note that $l=21$ is not divisible by either $a=2$ or $b=5$. Therefore, we can only set $x=0,y=0$, which corresponds to $k=21$.

In the third test case, $a=4,b=6,l=48$. The possible values of $k$ (and corresponding $x,y$) are as follows:

• Choose $k=2,x=1,y=1$. Then $k\cdot a^x\cdot b^y=2\cdot 4^1\cdot 6^1=48=l$.
• Choose $k=3,x=2,y=0$. Then $k\cdot a^x\cdot b^y=3\cdot 4^2\cdot 6^0=48=l$.
• Choose $k=8,x=0,y=1$. Then $k\cdot a^x\cdot b^y=8\cdot 4^0\cdot 6^1=48=l$.
• Choose $k=12,x=1,y=0$. Then $k\cdot a^x\cdot b^y=12\cdot 4^1\cdot 6^0=48=l$.
• Choose $k=48,x=0,y=0$. Then $k\cdot a^x\cdot b^y=48\cdot 4^0\cdot 6^0=48=l$.

Tutorial

暴力枚举 $x$ 和 $y$，如果满足题意，则将 $\frac{l}{a^x\times b^y}$ 添加到 $set$ 中，最后输出 $set$ 的容器大小

Solution

for _ in range(int(input())):
    a, b, l = map(int, input().split())
    s = set()
    cnt1 = 1
    for x in range(l):
        if cnt1 > l:
            break
        if not l % cnt1:
            mid, cnt2 = l // cnt1, 1
            for y in range(l):
                if cnt2 > mid:
                    break
                if not mid % cnt2:
                    s.add(mid // cnt2)
                cnt2 *= b
        cnt1 *= a
    print(len(s))

---

D. Turtle Tenacity: Continual Mods

time limit per test: 2 second memory limit per test: 256 megabytes input: standard input output: standard output

Given an array $a_1,a_2,\dots ,a_n$, determine whether it is possible to rearrange its elements into $b_1,b_2,\dots ,b_n$, such that $b_1\mathrm{mod}{b}_2\mathrm{mod}\dots \mathrm{mod}{b}_n\ne 0$.

Here $x\mathrm{mod}y$ denotes the remainder from dividing $x$ by $y$. Also, the modulo operations are calculated from left to right. That is, $x\mathrm{mod}y\mathrm{mod}z=(x\mathrm{mod}y)\mathrm{mod}z$. For example, $2024\mathrm{mod}1000\mathrm{mod}8=(2024\mathrm{mod}1000)\mathrm{mod}8=24\mathrm{mod}8=0$.

Input

The first line of the input contains a single integer $t$ ($1\le t\le 10^4$) — the number of test cases.

The first line of each test case contains a single integer $n$ ($2\le n\le 10^5$).

The second line of each test case contains $n$ integers $a_1,a_2,\dots ,a_n$ ($1\le a_i\le 10^9$).

The sum of $n$ over all test cases does not exceed $2\cdot 10^5$.

Output

For each test case, output “YES” if it is possible, “NO” otherwise.

You can output the answer in any case (upper or lower). For example, the strings “yEs”, “yes”, “Yes”, and “YES” will be recognized as positive responses.

Example

input

8
6
1 2 3 4 5 6
5
3 3 3 3 3
3
2 2 3
5
1 1 2 3 7
3
1 2 2
3
1 1 2
6
5 2 10 10 10 2
4
3 6 9 3

output

YES
NO
YES
NO
YES
NO
YES
NO

Note

In the first test case, rearranging the array into $b=[1,2,3,4,5,6]$ (doing nothing) would result in $1\mathrm{mod}2\mathrm{mod}3\mathrm{mod}4\mathrm{mod}5\mathrm{mod}6=1$. Hence it is possible to achieve the goal.

In the second test case, the array $b$ must be equal to $[3,3,3,3,3]$, which would result in $3\mathrm{mod}3\mathrm{mod}3\mathrm{mod}3\mathrm{mod}3=0$. Hence it is impossible to achieve the goal.

In the third test case, rearranging the array into $b=[3,2,2]$ would result in $3\mathrm{mod}2\mathrm{mod}2=1$. Hence it is possible to achieve the goal.

Tutorial

需要构建出唯一的一个最小值，如果数组的最小值已经唯一，则拿这个最小值去对其他所有数取余，否则用其他数对当前最小值取余，如果能找到比当前最小值小的数，则输出 YES，否则输出 NO

Solution

for _ in range(int(input())):
    n = int(input())
    a = sorted(list(map(int, input().split())))
    ans = "NO"
    if a[0] < a[1]:
        ans = "YES"
    for ai in a[2:]:
        if ai % a[0] and ai % a[0] < a[0]:
            ans = "YES"
            break
    print(ans)

---

E. Turtle vs. Rabbit Race: Optimal Trainings

time limit per test: 5 second memory limit per test: 256 megabytes input: standard input output: standard output

Isaac begins his training. There are $n$ running tracks available, and the $i$-th track ($1\le i\le n$) consists of $a_i$ equal-length sections.

Given an integer $u$ ($1\le u\le 10^9$), finishing each section can increase Isaac’s ability by a certain value, described as follows:

• Finishing the $1$-st section increases Isaac’s performance by $u$.
• Finishing the $2$-nd section increases Isaac’s performance by $u-1$.
• Finishing the $3$-rd section increases Isaac’s performance by $u-2$.
• $\dots$
• Finishing the $k$-th section ($k\ge 1$) increases Isaac’s performance by $u+1-k$. (The value $u+1-k$ can be negative, which means finishing an extra section decreases Isaac’s performance.)

You are also given an integer $l$. You must choose an integer $r$ such that $l\le r\le n$ and Isaac will finish each section of each track $l,l+1,\dots ,r$ (that is, a total of ${\sum }_{i=l}^r{a}_i=a_l+a_{l+1}+\dots +a_r$ sections).

Answer the following question: what is the optimal $r$ you can choose that the increase in Isaac’s performance is maximum possible?

If there are multiple $r$ that maximize the increase in Isaac’s performance, output the smallest $r$.

To increase the difficulty, you need to answer the question for $q$ different values of $l$ and $u$.

Input

The first line of input contains a single integer $t$ ($1\le t\le 10^4$) — the number of test cases.

The descriptions of the test cases follow.

The first line contains a single integer $n$ ($1\le n\le 10^5$).

The second line contains $n$ integers $a_1,a_2,\dots ,a_n$ ($1\le a_i\le 10^4$).

The third line contains a single integer $q$ ($1\le q\le 10^5$).

The next $q$ lines each contain two integers $l$ and $u$ ($1\le l\le n,1\le u\le 10^9$) — the descriptions to each query.

The sum of $n$ over all test cases does not exceed $2\cdot 10^5$. The sum of $q$ over all test cases does not exceed $2\cdot 10^5$.

Output

For each test case, output $q$ integers: the $i$-th integer contains the optimal $r$ for the $i$-th query. If there are multiple solutions, output the smallest one.

Example

input

5
6
3 1 4 1 5 9
3
1 8
2 7
5 9
1
10
1
1 1
9
5 10 9 6 8 3 10 7 3
5
8 56
1 12
9 3
1 27
5 45
5
7 9 2 5 2
10
1 37
2 9
3 33
4 32
4 15
2 2
4 2
2 19
3 7
2 7
10
9 1 6 7 6 3 10 7 3 10
5
10 43
3 23
9 3
6 8
5 14

output

3 4 5 
1 
9 2 9 4 9 
5 2 5 5 5 2 4 5 4 2 
10 6 9 7 7 

Note

For the $1$-st query in the first test case:

• By choosing $r=3$, Isaac finishes $a_1+a_2+a_3=3+1+4=8$ sections in total, hence his increase in performance is $u+(u-1)+\dots +(u-7)=8+7+6+5+4+3+2+1=36$.
• By choosing $r=4$, Isaac finishes $a_1+a_2+a_3+a_4=3+1+4+1=9$ sections in total, hence his increase in performance is $u+(u-1)+\dots +(u-8)=8+7+6+5+4+3+2+1+0=36$.

Both choices yield the optimal increase in performance, however we want to choose the smallest $r$. So we choose $r=3$.

For the $2$-nd query in the first test case, by choosing $r=4$, Isaac finishes $a_2+a_3+a_4=1+4+1=6$ sections in total, hence his increase in performance is $u+(u-1)+\dots +(u-5)=7+6+5+4+3+2=27$. This is the optimal increase in performance.

For the $3$-rd query in the first test case:

• By choosing $r=5$, Isaac finishes $a_5=5$ sections in total, hence his increase in performance is $u+(u-1)+\dots +(u-4)=9+8+7+6+5=35$.
• By choosing $r=6$, Isaac finishes $a_5+a_6=5+9=14$ sections in total, hence his increase in performance is $u+(u-1)+\dots +(u-13)=9+8+7+6+5+4+3+2+1+0+(-1)+(-2)+(-3)+(-4)=35$.

Both choices yield the optimal increase in performance, however we want to choose the smallest $r$. So we choose $r=5$.

Hence the output for the first test case is $[3,4,5]$.

Tutorial

二分答案到最接近 $u$ 的区间即可，此时右边界的左右两个值都有可能成为答案，所以需要对右边界两边求出可以提高的能力，然后比较得到可以获得能力最大的位置

Solution

def check(sum1, sum2, u):
    return sum1 * u - (sum1 - 1) * sum1 // 2 > sum2 * u - (sum2 - 1) * sum2 // 2

for _ in range(int(input())):
    n = int(input())
    pre = [0] + list(map(int, input().split()))
    for i in range(1, n + 1):
        pre[i] += pre[i - 1]

    ans = []
    for __ in range(int(input())):
        l, u = map(int, input().split())
        left, right = l, n + 1
        while left + 1 < right:
            mid = (left + right) >> 1
            if check(pre[mid] - pre[l - 1], pre[mid - 1] - pre[l - 1], u):
                left = mid
            else:
                right = mid
        ans.append(left)
    print(*ans)

---

F. Turtle Mission: Robot and the Earthquake

time limit per test: 3 second memory limit per test: 256 megabytes input: standard input output: standard output

The world is a grid with $n$ rows and $m$ columns. The rows are numbered $0,1,\dots ,n-1$, while the columns are numbered $0,1,\dots ,m-1$. In this world, the columns are cyclic (i.e. the top and the bottom cells in each column are adjacent). The cell on the $i$-th row and the $j$-th column ($0\le i<n,0\le j<m$) is denoted as $(i,j)$.

At time $0$, the cell $(i,j)$ (where $0\le i<n,0\le j<m$) contains either a rock or nothing. The state of cell $(i,j)$ can be described using the integer $a_{i,j}$:

• If $a_{i,j}=1$, there is a rock at $(i,j)$.
• If $a_{i,j}=0$, there is nothing at $(i,j)$.

As a result of aftershocks from the earthquake, the columns follow tectonic plate movements: each column moves cyclically upwards at a velocity of $1$ cell per unit of time. Formally, for some $0\le i<n,0\le j<m$, if $(i,j)$ contains a rock at the moment, it will move from $(i,j)$ to $(i-1,j)$ (or to $(n-1,j)$ if $i=0$).

The robot called RT is initially positioned at $(0,0)$. It has to go to $(n-1,m-1)$ to carry out an earthquake rescue operation (to the bottom rightmost cell). The earthquake doesn’t change the position of the robot, they only change the position of rocks in the world.

Let RT’s current position be $(x,y)$ ($0\le x<n,0\le y<m$), it can perform the following operations:

• Go one cell cyclically upwards, i.e. from $(x,y)$ to $((x+n-1)\mathrm{mod}n,y)$ using $1$ unit of time.
• Go one cell cyclically downwards, i.e. $(x,y)$ to $((x+1)\mathrm{mod}n,y)$ using $1$ unit of time.
• Go one cell to the right, i.e. $(x,y)$ to $(x,y+1)$ using $1$ unit of time. (RT may perform this operation only if $y<m-1$.)

Note that RT cannot go left using the operations nor can he stay at a position.

Unfortunately, RT will explode upon colliding with a rock. As such, when RT is at $(x,y)$ and there is a rock at $((x+1)\mathrm{mod}n,y)$ or $((x+2)\mathrm{mod}n,y)$, RT cannot move down or it will be hit by the rock.

[外链图片转存中…(img-t9DlryzV-1709186980888)]

Similarly, if $y+1<m$ and there is a rock at $((x+1)\mathrm{mod}n,y+1)$, RT cannot move right or it will be hit by the rock.

[外链图片转存中…(img-lf4NvjMn-1709186980889)]

However, it is worth noting that if there is a rock at $(x\mathrm{mod}n,y+1)$ and $((x+1)\mathrm{mod}n,y)$, RT can still move right safely.

Find the minimum amount of time RT needs to reach $(n-1,m-1)$ without colliding with any rocks. If it is impossible to do so, output $-1$.

Input

The first line of the input contains one integer $t$ ($1\le t\le 10^4$) — the number of test cases.

In each test case, the first line contains two integers $n$, $m$ ($3\le n,m\le 10^3$) — the size of the planet’s boundaries.

Each of the next $n$ lines contains $m$ integers. The $(j+1)$-th integer on the $(i+1)$-th line ($0\le i<n,0\le j<m$) is $a_{i,j}$ ($0\le a_{i,j}\le 1$), which denotes whether or not there is a rock at $(i,j)$ at time $0$.

Additionally, it is guaranteed that $a_{0,0}=0$, and $a_{i,m-1}=0$ for $0\le i<n$. In other words, there is no rock at RT’s initial position as well as column $m-1$.

The sum of $n\cdot m$ over all test cases does not exceed $10^6$.

Output

For each test case:

• If the destination can be reached without colliding with any rocks, output a single integer — the minimum amount of time RT needs to reach $(n-1,m-1)$.
• Otherwise, output $-1$.

Example

input

12
4 5
0 1 0 0 0
0 0 1 0 0
1 0 1 1 0
0 0 0 0 0
3 3
0 0 0
1 0 0
0 0 0
5 3
0 0 0
0 0 0
1 0 0
0 0 0
1 0 0
3 7
0 0 1 0 0 1 0
1 0 1 0 1 0 0
0 1 0 0 0 0 0
3 4
0 1 0 0
1 0 0 0
0 1 1 0
5 5
0 0 0 0 0
0 1 0 1 0
0 1 0 1 0
0 1 0 1 0
0 0 0 1 0
3 3
0 0 0
0 0 0
0 0 0
4 3
0 1 0
1 0 0
0 1 0
1 0 0
4 3
0 1 0
0 1 0
0 1 0
0 1 0
3 3
0 0 0
1 1 0
0 0 0
3 3
0 1 0
0 0 0
0 1 0
5 5
0 0 0 0 0
0 1 1 0 0
0 1 1 0 0
0 0 0 0 0
0 0 1 0 0

output

7
3
3
8
-1
12
3
3
-1
-1
3
8

Note

Visual explanation of the first test case in the example:

Tutorial

本题可以用 $bfs$ 解决

如果把机器人相对于终点进行 $bfs$，由于一个图的石头有很多，每次计算石头在哪较为复杂，所以可以把机器人相对于石头进行 $bfs$​，此时机器人向上移动变成了静止不动，向下移动变成了移动两格，向右移动变成了向右移动一格，向左移动一格

由于最后一列和起点都是没有石头的，所以可以直接跑到终点列，再跑到终点，所以需要找到跑到相对于 $END$ 的相对位置需要多少步，再看需要多少步跑到 $END$

Solution

#include <bits/stdc++.h>
using namespace std;

#define endl '\n'
#define int long long
#define PII pair<int, int>

const int INF = 0x3f3f3f3f;

void solve() {
    int n, m, ans = INF;
    cin >> n >> m;
    // dist[i][j] 为相对棋盘初始状态 [i][j] 的位置所要的步数
    vector g(n, vector<int>(m)), dist(n, vector<int>(m, INF));
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            cin >> g[i][j];
        }
    }

    queue<PII> q;
    q.emplace(0, 0);
    dist[0][0] = 0;
    while (q.size()) {
        auto [x, y] = q.front();
        q.pop();
        // 向上移动没有意义
        // 向下移动一格相当于相对向下移动两格
        if (not g[(x + 1) % n][y] and not g[(x + 2) % n][y] and dist[(x + 2) % n][y] > dist[x][y] + 1) {
            q.emplace((x + 2) % n, y);
            dist[(x + 2) % n][y] = dist[x][y] + 1;
        }
        // 不能向左移动
        // 向右移动一格相当于相对向下移动一格、向右移动一格
        if (y + 1 < m and not g[(x + 1) % n][y + 1] and dist[(x + 1) % n][y + 1] > dist[x][y] + 1) {
            q.emplace((x + 1) % n, y + 1);
            dist[(x + 1) % n][y + 1] = dist[x][y] + 1;
        }
    }

    // 最后一列都没有石头，所以只需要走到最后一列，必定可以走到终点
    for (int i = 0; i < n; ++i) {
        int idx = (dist[i][m - 1] + n - 1) % n; // 相对于 END 的列位置
        ans = min(ans, dist[i][m - 1] + min(abs(idx - i), n - abs(idx - i)));
    }
    cout << (ans == INF ? -1 : ans) << endl;
}

signed main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    cout << fixed << setprecision(15);
    int Test; cin >> Test; while (Test--)
    solve();
    return 0;
}

---