| № | Пользователь | Рейтинг |
|---|---|---|
| 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 |
AtCoder Grand Contest 006 will be held on Saturday (time). The writer is sugim48.
Note that this time the contest duration is 130 minutes (20 minutes longer than usual).
The point values are 200 — 400 — 800 — 1300 — 1500 — 1700.
Let's discuss problems after the contest.
After the 20 minutes extension, the contest now clashes with Codechef October Lunchtime for 10 minutes.
It will be my first time I will take part in an atCoder contest. Can you tell me how difficult is each problem relative to codeforces ? It will be same to div2 or div1 or something between ? Thanks !
It is similar to Div1+Div2 rounds in Codeforces. If you know TopCoder, TC Div1 X points = AtCoder 2X points.
It also overlaps for the first 30 minutes with AMPPZ (http://amppz.ii.uni.wroc.pl/harmonogram.html). I guess with so many contests this is inevitable :(
Is this contest popular? Are you interested in participating in this contest?
It's a Polish subregional for ACM ICPC, so all top university students from Poland will be there. However, since it's onsite, I don't think that many of the contestants will be able to compete in AGC even if you decide to shift it.
It doesn't look like there will be an online mirror, but I might be wrong about that, since there were online mirrors in previous years.
Yes, that's a good point — even if there's no overlap, there are other onsite events that make it hard to compete in AGC.
Request "find by name" in standings feature. Friend list even better)
It's really hard to keep track of particular user results now. Or am I missing something?
Solution to problem C is really amazing! Thanks for a great contest!
Unrelated, but how to change the user id on atcoder?
As far as I know there're no ways to change your used id on AtCoder. (However, you can change your "User name" that is not shown in standings) If it's necessary to change your User ID, you should contact one of AtCoder's admins (e.g. rng_58).
I'm really surprised by the solution to problem D which uses binary search. Cool problem.
Could you show the number of AC solutions + tags for each task in the contest dashboard. That roughly gives an idea whether I should attempt the problem or not when I am practicing on past contests.
Ya that seems like a good idea. For the time being though, you can achieve this by going to All Submissions -> Filter (Problem = and Verdict = AC) to see how many AC solutions there are.
You can see here: https://agc006.contest.atcoder.jp/statistics
Thanks, but I couldn't see problem tags there. I think it would be helpful if you could filter out problems based on tags on atcoder too because the questions are really great, only this thing is missing.
In problem C Rabbit Exercise: what is "exponentiation of a permutation" mentioned in the editorial?
I haven't seen the editorial, but they're probably talking about composing a permutation with itself multiple times.
You can read about composition of permutations here.
Since the operation is associative, you can use binary exponentiation to compose a permutation of length n with itself k times in
time. Alternatively, you can look at the disjoint cycle decomposition of the permutation, and then map each element to the element that is its k-successor in its cycle. This will give an O(n) time algorithm.
If you want to try implementing this separately, you can check out this problem. It's in Icelandic, but the problem basically just asks you to apply that permutation to itself k times. There's also the reverse problem, and a slightly harder variant.