ENG
RUS
Timus 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
1691
. Algorithm Complexity
how about the idea?
Posted by
program_lover
14 Mar 2009 15:35
if from t to s is possible then result=1
else result=-1
use Adjacency List to express the graph
© 2000–2024
Timus Online Judge Team
. All rights reserved.