How to solve problem B ?
This problem looks similar to SPOJ-WATER
Someone please explain the approach to this problem?
Thank you!
# | User | Rating |
---|---|---|
1 | tourist | 3748 |
2 | Benq | 3540 |
3 | Petr | 3470 |
4 | Radewoosh | 3355 |
5 | ecnerwala | 3347 |
6 | maroonrk | 3345 |
7 | jiangly | 3324 |
8 | scott_wu | 3313 |
9 | ainta | 3298 |
10 | boboniu | 3289 |
# | User | Contrib. |
---|---|---|
1 | 1-gon | 200 |
2 | Errichto | 197 |
3 | rng_58 | 194 |
4 | SecondThread | 186 |
5 | awoo | 185 |
6 | Um_nik | 182 |
7 | vovuh | 179 |
8 | Ashishgup | 175 |
9 | antontrygubO_o | 174 |
10 | -is-this-fft- | 173 |
How to solve problem B ?
This problem looks similar to SPOJ-WATER
Someone please explain the approach to this problem?
Thank you!
Name |
---|
I approached it in a way similar to Bellman Ford Algorithm . Take a matrix W and fill all the entries with infinity except the ones present in the border of the grid ie. i = 0 || i = (R - 1) || j = 0 || j = (C - 1) where i, j are the row index and column index respectively.
Now for each cell in the interior of the matrix water can come from 4 adjacent cells . We need to find the minimum of the incoming water from these cells and make this the new W[i][j] only if its greater than H[i][j]
For each cell with index i, j: min = min(W[x][y])
x, y adjacent to i, j and W[i][j] = max(min, H[i][j])
You need to run this relaxation for R * C times
My Java Code:
Link