A16356 | Doremy's Connecting Plan
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
Doremy lives in a country consisting of $n$ cities numbered from $1$ to $n$ , with $a_i$ people living in the $i$ -th city. It can be modeled as an undirected graph with $n$ nodes.
Initially, there are no edges in the graph. Now Doremy wants to make the graph connected.
To do this, she can add an edge between $i$ and $j$ if
$$$$ \sum_{k \in S} a_k \ge i\cdot j \cdot c, $$ </p><p>where $S$ is the set of all the nodes that are currently in the same connected component of either $i$ or $j$ , and $c$ is a given constant.</p><p>Can Doremy make the graph connected?</p><p>Two nodes $(i, j)$ are in the same connected component if there exists a path from $i$ to $j$$$. A graph is connected if all its nodes are in the same connected component.
Initially, there are no edges in the graph. Now Doremy wants to make the graph connected.
To do this, she can add an edge between $i$ and $j$ if
$$$$ \sum_{k \in S} a_k \ge i\cdot j \cdot c, $$ </p><p>where $S$ is the set of all the nodes that are currently in the same connected component of either $i$ or $j$ , and $c$ is a given constant.</p><p>Can Doremy make the graph connected?</p><p>Two nodes $(i, j)$ are in the same connected component if there exists a path from $i$ to $j$$$. A graph is connected if all its nodes are in the same connected component.
输入格式
The input consists of multiple test cases. The first line contains a single integer $t$ ( $1\le t\le 10^4$ ) — the number of test cases. The description of the test cases follows.
The first line contains two integers $n$ , $c$ ( $2\le n\le 2\cdot 10^5$ , $1 \le c \le 10^6$ ) — the number of nodes and the constant.
The second line of each test case contains $ n $ integers $ a_1,a_2,\ldots,a_n $ ( $0 \le a_i \le 10^{12}$ ) — the number of people living in the $i$ -th city.
It is guaranteed that the sum of $n$ over all test cases does not exceed $2\cdot 10^5$ .
The first line contains two integers $n$ , $c$ ( $2\le n\le 2\cdot 10^5$ , $1 \le c \le 10^6$ ) — the number of nodes and the constant.
The second line of each test case contains $ n $ integers $ a_1,a_2,\ldots,a_n $ ( $0 \le a_i \le 10^{12}$ ) — the number of people living in the $i$ -th city.
It is guaranteed that the sum of $n$ over all test cases does not exceed $2\cdot 10^5$ .
输出格式
For each test case, print "YES" (without quotes), if it is possible to make the graph connected, and "NO" (without quotes) otherwise.
You can print letters in any case (upper or lower).
You can print letters in any case (upper or lower).
输入输出样例
输入 #1
7 4 10 0 20 15 10 2 1 1 1 5 1 0 1 0 4 199 5 2 1 1 3 1 1 5 5 5 6 1 10 2 5 1000000 1000000000000 1000000000000 1000000000000 1000000000000 1000000000000 3 1 0 0 2
输出 #1
Yes Yes Yes No No Yes No
In the first test case, Doremy can add edges in the following order:
1. Add $(1,2)$ . This operation is valid because $a_1 + a_2 = 20 \ge i\cdot j \cdot c = 20$ .
2. Add $(1,3)$ . This operation is valid because $a_1 + a_2 + a_3 = 35 \ge i \cdot j \cdot c = 30$ .
3. Add $(1,4)$ . This operation is valid because $a_1 + a_2 + a_3 + a_4 = 45 \ge i \cdot j \cdot c = 40$ .
In the second test case, Doremy can add edge $(1,2)$ because $a_1 + a_2 =2 \ge 1 \cdot 2 \cdot 1$ . After that, the graph is connected.
In the third test case, Doremy can add edges in the order $(5,4)$ , $(5,3)$ , $(5,2)$ and $(5,1)$ .
In the fourth test case, Doremy cannot add any edge at all.
1. Add $(1,2)$ . This operation is valid because $a_1 + a_2 = 20 \ge i\cdot j \cdot c = 20$ .
2. Add $(1,3)$ . This operation is valid because $a_1 + a_2 + a_3 = 35 \ge i \cdot j \cdot c = 30$ .
3. Add $(1,4)$ . This operation is valid because $a_1 + a_2 + a_3 + a_4 = 45 \ge i \cdot j \cdot c = 40$ .
In the second test case, Doremy can add edge $(1,2)$ because $a_1 + a_2 =2 \ge 1 \cdot 2 \cdot 1$ . After that, the graph is connected.
In the third test case, Doremy can add edges in the order $(5,4)$ , $(5,3)$ , $(5,2)$ and $(5,1)$ .
In the fourth test case, Doremy cannot add any edge at all.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted