ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

Discussion of Problem 1080. Map Coloring

WA #3
Posted by Iury Izotov FT-16 26 Jun 2016 17:12
What is in test 3?????
Re: WA #3
Posted by Berdnikov Sergey 26 Jan 2017 04:39
I dont know, but if you are using BFS in your solution, you should remember, that graph can contain more than 1 connected component. Try this test:
6
2 3 0
0
0
5 6 0
0
0
one of answers: 011100
Re: WA #3
Posted by Artem 21 Mar 2023 05:06
тест неверный, по условию можно в любую страну перейти, а у вас например из 1 в 4 не перейти