# | User | Rating |
---|---|---|
1 | tourist | 3947 |
2 | ecnerwala | 3654 |
3 | jiangly | 3627 |
4 | jqdai0815 | 3620 |
5 | orzdevinwang | 3612 |
6 | Benq | 3586 |
7 | Radewoosh | 3582 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | ksun48 | 3474 |
# | User | Contrib. |
---|---|---|
1 | awoo | 163 |
2 | maomao90 | 160 |
3 | adamant | 156 |
4 | atcoder_official | 155 |
5 | maroonrk | 152 |
6 | -is-this-fft- | 148 |
6 | SecondThread | 148 |
8 | Petr | 147 |
9 | nor | 145 |
10 | cry | 144 |
I am newbie in the competitive programming community. I have solved a few problems with difficulty less than 1200 mostly with tags greedy, math, implementation. Here are my submissions Then I started to move on with different tags starting from data structures But now, I cannot solve those problems (tagged data structures) , though I seem to understand those questions but I cannot code most of the solution... still there were some problems on which I got AC, but they seem to have execution time > 1000 ms which I think are not efficient, right ? Can anyone please help me on how to move ahead in this journey ? It would be very good. More specifically I want to know how to solve problems ahead with possibly more difficulty and varying tags, or is there something wrong with my approach ?
Name |
---|