in this problem. the third test case says that node 2 and node 1 have cats so the path from 1 to 2 has 2 cats which is less than m . but the jury answer is that there is no path with <= m cats . can anyone help me understand this test case ?
A Graph Problem
in this problem. the third test case says that node 2 and node 1 have cats so the path from 1 to 2 has 2 cats which is less than m . but the jury answer is that there is no path with <= m cats . can anyone help me understand this test case ?
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en2 | ShowStopper728 | 2017-12-19 11:31:06 | 11 | Tiny change: ' which is less than m .\nbut ' -> ' which is equal to m .\nbut ' | ||
en1 | ShowStopper728 | 2017-12-19 11:28:53 | 305 | Initial revision (published) |