| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 164 |
| 1 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 160 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 8 | Dominater069 | 154 |
| 8 | nor | 154 |
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!
How A
How A
How A
good problems
How to prove B?
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).$$$