Hi,
Can someone explain the solutions for problems F and I of the 2017 Hackatari Codeathon?
Thanks in advance!
# | User | Rating |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 161 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | awoo | 154 |
8 | Dominater069 | 154 |
10 | luogu_official | 151 |
Hi,
Can someone explain the solutions for problems F and I of the 2017 Hackatari Codeathon?
Thanks in advance!
Name |
---|
Well, only three guys solved it. Let's mark them! :D
Deemo
Noureldin (Oh I know you from a previous post of mine. Hi! :D)
Pleeease help us. :D
for problem F
imagine that there is a boundary to the grid colored in some color (say 0)
build a graph where nodes are islands/colores and two colors (say c1 and c2) share an edge if there are two adjacent cells where one cell is colored in c1 and the other in c2
an island (with color c1) contains another (say c2) only if c1 lies on every path from 0 to c2 ,this part can be computed using dfs
PS: to be honest I didn't know how to compute the last part until I peeked into Deemo 's solution
as for problem I
Thanks, will try it! :)