[Codevs 1961] Dodge Dalong (DFS)

Source: Internet
Author: User

Title: http://dev.codevs.cn/problem/1961/

Analysis:

Cheated by the "spfa" label ......

After reading the hzwer blog, I can use F [I] [0 .. 60] to determine whether each vertex can arrive in every second. How can we get this array? DFS is enough .... However, pay attention to the points that you have walked before. We know that f [I] [J] = 1 (because this indicates a loop ). In case of time complexity, the worst case is that every second can be reached at every point, that is, 7000*60 ......

[Codevs 1961] Dodge Dalong (DFS)

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.