Anjaneyrai's blog

BIPARTITE COLORING Problem 360 Div1 A
By Anjaneyrai, history, 6 years ago, In English

Hello !! Can anyone tell why i am getting WA in this Bipartite coloring problem here is the link to my solution Here I have to do the partition of graph and store the respective nodes and print them Please Help!!

  • Vote: I like it
  • -1
  • Vote: I do not like it

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

You are getting WA because your solution assumes that the graph has only 1 connected component(i.e.,it is connected).

→ Reply