A14468 | Array Stabilization (AND version)
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
You are given an array $a[0 \ldots n - 1] = [a_0, a_1, \ldots, a_{n - 1}]$ of zeroes and ones only. Note that in this problem, unlike the others, the array indexes are numbered from zero, not from one.
In one step, the array $a$ is replaced by another array of length $n$ according to the following rules:
1. First, a new array $a^{\rightarrow d}$ is defined as a cyclic shift of the array $a$ to the right by $d$ cells. The elements of this array can be defined as $a^{\rightarrow d}_i = a_{(i + n - d) \bmod n}$ , where $(i + n - d) \bmod n$ is the remainder of integer division of $i + n - d$ by $n$ . It means that the whole array $a^{\rightarrow d}$ can be represented as a sequence $$$$a^{\rightarrow d} = [a_{n - d}, a_{n - d + 1}, \ldots, a_{n - 1}, a_0, a_1, \ldots, a_{n - d - 1}] $$ </p><p> </p></li><li> Then each element of the array $a\_i$ is replaced by $a\_i \\,\\&\\, a^{\\rightarrow d}\_i$ , where $\\&$ is a logical "AND" operator. </li></ol><p>For example, if $a = \[0, 0, 1, 1\]$ and $d = 1$ , then $a^{\\rightarrow d} = \[1, 0, 0, 1\]$ and the value of $a$ after the first step will be $\[0 \\,\\&\\, 1, 0 \\,\\&\\, 0, 1 \\,\\&\\, 0, 1 \\,\\&\\, 1\]$ , that is $\[0, 0, 0, 1\]$ .</p><p>The process ends when the array stops changing. For a given array $a$$$, determine whether it will consist of only zeros at the end of the process. If yes, also find the number of steps the process will take before it finishes.
In one step, the array $a$ is replaced by another array of length $n$ according to the following rules:
1. First, a new array $a^{\rightarrow d}$ is defined as a cyclic shift of the array $a$ to the right by $d$ cells. The elements of this array can be defined as $a^{\rightarrow d}_i = a_{(i + n - d) \bmod n}$ , where $(i + n - d) \bmod n$ is the remainder of integer division of $i + n - d$ by $n$ . It means that the whole array $a^{\rightarrow d}$ can be represented as a sequence $$$$a^{\rightarrow d} = [a_{n - d}, a_{n - d + 1}, \ldots, a_{n - 1}, a_0, a_1, \ldots, a_{n - d - 1}] $$ </p><p> </p></li><li> Then each element of the array $a\_i$ is replaced by $a\_i \\,\\&\\, a^{\\rightarrow d}\_i$ , where $\\&$ is a logical "AND" operator. </li></ol><p>For example, if $a = \[0, 0, 1, 1\]$ and $d = 1$ , then $a^{\\rightarrow d} = \[1, 0, 0, 1\]$ and the value of $a$ after the first step will be $\[0 \\,\\&\\, 1, 0 \\,\\&\\, 0, 1 \\,\\&\\, 0, 1 \\,\\&\\, 1\]$ , that is $\[0, 0, 0, 1\]$ .</p><p>The process ends when the array stops changing. For a given array $a$$$, determine whether it will consist of only zeros at the end of the process. If yes, also find the number of steps the process will take before it finishes.
输入格式
The first line contains an integer $t$ ( $1 \leq t \leq 1000$ ) — the number of test cases.
The next $2t$ lines contain descriptions of the test cases.
The first line of each test case description contains two integers: $n$ ( $1 \le n \le 10^6$ ) — array size and $d$ ( $1 \le d \le n$ ) — cyclic shift offset. The second line of the description contains $n$ space-separated integers $a_i$ ( $0 \le a_i \le 1$ ) — elements of the array.
It is guaranteed that the sum of $n$ over all test cases does not exceed $10^6$ .
The next $2t$ lines contain descriptions of the test cases.
The first line of each test case description contains two integers: $n$ ( $1 \le n \le 10^6$ ) — array size and $d$ ( $1 \le d \le n$ ) — cyclic shift offset. The second line of the description contains $n$ space-separated integers $a_i$ ( $0 \le a_i \le 1$ ) — elements of the array.
It is guaranteed that the sum of $n$ over all test cases does not exceed $10^6$ .
输出格式
Print $t$ lines, each line containing the answer to the corresponding test case. The answer to a test case should be a single integer — the number of steps after which the array will contain only zeros for the first time. If there are still elements equal to $1$ in the array after the end of the process, print -1.
输入输出样例
输入 #1
5 2 1 0 1 3 2 0 1 0 5 2 1 1 0 1 0 4 2 0 1 0 1 1 1 0
输出 #1
1 1 3 -1 0
In the third sample test case the array will change as follows:
1. At the beginning $a = [1, 1, 0, 1, 0]$ , and $a^{\rightarrow 2} = [1, 0, 1, 1, 0]$ . Their element-by-element "AND" is equal to $$$$[1 \,\&\, 1, 1 \,\&\, 0, 0 \,\&\, 1, 1 \,\&\, 1, 0 \,\&\, 0] = [1, 0, 0, 1, 0] $$ </li><li> Now $a = \[1, 0, 0, 1, 0\]$ , then $a^{\\rightarrow 2} = \[1, 0, 1, 0, 0\]$ . Their element-by-element "AND" equals to $$ [1 \,\&\, 1, 0 \,\&\, 0, 0 \,\&\, 1, 1 \,\&\, 0, 0 \,\&\, 0] = [1, 0, 0, 0, 0] $$ </li><li> And finally, when $a = \[1, 0, 0, 0, 0\]$ we get $a^{\\rightarrow 2} = \[0, 0, 1, 0, 0\]$ . Their element-by-element "AND" equals to $$ [1 \,\&\, 0, 0 \,\&\, 0, 0 \,\&\, 1, 0 \,\&\, 0, 0 \,\&\, 0] = [0, 0, 0, 0, 0] $$ </li></ol> Thus, the answer is $3$ steps.<p>In the fourth sample test case, the array will not change as it shifts by $2$ to the right, so each element will be calculated as $0 \\,\\&\\, 0$ or $1 \\,\\&\\, 1$$$ thus not changing its value. So the answer is -1, the array will never contain only zeros.
1. At the beginning $a = [1, 1, 0, 1, 0]$ , and $a^{\rightarrow 2} = [1, 0, 1, 1, 0]$ . Their element-by-element "AND" is equal to $$$$[1 \,\&\, 1, 1 \,\&\, 0, 0 \,\&\, 1, 1 \,\&\, 1, 0 \,\&\, 0] = [1, 0, 0, 1, 0] $$ </li><li> Now $a = \[1, 0, 0, 1, 0\]$ , then $a^{\\rightarrow 2} = \[1, 0, 1, 0, 0\]$ . Their element-by-element "AND" equals to $$ [1 \,\&\, 1, 0 \,\&\, 0, 0 \,\&\, 1, 1 \,\&\, 0, 0 \,\&\, 0] = [1, 0, 0, 0, 0] $$ </li><li> And finally, when $a = \[1, 0, 0, 0, 0\]$ we get $a^{\\rightarrow 2} = \[0, 0, 1, 0, 0\]$ . Their element-by-element "AND" equals to $$ [1 \,\&\, 0, 0 \,\&\, 0, 0 \,\&\, 1, 0 \,\&\, 0, 0 \,\&\, 0] = [0, 0, 0, 0, 0] $$ </li></ol> Thus, the answer is $3$ steps.<p>In the fourth sample test case, the array will not change as it shifts by $2$ to the right, so each element will be calculated as $0 \\,\\&\\, 0$ or $1 \\,\\&\\, 1$$$ thus not changing its value. So the answer is -1, the array will never contain only zeros.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted