【Atcoder - AGC027B】Garbage Collector

最新推荐文章于 2024-09-04 16:00:28 发布

Tiw_Air_OAO

最新推荐文章于 2024-09-04 16:00:28 发布

阅读量821

点赞数 1

分类专栏： @常用技巧看这里！@ --贪心！-- @那些日子做过的网赛！@ --Atcoder！--

本文链接：https://blog.csdn.net/Tiw_Air_Op1721/article/details/82721756

版权

该博客讨论了一个关于机器人清理房间垃圾的问题。机器人从原点出发，需要将分布在数轴上的垃圾搬运到垃圾箱，消耗能量进行移动、拾取和丢弃垃圾。问题要求找到最小的能量消耗策略。博客提到了一个贪心算法，先到达最远的垃圾位置，然后在返回过程中拾取垃圾。博主还提醒注意防止数值溢出，并提供了问题的分析和解决方案。

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

@Garbage Collector@

@Garbage Collector@

@题目描述 - English@

Time limit : 2sec / Memory limit : 1024MB

Score : 700 points

Problem Statement
Snuke has decided to use a robot to clean his room.

There are N pieces of trash on a number line. The i-th piece from the left is at position xi. We would like to put all of them in a trash bin at position 0.

For the positions of the pieces of trash, 0 < x1 < x2 < … < xN ≤ 10^9 holds.

The robot is initially at position 0. It can freely move left and right along the number line, pick up a piece of trash when it comes to the position of that piece, carry any number of pieces of trash and put them in the trash bin when it comes to position 0. It is not allowed to put pieces of trash anywhere except in the trash bin.

The robot consumes X points of energy when the robot picks up a piece of trash, or put pieces of trash in the trash bin. (Putting any number of pieces of trash in the trash bin consumes X points of energy.) Also, the robot consumes (k+1)^2 points of energy to travel by a distance of 1 when the robot is carrying k pieces of trash.

Find the minimum amount of energy required to put all the N pieces of trash in the trash bin.

Constraints
1≤N≤2×10^5
0 < x1 < … < xN≤10^9