Pls... help me out with this problem
http://www.spoj.com/problems/ANGELS/
It uses bipartite matching i guess. But am not able to build the graph .
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
Pls... help me out with this problem
http://www.spoj.com/problems/ANGELS/
It uses bipartite matching i guess. But am not able to build the graph .
Name |
---|
Your guess is absolutely correct. Consider vertical and horizontal segments formed by adjacent symbols 'A' in every row and in every column. If we want to place a "fighter" in some square (i, j), we can't place any "fighter" in vertical and in horizontal segments that (i,j) belongs to.
So, we need to make a bipartite graph where vertices are segments and edges are squares (i,j) where we can place a "fighter".
Maximal matching in this graph is the answer for the problem.
got it.... :)
thnx a lot