## CCO '15 P2 - Artskjid

View as PDF

Points: 15 (partial)
Time limit: 1.0s
Memory limit: 1G

Problem types

There are many well-known algorithms for finding the shortest route from one location to another. People have GPS devices in their cars and in their phones to show them the fastest way to get where they want to go. While on vacation, however, Troy likes to travel slowly. He would like to take the longest route to his destination so that he can visit many new and interesting places along the way.

As such, a valid route consists of a sequence of distinct cities, , such that there is a road from to for each .

He does not want to visit any city more than once. Can you help him find the longest route?

#### Input Specification

The first line of input contains two integers , the total number of cities and the number of roads connecting the cities (; ). There is at most one road from any given city to any other given city. Cities are numbered from to , with being Troy's starting city, and being his destination.

The next lines of input each contain three integers . Each triple indicates that there is a one way road from city to city of length km (; ; ; ). Each road is one-way: it can only be taken from to , not vice versa. There is always at least one route from city to city .

For at least 30% of the marks for this problem, .

#### Output Specification

Output a single integer, the length of the longest route that starts in city , ends in city , and does not visit any city more than once. The length is the sum of the lengths of the roads taken along the route.

#### Sample Input

3 3
0 2 5
0 1 4
1 2 3

#### Output for Sample Input

7

#### Explanation of Output for Sample Input

The shortest route would be to take the road directly from to , of length km. The route going from to to is km, which is longer.

• commented on March 16, 2022, 2:57 p.m.

Troy: wants longest route

gas prices now: NO

• commented on March 15, 2022, 4:59 a.m.

This comment is hidden due to too much negative feedback. Show it anyway.

• commented on March 15, 2022, 10:54 p.m. edit 3
1. Copies from geeks for geeks - https://dmoj.ca/src/4418660

2. Complains the question is impossible

3. Copies from Github - https://dmoj.ca/src/4418706

4. Proceeds to solve 40pp IOI problems effortlessly

• commented on March 16, 2022, 12:51 a.m.

This comment is hidden due to too much negative feedback. Show it anyway.

• commented on March 16, 2022, 1:51 p.m.

jorgebean, you've been a sussy baka

• commented on March 16, 2022, 8:34 a.m. edited

Not gonna lie, to me that sounds a bit...

...farfetch'd

• commented on March 16, 2022, 2:05 a.m.

effortlessly.

• commented on March 16, 2022, 1:50 a.m.
• commented on March 16, 2022, 1:57 a.m.

• commented on March 16, 2022, 1:48 a.m.

preach king

• commented on March 15, 2022, 2:30 p.m.

Given that more than people have solved this question, I doubt the test cases (or intended solutions) are wrong. If you have a specific issue with your code, you can ask for help in the DMOJ Discord server.

• commented on March 15, 2022, 8:58 a.m.

• commented on July 12, 2021, 1:29 p.m.

is this graph acyclic

• commented on July 12, 2021, 7:26 p.m.

Given the contraints that can be (which is that every city has a road to every other city), probably no.

• commented on Nov. 27, 2020, 12:48 a.m.

I just figured out that the title is Dijkstra backwards lol

• commented on July 24, 2020, 8:17 p.m.

Can this problem be solved in polynomial time?

• commented on July 24, 2020, 10:43 p.m.

No. (assuming that P is not NP)

• commented on July 24, 2020, 10:32 p.m. edited

Most likely no, since all the submissions to this problem are in exponential time.

Edit: I'm stupid and thought exponential time was polynomial.

• commented on Aug. 29, 2018, 10:52 p.m.

TFW you think the roads aren't one-directional

• commented on Dec. 29, 2018, 2:11 a.m.

TFW you read this comment and still make the same mistake

• commented on Nov. 17, 2020, 11:17 p.m.