Don't miss Google Code Jam 2020 World Finals!
The competition starts today (2020-08-08) at 13:00 UTC and lasts 4 hours.
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3993 |
2 | jiangly | 3743 |
3 | orzdevinwang | 3707 |
4 | Radewoosh | 3627 |
5 | jqdai0815 | 3620 |
6 | Benq | 3564 |
7 | Kevin114514 | 3443 |
8 | ksun48 | 3434 |
9 | Rewinding | 3397 |
10 | Um_nik | 3396 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 155 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
10 | nor | 152 |
Don't miss Google Code Jam 2020 World Finals!
The competition starts today (2020-08-08) at 13:00 UTC and lasts 4 hours.
Название |
---|
Let's see who comes 2nd :)
I would be funny if some participants had internet or power outage at home. Speaking about Gennady.. :)
Or he could submit everything later like in AtCoder, but I don't really see any benefits with this approach at the finals here.
is that why he is 21st right now?
There he is...
tourist orz
What you have to say now.
tourist is god
Looks like it was his AtCoder strat to troll people.
He gave everyone else hope and then just dashed it to the ground... (inb4 one of his submissions fails)
It's not (just) about giving hope. It's about not revealing difficulty of problems and making it harder to plan things for others.
btw. if he solved all big versions of problems, damn it... he's a tourist of Google Code Jam.
Also, for GCJ the penalty time is based only on your last submission, so submitting everything later not necessarily affects your final score (if you got it right at first and doesn`t have to resubmit).
Yeah, tourist is just giving others a little bit of hope when he didn't submit all solutions immediately after he done it.
I wonder what tourist will do for the last ~40mins.
Probably test a lot of corner cases to guarantee his solutions are correct to the larger data sets.
I wonder if he expected Musical Large to fail ahead of time and was working on that, or if the bigger k and adversarial L choices made it more difficult than he expected.
He got runtime in that problem (large subtask).
Check his code, he has assert(k == 1) which clearly means he solved it for the small subtask.
7th time tourist. He is a legend .
Everyone getting rekt by Gennady. What a champ!
First : tourist, Second : ksun, Third : ecnerwala, Congratulations to all!!!
Wow Happy to see Gennady on top again. He is a true genius.
Congratulations tourist . No one was even close to Gennady in the scoreboard .. True Legend
How to solve B?
The editorial is actually out on the site; it seems like B was mostly pruning the size of the brute-force by some observations.
Different to analysis and much easier solution to D-large: just do divide&conquer and then the last paragraph of the official solution.
https://twitter.com/que_tourist/status/1258452821290205184
I really really want to see tourist not win the Codejam finals in the future. Hope someone can beat him!
Power/Internet cut at tourist's house today would have been relatively easier method.
Was using snippets allowed?
Definitely, and actually was used a lot by tourist in the round.
Congratulations
Will we be getting screencasts from the competitors like previous years too?