AtCoder Beginning Contest 334(1)

最新推荐文章于 2024-10-12 22:47:18 发布

难道没有不存在的昵称了吗

最新推荐文章于 2024-10-12 22:47:18 发布

阅读量1k

点赞数 25

文章标签： c++ 算法开发语言

本文链接：https://blog.csdn.net/abc234sb/article/details/135712222

版权

文章讲述了在一个无限向东向西延伸的道路上，Snukewill按照每`M`米间隔设置圣诞树。Takahashi和Aoki位于坐标`L`和`R`处，要求找出他们之间（包括自身位置）设置的圣诞树数量。给出了两个C++代码片段用于解决此问题，但存在效率问题。

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

B - Christmas Trees Editorial

Score : 250250 points

Problem Statement

There is a road that stretches infinitely to the east and west, and the coordinate of a point located �x meters to the east from a certain reference point on this road is defined as �x. In particular, the coordinate of a point located �x meters to the west from the reference point is −�−x.

Snuke will set up Christmas trees at points on the road at intervals of �M meters, starting from a point with coordinate �A. In other words, he will set up a Christmas tree at each point that can be expressed as �+��A+kM using some integer �k.

Takahashi and Aoki are standing at points with coordinates �L and �R (�≤�)(L≤R), respectively. Find the number of Christmas trees that will be set up between Takahashi and Aoki (including the points where they are standing).

Constraints

−1018≤�≤1018−1018≤A≤1018
1≤�≤1091≤M≤109
−1018≤�≤�≤1018−1018≤L≤R≤1018
All input values are integers.

有些符号乱码，题干截屏如下

#include<iostream>
using namespace std;
int main()
{
    long long a, m, l, r, i, cnt = 0;
    cin >> a >> m >> l >> r;
    for (i = 0;; i++)
    {
        if ((a + i * m > l || a + i * m == l) && (a + i * m < r || a + i * m == r))
        {
            cnt++;
        }
        
        if (a + i * m > r)
            break;

    }
    for (i =-1;; i--)
    {
        if ((a + i * m > l || a + i * m == l) && (a + i * m < r || a + i * m == r))
        {
            cnt++;
        }

        if (a + i * m <l)
            break;
    }
    cout << cnt;
    return 0;
}

使用无脑方法发现有些数据超时

给出的答案

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
ll floor(ll x, ll m) {
    ll r = (x % m + m) % m;
    return (x - r) / m;
}
int main() {
    ll a, m, l, r;
    cin >> a >> m >> l >> r;
    l -= a, r -= a;
    cout << floor(r, m) - floor(l - 1, m) << endl;
}