just curious
→ Обратите внимание
До соревнования
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
34:06:33
Зарегистрироваться »
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
34:06:33
Зарегистрироваться »
*есть доп. регистрация
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 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 | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 22.11.2024 07:28:28 (k3).
Десктопная версия, переключиться на мобильную.
При поддержке
And is there a Euclidean Distance MST algo
What is a minimum spanning link? Is it a minimum spanning tree? If yes, then you can use any minimum spanning tree algorithm and just use the manhatten distances or the euclidean distances as the edge weights.
I believe the interesting question is whether it's possible to do it faster than O(n^2) due to the need to calculate distance between every pair of points, to which the following links may be useful:
manhattan
euclidean
link is a tree that every node has a degree of 2, except the root and the only leaf
Depending on context, you may also be interested in the rectilinear Steiner tree problem.
Yes, you can do it in O(n lgn) by only creating edges between one point and the closest point to it in each of 8 octants around it, then running normal MST algo on it.
i know how to do manhattan distance MST, im asking about link