I'm preparing the upcoming ICPC. Can anyone tell me some tricks on Tree/Graph/Sequence in ICPC?
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
8 | ecnerwala | 3494 |
9 | Um_nik | 3396 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | -is-this-fft- | 162 |
3 | maomao90 | 159 |
3 | atcoder_official | 159 |
5 | cry | 158 |
5 | awoo | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | Dominater069 | 152 |
I'm preparing the upcoming ICPC. Can anyone tell me some tricks on Tree/Graph/Sequence in ICPC?
After being orange, I found a new option, propose a contest/problems. Can anyone tell me how to do that if I want to propose a contest/problems? Thanks a lot!
In recent contest, I couldn't enter codeforces because of Human machine verification for over 15 minutes after the contest started. This gave me a very bad experience and I have to vp at another time. What can I do? I don't want to read the problems 15 minutes or more later than others, especially in next div1+2.
problem D from CodeTON Round 8, my code get MLE: https://codeforces.net/contest/1942/submission/254227380, but why? I solve it in O(nklogn), and memory for O(nk), and MLE on test 5.
Anyone has some advice for practice? Sometimes I can solve difficulty up to 2400 but sometimes can't.
upd: Can anyone suggest some difficult and important algorithm that a GM needs to learn?
Name |
---|