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 1004. Sightseeing Trip

to admin: about multi-edge
Posted by Ade 21 Apr 2017 22:18
My AC code:

input:
>   3 3
>   1 2 1
>   1 2 1
>   1 3 1
>   -1

output:
>   No solution.

Why not
>   1 2

There are two roads connecting "1" and "2", so the route could be 1 - 2 - 1, with different road 1 - 2 and 2 -1
Re: to admin: about multi-edge
Posted by Sandro (USU) 24 Apr 2017 23:08
"Each sightseeing route is a sequence of road numbers y1, …, yk, k > 2."
Re: to admin: about multi-edge
Posted by Ade 25 Apr 2017 08:30
Oops.
Sorry for bothering!
Sandro (USU) wrote 24 April 2017 23:08
"Each sightseeing route is a sequence of road numbers y1, …, yk, k > 2."