*你，准备好迎接挑战了吗?**🚀
今年，IMC的在线评估题目可说是不简单，但对于熟悉LeetCode的你来说，其难度相当于LC200左右，掌握这个级别，你大约能够击败90%的竞争对手。🔥
但，如果你面对这些题目还觉得“云里雾里”，不用担心…
👉扫描左侧二维码，联系我，一起为这场挑战做好充分的准备，即刻起飞！🚁
不论你是新手还是老鸟，总有一些技巧和策略可以帮你提升。时不我待，机会只属于那些准备好的人！🌠
Avoiding the monsters
in this game a player beins on a two-dimensional grid of size nxm.One el of the grid is marked as the end and the player wants to reach this cel in the grid by moving up,down, eft orrehtHowever, some cels are occupied by monsters.The goal ofthe player is to reach the end cel using a path that maximizes the minimum distance rom any monster along that path
The distance between any two points on the grid with coordinates (X1, y) and (X, 2) is calculated as x -X2 + y -2), where a is the absolute value of integer .
- Congested mountain trail
There is mountain with a popular hikng trai. At one point on the trai, the path narows so that ony a single hiker can pass through at a tme. When severa hikers arive at this pointimultaneousiy, wo queues can build up:one for hikers asrendine the mountain and one for hikers descendine,- t takes each hiker one serond to pas comaietely throueh the narowportion of the tral.if al the watin hikers are al going the same direction (elther ascending or descending,then they can immedlately begin passing through one at a tme, in the order ofher ariva.When hikers going in both directions are wating,then loca custom dictates the folowing procedure for determining which hiker has priorty t.e gets to pas through first
if in the previous second.no hiker passed throueh then the first waitine descending hiker gets to go first lf in the previous second, a descending hiker passed through, then the first hiker in the descending queue goes first. If in the previous second,an ascending hiker passed through, then the hiker in the ascending queue goest first.For each hiker, find the time when they will pass through the narrow portion of the trail
