A14156 | New Colony
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
After reaching your destination, you want to build a new colony on the new planet. Since this planet has many mountains and the colony must be built on a flat surface you decided to flatten the mountains using boulders (you are still dreaming so this makes sense to you).
You are given an array $h_1, h_2, \dots, h_n$ , where $h_i$ is the height of the $i$ -th mountain, and $k$ — the number of boulders you have.
You will start throwing boulders from the top of the first mountain one by one and they will roll as follows (let's assume that the height of the current mountain is $h_i$ ):
- if $h_i \ge h_{i + 1}$ , the boulder will roll to the next mountain;
- if $h_i < h_{i + 1}$ , the boulder will stop rolling and increase the mountain height by $1$ ( $h_i = h_i + 1$ );
- if the boulder reaches the last mountain it will fall to the waste collection system and disappear.
You want to find the position of the $k$ -th boulder or determine that it will fall into the waste collection system.
You are given an array $h_1, h_2, \dots, h_n$ , where $h_i$ is the height of the $i$ -th mountain, and $k$ — the number of boulders you have.
You will start throwing boulders from the top of the first mountain one by one and they will roll as follows (let's assume that the height of the current mountain is $h_i$ ):
- if $h_i \ge h_{i + 1}$ , the boulder will roll to the next mountain;
- if $h_i < h_{i + 1}$ , the boulder will stop rolling and increase the mountain height by $1$ ( $h_i = h_i + 1$ );
- if the boulder reaches the last mountain it will fall to the waste collection system and disappear.
You want to find the position of the $k$ -th boulder or determine that it will fall into the waste collection system.
输入格式
The first line contains a single integer $t$ ( $1 \le t \le 100$ ) — the number of test cases.
Each test case consists of two lines. The first line in each test case contains two integers $n$ and $k$ ( $1 \le n \le 100$ ; $1 \le k \le 10^9$ ) — the number of mountains and the number of boulders.
The second line contains $n$ integers $h_1, h_2, \dots, h_n$ ( $1 \le h_i \le 100$ ) — the height of the mountains.
It is guaranteed that the sum of $n$ over all test cases does not exceed $100$ .
Each test case consists of two lines. The first line in each test case contains two integers $n$ and $k$ ( $1 \le n \le 100$ ; $1 \le k \le 10^9$ ) — the number of mountains and the number of boulders.
The second line contains $n$ integers $h_1, h_2, \dots, h_n$ ( $1 \le h_i \le 100$ ) — the height of the mountains.
It is guaranteed that the sum of $n$ over all test cases does not exceed $100$ .
输出格式
For each test case, print $-1$ if the $k$ -th boulder will fall into the collection system. Otherwise, print the position of the $k$ -th boulder.
输入输出样例
输入 #1
4 4 3 4 1 2 3 2 7 1 8 4 5 4 1 2 3 3 1 5 3 1
输出 #1
2 1 -1 -1
Let's simulate the first case:
- The first boulder starts at $i = 1$ ; since $h_1 \ge h_2$ it rolls to $i = 2$ and stops there because $h_2 < h_3$ .
- The new heights are $[4,2,2,3]$ .
- The second boulder starts at $i = 1$ ; since $h_1 \ge h_2$ the boulder rolls to $i = 2$ ; since $h_2 \ge h_3$ the boulder rolls to $i = 3$ and stops there because $h_3 < h_4$ .
- The new heights are $[4,2,3,3]$ .
- The third boulder starts at $i = 1$ ; since $h_1 \ge h_2$ it rolls to $i = 2$ and stops there because $h_2 < h_3$ .
- The new heights are $[4,3,3,3]$ .
The positions where each boulder stopped are the following: $[2,3,2]$ .
In the second case, all $7$ boulders will stop right at the first mountain rising its height from $1$ to $8$ .
The third case is similar to the first one but now you'll throw $5$ boulders. The first three will roll in the same way as in the first test case. After that, mountain heights will be equal to $[4, 3, 3, 3]$ , that's why the other two boulders will fall into the collection system.
In the fourth case, the first and only boulders will fall straight into the collection system.
- The first boulder starts at $i = 1$ ; since $h_1 \ge h_2$ it rolls to $i = 2$ and stops there because $h_2 < h_3$ .
- The new heights are $[4,2,2,3]$ .
- The second boulder starts at $i = 1$ ; since $h_1 \ge h_2$ the boulder rolls to $i = 2$ ; since $h_2 \ge h_3$ the boulder rolls to $i = 3$ and stops there because $h_3 < h_4$ .
- The new heights are $[4,2,3,3]$ .
- The third boulder starts at $i = 1$ ; since $h_1 \ge h_2$ it rolls to $i = 2$ and stops there because $h_2 < h_3$ .
- The new heights are $[4,3,3,3]$ .
The positions where each boulder stopped are the following: $[2,3,2]$ .
In the second case, all $7$ boulders will stop right at the first mountain rising its height from $1$ to $8$ .
The third case is similar to the first one but now you'll throw $5$ boulders. The first three will roll in the same way as in the first test case. After that, mountain heights will be equal to $[4, 3, 3, 3]$ , that's why the other two boulders will fall into the collection system.
In the fourth case, the first and only boulders will fall straight into the collection system.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted