HRT 2022 Algo Dev Intern OA

1.Given two lists of 6-faced dices values, what is the minimum number of flipping needed to make the sums of the two lists equal?


2.Given a m by n matrix with each entry being one of the following (blocks, guard with looking direction (right, up, left, down), assassin start position, or empty), determine if it is possible for the assassin to reach the destination at the bottom right of the matrix without being found by a guard or obstructed by the blocks. Note the guard's view can be blocked by other guards or existing blocks.

请问楼主的是120min 3道题的OA吗？

请问楼主第二题M和N的bound是多大呀？

PanJunan 发表于 2021-10-4 22:19
请问楼主的是120min 3道题的OA吗？

120mins for 2 questions

匿名者 发表于 2021-10-5 01:08
请问楼主第二题M和N的bound是多大呀？

do not remember... but BFS should be fine.

lz收到店面了吗？