A15793 | Points on Plane
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
You are given a two-dimensional plane, and you need to place $n$ chips on it.
You can place a chip only at a point with integer coordinates. The cost of placing a chip at the point $(x, y)$ is equal to $|x| + |y|$ (where $|a|$ is the absolute value of $a$ ).
The cost of placing $n$ chips is equal to the maximum among the costs of each chip.
You need to place $n$ chips on the plane in such a way that the Euclidean distance between each pair of chips is strictly greater than $1$ , and the cost is the minimum possible.
You can place a chip only at a point with integer coordinates. The cost of placing a chip at the point $(x, y)$ is equal to $|x| + |y|$ (where $|a|$ is the absolute value of $a$ ).
The cost of placing $n$ chips is equal to the maximum among the costs of each chip.
You need to place $n$ chips on the plane in such a way that the Euclidean distance between each pair of chips is strictly greater than $1$ , and the cost is the minimum possible.
输入格式
The first line contains one integer $t$ ( $1 \le t \le 10^4$ ) — the number of test cases. Next $t$ cases follow.
The first and only line of each test case contains one integer $n$ ( $1 \le n \le 10^{18}$ ) — the number of chips you need to place.
The first and only line of each test case contains one integer $n$ ( $1 \le n \le 10^{18}$ ) — the number of chips you need to place.
输出格式
For each test case, print a single integer — the minimum cost to place $n$ chips if the distance between each pair of chips must be strictly greater than $1$ .
输入输出样例
输入 #1
4 1 3 5 975461057789971042
输出 #1
0 1 2 987654321
In the first test case, you can place the only chip at point $(0, 0)$ with total cost equal to $0 + 0 = 0$ .
In the second test case, you can, for example, place chips at points $(-1, 0)$ , $(0, 1)$ and $(1, 0)$ with costs $|-1| + |0| = 1$ , $|0| + |1| = 1$ and $|0| + |1| = 1$ . Distance between each pair of chips is greater than $1$ (for example, distance between $(-1, 0)$ and $(0, 1)$ is equal to $\sqrt{2}$ ). The total cost is equal to $\max(1, 1, 1) = 1$ .
In the third test case, you can, for example, place chips at points $(-1, -1)$ , $(-1, 1)$ , $(1, 1)$ , $(0, 0)$ and $(0, 2)$ . The total cost is equal to $\max(2, 2, 2, 0, 2) = 2$ .
In the second test case, you can, for example, place chips at points $(-1, 0)$ , $(0, 1)$ and $(1, 0)$ with costs $|-1| + |0| = 1$ , $|0| + |1| = 1$ and $|0| + |1| = 1$ . Distance between each pair of chips is greater than $1$ (for example, distance between $(-1, 0)$ and $(0, 1)$ is equal to $\sqrt{2}$ ). The total cost is equal to $\max(1, 1, 1) = 1$ .
In the third test case, you can, for example, place chips at points $(-1, -1)$ , $(-1, 1)$ , $(1, 1)$ , $(0, 0)$ and $(0, 2)$ . The total cost is equal to $\max(2, 2, 2, 0, 2) = 2$ .
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted