→ Обратите внимание
До соревнования
2023 Post World Finals Online ICPC Challenge powered by Huawei
13:36:56
Зарегистрироваться »
2023 Post World Finals Online ICPC Challenge powered by Huawei
13:36:56
Зарегистрироваться »
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3690 |
| 2 | jiangly | 3647 |
| 3 | Benq | 3581 |
| 4 | orzdevinwang | 3570 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | Radewoosh | 3509 |
| 8 | ecnerwala | 3486 |
| 9 | jqdai0815 | 3474 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 165 |
| 3 | adamant | 161 |
| 4 | TheScrasse | 160 |
| 5 | nor | 158 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 152 |
| 8 | orz | 146 |
| 9 | SecondThread | 145 |
| 9 | pajenegod | 145 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 06.05.2024 04:23:04 (k2).
Десктопная версия, переключиться на мобильную.
При поддержке
radoslav11 so close.
:")
CF, please add sad reactions :(
Sorry..but can you please explain what 'a contestant' meant?
A contestant means someone who participates in a contest
...I just wanna confirm that I have understood it correctly...so...if he really was a contestant then he would have tried to solve all the question but he just solved the toughest one. Right?...don't downvote if I am still wrong...I am having a hard time understanding this
Yes, he is not a real contestant. How dare he not solve all problems but just the hardest one!
Actually the joke isn't centered around what "a contestant" means. The joke is people who read Petr's blog hope that one day the will get mentioned. So ___ does something unique and worth mentioning... but he doesn't get mentioned by name! So he got "so close" but not close enough. ¯\_(ツ)_/¯
Sorry I made the joke a bit obtuse but it was a tradeoff between making it more understandable and making the delivery shorter and sharper.
For some reason my comment disappeared so I will add it here: it's easier(in my opinion) way to find vertices ABC such that AB and AC are edges and BC is not. Let A — the vertex of highest degree, iterate over B and C — its neighbours. Then if BC is not an edge — stop. It's O(M) checks in a set. If you didn't find such triangle, then all neighbours of A has same degree as A and then graph is clique
Iterating over all three will probably also work. I can understand why it's
but I don't know any case where it's greater than O(M1.5)