| # | User | Rating |
|---|---|---|
| 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 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 164 |
| 1 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 160 |
| 5 | -is-this-fft- | 158 |
| 6 | adamant | 157 |
| 6 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 8 | nor | 154 |
| 10 | djm03178 | 153 |
Hi everyone!
I have impressive achievements such as the top6 of Belarus on Codeforces.com, the winner of Ukrainian Olympiad in Informatics, the winner of anime quis in SIS. I love russian phonk. My friends call me bebrochka.
Ask me anything you want in the comments.
A lot of time has passed since the end of these rounds. I and other users codeforces want to have task ratings for effective practice. Please, can rate problems CF Rounds 845 & 846.
How to solve 2 dimesional subset sum problem elegant?
2 dimesional subset sum is: You give $$$n$$$ pairs $$$x_i$$$, $$$y_i$$$, choose any $$$k$$$ elements that $$$x_1+x_2+...+ x_k = 0$$$ and $$$y_1+y_2+...+ y_k = 0$$$.
I can solve this only with dp on O($$$n^3$$$ $$$\cdot$$$ $$$c^2$$$), where $$$n$$$ — count elements and $$$c$$$ — max $$$x$$$ or $$$y$$$ element, and with bitset get optimaze on divide time to $$$64$$$. Also I can solve using meet-in-the-middle. Are all these solutions 2-d subset sum?
