Can someone explain the approach to the solution of the problem http://codeforces.me/contest/295/problem/C. I've gone through the editorial but it isn't very explanatory.
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3408 |
| 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 | 135 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
Can someone explain the approach to the solution of the problem http://codeforces.me/contest/295/problem/C. I've gone through the editorial but it isn't very explanatory.
I tried to hack the solution http://codeforces.me/contest/548/submission/11295460 using the hack http://codeforces.me/contest/548/hacks/155602/test but it was unsuccesful .
I am unable to understand that despite being a O(n*m*q) solution, how the solution passed the hack but eventually got TLE on a system test?
| Name |
|---|


