improvement_19's blog

how to solve this dsu related problem
By improvement_19, history, 2 years ago, In English

https://codeforces.com/problemset/problem/177/C1 please help how to solve this question thanks in advance

  • Vote: I like it
  • 0
  • Vote: I do not like it

Comments Comments (2)
| Write comment?
»
2 years ago, # |
  Vote: I like it +1 Vote: I do not like it

You have to invite everyone in a connected component (condition 1) and everyone you invite must be apart of the same connected component (condition 3). Connected components which have two people that dislike each other in it is invalid (condition 2), so the answer is simply the maximum size of all valid connected components.

→ Reply
  • »
    »
    2 years ago, # ^ |
      Vote: I like it +8 Vote: I do not like it

    ok but how does this affect young thug's legacy?

    → Reply