Google Code Jam World Finals 2017 just started. Here are some relevant links:
Good luck to the participants:)!
Update: Contest is over. Contest Analysis
Final Standing
→ Обратите внимание
До соревнования
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
27:35:59
Зарегистрироваться »
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
27:35:59
Зарегистрироваться »
*есть доп. регистрация
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 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 13:59:03 (h2).
Десктопная версия, переключиться на мобильную.
При поддержке
tourist is solving D I guess.
No man, He is an idiot
You sure?
you can see that from scoreboard
Yeah, but that doesn't mean he's an idiot. He could have a comeback when he solves D or E.
Heh, sit and watch
Sure. I'll wait.
Well, he's in second. So...
The time penalty is calculated from the time of the last successful submission so it doesn't really matter the order he submits in. For all we know he could have solved A and C already and just not submitted yet... He may also be pursuing a strategy similar to the one he discussed in his most recent blog post as solving several problems at the same time helps him think... I wouldn't be to sure to judge his success in this contest from such a preliminary scoreboard.
trẻ trâu xD
tourist is the boss of this game. From 20th to 1st. Congrats!!!
Late-submit strategy, as always
Well, he ended up 2nd, so sad...
sys test has not begun yet (I think).
SnapDragon last minute snipe. IOI 2017 day 1 all over again.
From the stream, it looks like SnapDragon have two solutions that differ on two testcases, and he "randomly" submitted one of them.
IMHO, there is a relatively high(er) probability that he will fail the last-minute submitted D-large.
tourist won, yey
rng_58 and SnapDragon can surprise tourist. They are my favourites :)
seems like SnapDragon suddenly becomes your favourite after the last second submit? ;)
I noticed late that he was participating ;)
tourist is about to be 4 time Code Jam Champion. He has a comfortable 20 point lead over zemen
Tourist came second
We don't know until they Sys Test the large inputs.
oops
Well he won!
My bad :D
I found something random in the suggestions.
I watched it for 15 minutes, and then I was like "how did i get here" :v
Any one know if snapdragon's other solution was correct?
The stream was a little misleading; I only had the one hastily-coded solution. For each case, it just tries over and over to prove that the answer is "NO" (by taking two points, slightly perturbing them, and seeing if all the points lie on one side of that plane). Any "NO"s that it output were definitely correct, but "YES"s were suspect. I ran the large using 10,000 attempts, and submitted, then since I had more time, ran it with 100,000 attempts. That got me two more "NO"s.
However, apparently I was still off by 17 cases ("NO"s that I reported as "YES"), so my randomized floating-point-based solution was probably doomed no matter what I did. I'm just lucky it worked for the Small. :)
it was really a nailbiting moment from the stream perspective, congrats for getting 4th place!
Why google do this competition every year if they can just give $15k to Gennady?
To give false hope to other competitors.
I know that I cannot solve any of the problems, but just for the sake of my imagination can somebody tell me how hard the problems actually are . Are they Div 1 E or higher?
They're very difficult. I can't solve any large.
I found A large to be much simpler than B large. I would say A large is a Div 1C at best. There is not much difference in idea between the solution for small and large dataset and optimizing O(n3) to O(n2) isn't that hard.
Since comments are disabled in the live stream, I have to ask here. Does anyone know which song is played at 4:15:00?
Darude — Sandstorm
The Teleporters problem immediately reminded me of https://community.topcoder.com/stat?c=problem_statement&pm=12416