|
|
back to boardWA #3 What is in test 3????? Re: WA #3 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 не перейти |
|
|