| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 134 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
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 |
|---|


