Boboge's blog

By Boboge, history, 11 months ago, In English

Hi everyone!

Today, our university had run our team selection round. All problems are prepared by me.

Special thanks to Tobo, Duck_sajin, Kyooma, zbceyond, Hile_Meow, gongkoufadongji, Joler_ and jiubei for testing.

The contest is now uploaded to the Codeforces gym at USI-Team-Selection 2023-2024.

I hope you can enjoy the problems!

  • Vote: I like it
  • +24
  • Vote: I do not like it

»
11 months ago, # |
  Vote: I like it +8 Vote: I do not like it

How A

»
11 months ago, # |
  Vote: I like it +8 Vote: I do not like it

good problems

»
10 months ago, # |
  Vote: I like it 0 Vote: I do not like it

How to prove B?

  • »
    »
    10 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Reflect the point $$$(x_2, y_2)$$$ "across" the river, ie. replace with $$$(x_2, -y_2).$$$ If you pick a point $$$p$$$ on the river to go to then distance from $$$p$$$ to $$$(x_2,y_2)$$$ is the same as distance from $$$p$$$ to $$$(x_2,-y_2).$$$ Then by triangle inequality (shortest distance between two points in the plane is the straight line segment between them), so you just choose $$$p$$$ so that $$$(x_1,y_1),p,(x_2,-y_2)$$$ are collinear and the minimum distance is just the distance between $$$(x_1,y_1)$$$ and $$$(x_2,-y_2).$$$