Codeforces Round #665 (Div. 2) A. Distance and Axis

最新推荐文章于 2022-06-07 01:06:38 发布

blue bear

最新推荐文章于 2022-06-07 01:06:38 发布

阅读量201

点赞数

分类专栏： codeforces 文章标签：算法

本文链接：https://blog.csdn.net/weixin_44354699/article/details/108162898

版权

codeforces 专栏收录该内容

13 篇文章 0 订阅

订阅专栏

这是一道来自Codeforces的算法题目，要求在OX轴上找到一个整数点B，使得从原点O到B的距离与从点A到B的距离的绝对差等于k。初始点A坐标为n，k的范围在0到10^6之间。解题思路涉及判断B相对于A的位置，并计算最小步数。

摘要由CSDN通过智能技术生成

Title

CodeForces 1401 A. Distance and Axis

Time Limit

1 second

Memory Limit

256 megabytes

Problem Description

We have a point $A$ with coordinate $x = n$ on $O X$ -axis. We’d like to find an integer point $B$ (also on $O X$ -axis), such that the absolute difference between the distance from $O$ to $B$ and the distance from $A$ to $B$ is equal to $k$ .
在这里插入图片描述

Since sometimes it’s impossible to find such point $B$ , we can, in one step, increase or decrease the coordinate of $A$ by $1$ . What is the minimum number of steps we should do to make such point $B$ exist?

Input

The first line contains one integer $t$ ( $\le t \le 6000$ ) — the number of test cases.

The only line of each test case contains two integers $n$ and $k$ ( $\le n, k \le 10^6$ ) — the initial position of point $A$ and desirable absolute difference.

Output

For each test case, print the minimum number of steps to make point $B$ exist.

Sample Input

6
4 0
5 8
0 1000000
0 0
1 0
1000000 1000000

Sample Onput

Note

In the first test case (picture above), if we set the coordinate of $B$ as $2$ then the absolute difference will be equal to $∣ (2 - 0) - (4 - 2) ∣ = 0$ and we don’t have to move $A$ . So the answer is $0$ .

In the second test case, we can increase the coordinate of $A$ by $3$ and set the coordinate of $B$ as $0$ or $8$ . The absolute difference will be equal to $∣ 8 - 0 ∣ = 8$ , so the answer is $3$ .
在这里插入图片描述

Source

CodeForces 1401 A. Distance and Axis

题意

$O X$ 轴上给出点 $A$ 的位置 $n$ ，和 $k$ 。

每次操作可以移动A向左或向右一个单位。

求最小操作使得 $∣ ∣ O B ∣ - ∣ A B ∣ ∣ = k$ 。（B可以在轴上的任意整数点）

思路

当 $B$ 在 $A$ 点左侧时，可以看做将 $∣ O A ∣$ 划分成两段。
1. 如果 $∣ O A ∣$ 是奇数，则一定是奇数-偶数得奇数，偶数则一定得偶数
2. 所以 $∣ O A ∣$ 可以得到 $\le n$ 的任意同奇偶性的 $k$
3. 当不同奇偶性时可以往右移 $1$ 个单位
当B在A点右侧时
- 易得答案是 $∣ O A ∣$ ，则结果为 $k - n$ (k>n时)

所以答案为 $\% 2 \ne n \% 2), k - n)$

AC代码:

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int maxn = 3e5 + 5;
const ll inf = 0x3f3f3f3f;
const ll mod = 1e9 + 7;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);

    int T;
    cin >> T;
    while (T--) {
        int n, k;
        cin >> n >> k;
        cout << max(int(k % 2 != n % 2), k - n) << endl;
    }
    return 0;
}