| # | User | Rating |
|---|---|---|
| 1 | ecnerwala | 3649 |
| 2 | Benq | 3581 |
| 3 | orzdevinwang | 3570 |
| 4 | Geothermal | 3569 |
| 4 | cnnfls_csy | 3569 |
| 6 | tourist | 3565 |
| 7 | maroonrk | 3531 |
| 8 | Radewoosh | 3521 |
| 9 | Um_nik | 3482 |
| 10 | jiangly | 3468 |
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 3 | adamant | 162 |
| 4 | TheScrasse | 159 |
| 5 | nor | 158 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 151 |
| 8 | SecondThread | 147 |
| 9 | orz | 146 |
| 10 | pajenegod | 145 |
Hello Codeforces!
I just got a mail from my leader this morning, which says that the IOI 2013 syllabus will be used at IOI 2015.
It's explained in this note in misof's syllabus page.
So, explicitly excluded topics in the IOI 2013 syllabus won't be needed, essentially:
max flow and bipartite matching algorithms
implementation of any general balanced tree (e.g., AVL, treaps, splay trees)
Hope it helps!
Hello Codeforces!
I implemented a solution with a range tree as bmerry explains here.
It passes the 3 first subtasks but I get Memory Limit on the 2 last subtasks, though I'm using a sparse segment tree.
I store the tree with pointers (each Node has pointers to left son and right son).
I only allocate memory for a node if it is visited during an update.
If I arrive to a node which doesn't exist during a query, I don't create it, I just return 0 (because all the elements covered by this node are zeroes).
So, my memory complexity is O(logR·logC·Nu), which seems to be too big :'( Do you have a trick to reduce the ML ?
