Codeforces Round #763 (Div. 2) A. Robot Cleaner

最新推荐文章于 2022-10-24 20:22:18 发布

Evil_boy__

最新推荐文章于 2022-10-24 20:22:18 发布

阅读量495

点赞数

文章标签： c++ 思路模拟算法

本文链接：https://blog.csdn.net/m0_55682843/article/details/122287011

版权

该问题描述了一个机器人在矩形房间中清扫的过程。机器人每秒会根据初始设定的移动方向前进，遇到墙壁会反弹。目标是计算机器人到达指定脏点所需的时间。通过判断机器人和脏点的相对位置，确定最少步数。

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

题目链接：Problem - A - Codeforces

A robot cleaner is placed on the floor of a rectangle room, surrounded by walls. The floor consists of nn rows and mm columns. The rows of the floor are numbered from 1 to n from top to bottom, and columns of the floor are numbered from 1 to m from left to right. The cell on the intersection of the rr-th row and the cc-th column is denoted as (r,c). The initial position of the robot is (rb,cb).

In one second, the robot moves by drdr rows and dcdc columns, that is, after one second, the robot moves from the cell (r,c) to (r+dr,c+dc). Initially dr=1, dc=1. If there is a vertical wall (the left or the right walls) in the movement direction, dcdc is reflected before the movement, so the new value of dcdc is −dc. And if there is a horizontal wall (the upper or lower walls), dr is reflected before the movement, so