| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3611 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | Radewoosh | 3415 |
| 8 | Um_nik | 3376 |
| 9 | maroonrk | 3361 |
| 10 | XVIII | 3345 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 162 |
| 2 | adamant | 148 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 141 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 133 |
|
+10
yes got it, thank you. |
|
0
problem D : if a linear chain of size > k is connected to a k length cycle then how is possible to generate a pattern to get array B? |
|
+11
i think current bio section is simple and perfect, I would have my stats speak for itself rather than explaining myself (which sometimes make me feel like m on a dating/job_hunting site), and contacts and work relations are already present for anyone to find ones personal side. |
|
+27
Personally, whenever these people give contest I feel very happy cause I know I can learn alot from their code after contest, at present almost all of them actively give contest. |
|
0
you are doing dijkstra for each node considering you are using new visited array for each each node to it looks like $$$n^2logn$$$ solution might not work for the constraint given. |
