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

Common Board

help!!!!
Posted by peng du 22 Oct 2001 18:26
about problem 1129
    I find a algorithm to erase circle from the graph,then
only trees left,so the painting can be done.But When I use
dfs to find circle,it gets time limit,How can I optimize it
or other effective algorithm exists?Please help me.