I used 2D BIT (Range Updates, Point queries) to solve this problem . Here is my solution which results in WA. Can someone please tell me why is this solution failing?
# | 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 | 166 |
2 | maomao90 | 163 |
2 | Um_nik | 163 |
4 | atcoder_official | 161 |
5 | adamant | 160 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | nor | 153 |
9 | Dominater069 | 153 |
I used 2D BIT (Range Updates, Point queries) to solve this problem . Here is my solution which results in WA. Can someone please tell me why is this solution failing?
http://www.spoj.com/problems/SELLPHN2/
I used Dinic's algorithm to solve this problem yet I am getting WA. Can someone please take a look at my code and tell me why exactly is it failing?
Link to code: https://ideone.com/T6fsQv
Name |
---|